{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07363591,0.0022082168,0.9111008,0.0019083115,0.00038709867,0.00010949757,0.00055171445,0.00014985824,0.009948649],"genre_scores_gemma":[0.76238173,0.0046718237,0.18227528,0.00045681206,0.0007884353,0.0003956442,0.0011207871,0.00036216024,0.04754741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825114,0.0007613818,0.00007671042,0.00037882448,0.00027140888,0.00026046953],"domain_scores_gemma":[0.9953526,0.0033943586,0.0004707408,0.00014340732,0.00035026585,0.00028862766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029271217,0.0018386933,0.0022195978,0.0012761154,0.0008707731,0.002855198,0.004174516,0.003733887,0.0050366223],"category_scores_gemma":[0.012191675,0.0018560755,0.0017947032,0.0027616287,0.0018263488,0.0046654525,0.0018581279,0.0030734362,0.00061821355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016568552,0.000094468254,0.0004921231,0.0002454298,0.00010995285,0.0002806901,0.00010651589,0.8352083,0.0008239859,0.1486334,0.0028941117,0.010945292],"study_design_scores_gemma":[0.000019659146,0.000023510189,0.000094566334,0.000010572495,0.000023360959,0.000037000194,0.00003080972,0.9665837,0.00012799328,0.03215285,0.00088333763,0.0000127421645],"about_ca_topic_score_codex":0.013613285,"about_ca_topic_score_gemma":0.006462944,"teacher_disagreement_score":0.013613285,"about_ca_system_score_codex":0.0026522144,"about_ca_system_score_gemma":0.0032603445,"threshold_uncertainty_score":0.027068079},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045983445,0.0015499124,0.93165815,0.0014353334,0.0001488859,0.00032453338,0.0004071275,0.00014833629,0.018344175],"genre_scores_gemma":[0.58955216,0.0026261066,0.37876472,0.00037939835,0.00040900626,0.0006990686,0.0007131679,0.0003714117,0.026484942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983419,0.0008693913,0.00005654942,0.0002585997,0.00024181897,0.000231693],"domain_scores_gemma":[0.99482274,0.004319007,0.00023421389,0.00010779394,0.00021661699,0.00029958988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003529325,0.0020855903,0.0052086096,0.0025286472,0.0012642521,0.0038073563,0.005052066,0.0054079904,0.013323732],"category_scores_gemma":[0.008070973,0.0030644932,0.0025683455,0.003951815,0.0027351438,0.0061861146,0.0027184002,0.0035076095,0.00094404374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001665936,0.00021069529,0.0005051026,0.00028073112,0.000115333634,0.0002900798,0.00007945618,0.9125244,0.0004995706,0.06681696,0.00287012,0.01564091],"study_design_scores_gemma":[0.000031331714,0.000037754,0.000093990086,0.000016218091,0.00002724354,0.000035510024,0.00003407613,0.9735108,0.00008663687,0.02563074,0.0004827019,0.0000130082835],"about_ca_topic_score_codex":0.009222946,"about_ca_topic_score_gemma":0.008013498,"teacher_disagreement_score":0.013323732,"about_ca_system_score_codex":0.0026041463,"about_ca_system_score_gemma":0.002735205,"threshold_uncertainty_score":0.044572294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021193193,0.00028078994,0.97618085,0.00012867854,0.00012888928,0.0003602704,0.00026465135,0.0005564675,0.00090631633],"genre_scores_gemma":[0.36423653,0.00046686977,0.62770694,0.00016846307,0.00026457425,0.0016443098,0.0012674761,0.00024596092,0.0039988956],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94145966,0.041644044,0.0020414968,0.005903818,0.0075052185,0.0014457755],"domain_scores_gemma":[0.72056186,0.22281483,0.006788937,0.023999674,0.023495996,0.0023387338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.062660195,0.0015122304,0.0038257411,0.003216128,0.0017247472,0.0029818278,0.0039190673,0.0028194888,0.0085508935],"category_scores_gemma":[0.20655963,0.0011339217,0.0021082538,0.0033275825,0.004084594,0.0048545785,0.002173368,0.0039714132,0.0012901895],"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.0045375745,0.00064869656,0.033742137,0.001647801,0.0008718979,0.00096496625,0.0026145517,0.16555594,0.007683092,0.3283622,0.011068227,0.4423029],"study_design_scores_gemma":[0.00027392342,0.0014807511,0.012025828,0.0001731057,0.00022401562,0.00042555964,0.00026771222,0.89967054,0.0044817184,0.075028,0.005716199,0.00023276595],"about_ca_topic_score_codex":0.005541917,"about_ca_topic_score_gemma":0.0032905343,"teacher_disagreement_score":0.062660195,"about_ca_system_score_codex":0.0016579997,"about_ca_system_score_gemma":0.0044894926,"threshold_uncertainty_score":0.3313828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033901315,0.000620053,0.9545934,0.0005574084,0.00010450295,0.00023308568,0.0003413796,0.00025091413,0.009397891],"genre_scores_gemma":[0.4033879,0.00096475484,0.57998246,0.00015804407,0.00021596566,0.0007837042,0.00043002111,0.000247996,0.01382908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994535,0.0002269037,0.000020366468,0.00010881665,0.00010276648,0.000087581015],"domain_scores_gemma":[0.99833435,0.001334408,0.00012645824,0.000051485298,0.0000791323,0.00007414731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017516962,0.0013666241,0.001908861,0.0013773732,0.0006779475,0.0021068258,0.0022254982,0.0028696614,0.006156778],"category_scores_gemma":[0.004002104,0.0014555737,0.0013709638,0.0022185144,0.00081146683,0.0036405588,0.001553707,0.0017389735,0.00049689226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007175444,0.00006498746,0.0001812098,0.000060732833,0.000028231701,0.000054492655,0.00002502092,0.9689174,0.00046187575,0.0133892605,0.0011951188,0.0155498665],"study_design_scores_gemma":[0.000018864679,0.000024615161,0.000070045135,0.0000065398704,0.00001159708,0.000022328879,0.000016062946,0.99245304,0.00018443915,0.0067257127,0.0004604166,0.000006340353],"about_ca_topic_score_codex":0.006835087,"about_ca_topic_score_gemma":0.0062932647,"teacher_disagreement_score":0.006835087,"about_ca_system_score_codex":0.0018174943,"about_ca_system_score_gemma":0.0017738541,"threshold_uncertainty_score":0.020596445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08028336,0.005490619,0.71015763,0.007599568,0.0007118442,0.00014551377,0.001127573,0.00030936956,0.19417448],"genre_scores_gemma":[0.70548373,0.009342486,0.15982911,0.0024288972,0.0033637616,0.0006571526,0.0025112391,0.00042780666,0.115955874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782807,0.0010385207,0.00007649955,0.00039580837,0.00038736433,0.00027362094],"domain_scores_gemma":[0.9943967,0.0031528028,0.0005778832,0.00049270975,0.00080524536,0.0005746501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032374694,0.0012314001,0.0015346849,0.0016591453,0.001511625,0.0030032962,0.0031830478,0.0022253627,0.017955385],"category_scores_gemma":[0.0132616395,0.0007924187,0.0018067299,0.004574709,0.0024814373,0.0070572095,0.0044989306,0.005389757,0.0023383643],"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.00011331263,0.00022550712,0.00029815777,0.00025693668,0.000027494038,0.00009497559,0.00021122298,0.042434394,0.000316781,0.9123347,0.014485281,0.02920141],"study_design_scores_gemma":[0.000028005028,0.00003579876,0.00024207516,0.000052414518,0.000011661904,0.00010292717,0.00009102499,0.096107274,0.00006733567,0.89513266,0.008107837,0.000020885851],"about_ca_topic_score_codex":0.0034080725,"about_ca_topic_score_gemma":0.0027357724,"teacher_disagreement_score":0.017955385,"about_ca_system_score_codex":0.0016144918,"about_ca_system_score_gemma":0.0015716949,"threshold_uncertainty_score":0.06006676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005089017,0.00007804279,0.9915451,0.000093791044,0.00006491638,0.00008652607,0.00005057308,0.00011836563,0.002873728],"genre_scores_gemma":[0.16783611,0.00023018487,0.814062,0.00014543242,0.00008888927,0.0006310925,0.0002838476,0.00019063843,0.016531756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00017679758,0.000023972747,0.00007805813,0.00012866226,0.00007221986],"domain_scores_gemma":[0.9990011,0.0005894505,0.000046294834,0.000054705346,0.0002426659,0.000065731496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015535598,0.00075457786,0.0009768258,0.0006363919,0.0005120753,0.0008540925,0.0020352914,0.002082632,0.010498182],"category_scores_gemma":[0.0027815835,0.0007220811,0.0012537194,0.0006066021,0.0005083125,0.0011417054,0.0015968592,0.0016050938,0.0010380499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021981026,0.00019916445,0.0005542078,0.00026317278,0.000061681145,0.00012018447,0.00012093664,0.8296483,0.006150089,0.026245799,0.0045317346,0.13188496],"study_design_scores_gemma":[0.000019758703,0.000040639312,0.000058826343,0.0000063439516,0.000006935937,0.000010854572,0.000006965494,0.9967051,0.0003549913,0.0017056718,0.0010769583,0.000006940728],"about_ca_topic_score_codex":0.007236579,"about_ca_topic_score_gemma":0.0068573905,"teacher_disagreement_score":0.010498182,"about_ca_system_score_codex":0.0006692905,"about_ca_system_score_gemma":0.0020647654,"threshold_uncertainty_score":0.03511995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018835193,0.0010385526,0.9768708,0.00030805112,0.00009545199,0.000043127147,0.00007966084,0.00014853127,0.0025807025],"genre_scores_gemma":[0.5875333,0.0009853302,0.39519456,0.00015426442,0.0001614722,0.00042117902,0.00040875556,0.00018616326,0.014954979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949026,0.00029612216,0.000017381242,0.000063075415,0.00009994023,0.000033135988],"domain_scores_gemma":[0.9975647,0.0019221436,0.0001242811,0.00009818683,0.0002032572,0.000087494554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015291832,0.0006120361,0.0016132202,0.0009881274,0.0006331155,0.0007695774,0.0017553446,0.0013948751,0.0025012898],"category_scores_gemma":[0.0057039005,0.00073227653,0.0006176567,0.0010381226,0.00074384565,0.0016544737,0.0014248244,0.0012516374,0.00033880124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008613921,0.00004061407,0.00022733348,0.00005546005,0.000035306988,0.000028630835,0.000030808613,0.9632593,0.00035586196,0.013878017,0.0017344014,0.020268105],"study_design_scores_gemma":[0.0000037367772,0.0000062629633,0.00001807395,0.0000017241983,0.000001805518,0.0000026394084,0.0000025555398,0.9970041,0.000022094608,0.0027883602,0.00014718891,0.0000013539558],"about_ca_topic_score_codex":0.007693546,"about_ca_topic_score_gemma":0.0063432506,"teacher_disagreement_score":0.007693546,"about_ca_system_score_codex":0.0008975501,"about_ca_system_score_gemma":0.00087613653,"threshold_uncertainty_score":0.015297532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01812007,0.0015191599,0.9752085,0.0005531031,0.0001244556,0.00016709014,0.00016923575,0.00041971618,0.0037186407],"genre_scores_gemma":[0.22281556,0.0018991746,0.76352304,0.00022369093,0.00024148426,0.00060567865,0.00056819123,0.0004610309,0.009662084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988286,0.00047920312,0.00005761292,0.0001573258,0.00025179272,0.00022538974],"domain_scores_gemma":[0.99409735,0.0049278866,0.0002546498,0.00014542618,0.0002776851,0.0002969482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004263479,0.0025622428,0.004041099,0.0021031348,0.001413501,0.0024624283,0.003645467,0.00398895,0.008838704],"category_scores_gemma":[0.008075433,0.0024908052,0.0019583334,0.0034656443,0.0014348448,0.004285883,0.0023585304,0.0047890954,0.00092270615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027729184,0.00022737752,0.000344434,0.00017844973,0.00008371559,0.000046779827,0.00005790558,0.91339266,0.0003599267,0.020110492,0.0030197313,0.06190134],"study_design_scores_gemma":[0.00004019931,0.000038377548,0.00005048123,0.000010170696,0.000016778722,0.0000075142284,0.000009953815,0.9890442,0.000115956944,0.010287723,0.00037266267,0.00000592408],"about_ca_topic_score_codex":0.01322281,"about_ca_topic_score_gemma":0.011381447,"teacher_disagreement_score":0.01322281,"about_ca_system_score_codex":0.0030249215,"about_ca_system_score_gemma":0.003752325,"threshold_uncertainty_score":0.029568434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008917463,0.0014543504,0.98390007,0.00046883873,0.0001554061,0.00013422896,0.00008540952,0.00030767976,0.0045765154],"genre_scores_gemma":[0.21537094,0.0024047475,0.77130836,0.00022642742,0.0002501523,0.00081387605,0.0003307807,0.00039754863,0.008897147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989477,0.00050933904,0.00005287514,0.00009285427,0.00022549144,0.00017178747],"domain_scores_gemma":[0.995455,0.0038595325,0.00015174907,0.000113892864,0.00025149187,0.00016831761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003436897,0.0019458993,0.002524542,0.0017276298,0.00125078,0.0019180897,0.002561704,0.0028654428,0.008195674],"category_scores_gemma":[0.009089155,0.0013857128,0.0013076295,0.0028919065,0.0013720467,0.003235677,0.0019799673,0.004230776,0.0010703711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030763965,0.00022800284,0.00032968674,0.00019902983,0.00009306934,0.00005371369,0.00010480546,0.8253332,0.00050439785,0.054395463,0.005701542,0.1127495],"study_design_scores_gemma":[0.000058423735,0.00003894407,0.000052385283,0.000014228698,0.000014547034,0.000007461674,0.000012160705,0.9786012,0.00013967196,0.02033127,0.00072331826,0.000006457984],"about_ca_topic_score_codex":0.012123288,"about_ca_topic_score_gemma":0.0108907735,"teacher_disagreement_score":0.012123288,"about_ca_system_score_codex":0.0019207598,"about_ca_system_score_gemma":0.0035061266,"threshold_uncertainty_score":0.027417243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044924478,0.00008213568,0.99908197,0.00006396538,0.000013902919,0.000014913493,0.000012283449,0.000044936172,0.00023673548],"genre_scores_gemma":[0.07152506,0.0005640572,0.9216724,0.00033864303,0.00019522708,0.0006600209,0.00021085981,0.00034557484,0.0044881618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99455243,0.0026629323,0.00025777883,0.00059950526,0.001748937,0.00017840821],"domain_scores_gemma":[0.99376714,0.004504037,0.00040477212,0.0003420085,0.0008181832,0.00016384447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010043798,0.0019603232,0.0034013225,0.0017712312,0.0006332766,0.002385147,0.0036715635,0.0033176802,0.0038035004],"category_scores_gemma":[0.014311353,0.0021265259,0.0023021563,0.0015856072,0.0017765295,0.0034477552,0.0038474693,0.003687252,0.0009933596],"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.0001609121,0.00018167961,0.00035488902,0.00034100327,0.00023996695,0.000063123065,0.00009225743,0.78309757,0.0051953443,0.120626375,0.0017518565,0.08789502],"study_design_scores_gemma":[0.000014721193,0.000030444284,0.000056516765,0.000013484959,0.000018984801,0.000013499988,0.000002806983,0.9791054,0.00040172433,0.01952518,0.00080146355,0.00001575244],"about_ca_topic_score_codex":0.0026927767,"about_ca_topic_score_gemma":0.0028389506,"teacher_disagreement_score":0.010043798,"about_ca_system_score_codex":0.0016587386,"about_ca_system_score_gemma":0.0024544613,"threshold_uncertainty_score":0.053117335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046073357,0.0005598885,0.9925488,0.00017549684,0.00004700233,0.00006041,0.000063889944,0.00003731942,0.0018997942],"genre_scores_gemma":[0.39500937,0.0016773388,0.5983467,0.00018101739,0.00020938941,0.00040054967,0.00033733202,0.000050693918,0.0037875555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99428743,0.0026601618,0.00028490322,0.00037086132,0.0020417683,0.0003548836],"domain_scores_gemma":[0.9961165,0.0026120783,0.00019075585,0.00020239638,0.0007400874,0.00013812043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056260754,0.0010633386,0.00345082,0.0030082245,0.0011538782,0.0029584174,0.00222275,0.001175312,0.0020555055],"category_scores_gemma":[0.008794275,0.0005702165,0.0025539363,0.0029537883,0.0010800394,0.0029286735,0.0016517988,0.001744232,0.00041081116],"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.00015899648,0.0001772753,0.0006534341,0.00056830276,0.0004760217,0.0002690263,0.0005589875,0.51311463,0.0021888649,0.32087776,0.004184721,0.15677206],"study_design_scores_gemma":[0.000028962995,0.00009717543,0.00023678133,0.00005823598,0.00009440543,0.0000767696,0.00008007562,0.78509617,0.0005829452,0.21057601,0.0030349153,0.00003746593],"about_ca_topic_score_codex":0.004036613,"about_ca_topic_score_gemma":0.0033043236,"teacher_disagreement_score":0.0056260754,"about_ca_system_score_codex":0.0021223784,"about_ca_system_score_gemma":0.002462406,"threshold_uncertainty_score":0.029753923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18963651,0.00018093473,0.7984065,0.00058463286,0.000056642002,0.00021662877,0.00024046887,0.00025564065,0.010421924],"genre_scores_gemma":[0.9531546,0.000088424844,0.043066945,0.00004699967,0.000013703352,0.00018472713,0.00009302066,0.000023572478,0.00332791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939966,0.00022072306,0.000023018321,0.00011392208,0.0001126508,0.00013004107],"domain_scores_gemma":[0.999042,0.0006266131,0.000082008184,0.00002521434,0.00014048336,0.000083625724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017381692,0.0008804271,0.001584888,0.0005154666,0.00050953863,0.0013427027,0.0014554822,0.0025624852,0.003655615],"category_scores_gemma":[0.0025614994,0.00054551626,0.0007265814,0.00062068313,0.0009111766,0.000932808,0.0011768921,0.0012062513,0.00015940848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006211951,0.000034539946,0.00012926634,0.000022492446,0.000011971148,0.00003874098,0.00002216184,0.99212486,0.0004403236,0.004121895,0.00012594968,0.0028656165],"study_design_scores_gemma":[0.0000128947995,0.0000325521,0.000038118716,0.0000022756376,0.000005779189,0.000003005541,0.0000038422945,0.99879116,0.00010647539,0.00093719026,0.000063732885,0.0000029370601],"about_ca_topic_score_codex":0.011418878,"about_ca_topic_score_gemma":0.008098065,"teacher_disagreement_score":0.011418878,"about_ca_system_score_codex":0.00181711,"about_ca_system_score_gemma":0.0023966932,"threshold_uncertainty_score":0.02270484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20240927,0.00021302266,0.7904627,0.0006041968,0.00014227824,0.00038833823,0.00014292625,0.0005280508,0.0051092077],"genre_scores_gemma":[0.9523724,0.000033033288,0.0467275,0.00004059213,0.00002345717,0.00006469257,0.00004792949,0.000034435772,0.00065602845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970989,0.0016253612,0.000116206575,0.00034116308,0.00040331986,0.00041501666],"domain_scores_gemma":[0.98331624,0.011842469,0.0009175965,0.0006960082,0.0024841647,0.0007435556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058780895,0.00080500473,0.0014234179,0.001436497,0.0007713965,0.001700372,0.0023023798,0.001384705,0.004341298],"category_scores_gemma":[0.024492713,0.0011051771,0.00070144737,0.0010361924,0.00068174815,0.0032581077,0.0014838525,0.0010760265,0.00015745849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017138243,0.00016200295,0.0041343938,0.000041426916,0.000049162896,0.000040121107,0.00007007209,0.964283,0.0003574026,0.0041451245,0.00038304998,0.02616292],"study_design_scores_gemma":[0.000015464555,0.000048512204,0.00031295457,0.000003810333,0.00002351315,0.000007466946,0.000019088111,0.9975128,0.00014606059,0.0017699976,0.0001339599,0.0000062653044],"about_ca_topic_score_codex":0.012321654,"about_ca_topic_score_gemma":0.016735496,"teacher_disagreement_score":0.012321654,"about_ca_system_score_codex":0.0023625586,"about_ca_system_score_gemma":0.0025327455,"threshold_uncertainty_score":0.031086683},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23501427,0.0010151138,0.70953405,0.0018465203,0.00015195039,0.00021608289,0.0010074748,0.00052633154,0.05068816],"genre_scores_gemma":[0.9459287,0.00067984726,0.02451198,0.000094957184,0.00005313789,0.0001610577,0.000420546,0.00009393301,0.028055945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996469,0.00008986054,0.00001763112,0.0000764027,0.00008201325,0.00008715149],"domain_scores_gemma":[0.9993437,0.00032545748,0.00010742464,0.000038493967,0.00011780973,0.000067059605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073589396,0.00072614214,0.001181646,0.00096449885,0.0010196335,0.0023879895,0.0024961152,0.002951653,0.010600943],"category_scores_gemma":[0.0016299573,0.0012677255,0.0012190203,0.0015038556,0.0012353684,0.002190638,0.0014419751,0.0011302383,0.0010833133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016505817,0.000012009062,0.00014457836,0.000010495568,0.0000070950296,0.00004605946,0.000013285532,0.9943145,0.00029472334,0.0042388886,0.00010686741,0.0007948755],"study_design_scores_gemma":[0.0000058414307,0.000007929403,0.00008486731,0.000002173641,0.000005129636,0.0000068213185,0.000008185114,0.99797887,0.00006513788,0.0015966006,0.0002353393,0.0000031644724],"about_ca_topic_score_codex":0.044153422,"about_ca_topic_score_gemma":0.0154314255,"teacher_disagreement_score":0.044153422,"about_ca_system_score_codex":0.0018291929,"about_ca_system_score_gemma":0.002471217,"threshold_uncertainty_score":0.087792814},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34806845,0.0017438021,0.6432974,0.00045963598,0.00027123606,0.00023310028,0.00015384596,0.00072103855,0.005051528],"genre_scores_gemma":[0.76986986,0.00026071368,0.22766913,0.00019524356,0.00018077513,0.00020410425,0.00034164128,0.00014322587,0.0011352254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.971228,0.022045529,0.000956148,0.0015607682,0.0034958902,0.0007136912],"domain_scores_gemma":[0.7459491,0.22285415,0.004322573,0.010765129,0.014529484,0.0015794788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04446244,0.0014536378,0.002610638,0.0026630433,0.0017046648,0.002783768,0.0026190085,0.0038563653,0.0023685],"category_scores_gemma":[0.1630731,0.0007588208,0.0014761378,0.0032125362,0.0014982525,0.005114967,0.0040903143,0.002336536,0.0006218988],"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.008044041,0.0006715412,0.013172823,0.000688205,0.0019161368,0.00021749648,0.0019919588,0.34326878,0.004093667,0.016084053,0.0048429235,0.6050083],"study_design_scores_gemma":[0.00016470614,0.0005920855,0.0019674536,0.000060752693,0.0002651251,0.000058329366,0.00017890708,0.97907627,0.0026903753,0.014372203,0.00051541184,0.000058375666],"about_ca_topic_score_codex":0.0028432896,"about_ca_topic_score_gemma":0.0027990618,"teacher_disagreement_score":0.04446244,"about_ca_system_score_codex":0.0007887675,"about_ca_system_score_gemma":0.0013380686,"threshold_uncertainty_score":0.23514271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011692188,0.00033414015,0.98222715,0.00021240821,0.00011782161,0.000117705255,0.00011879258,0.00087938964,0.004300313],"genre_scores_gemma":[0.120709516,0.00026520438,0.87459147,0.00010817285,0.000077287514,0.0002700959,0.00022469513,0.00016928108,0.0035843626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930096,0.00011505501,0.000036895053,0.00018900186,0.00021241805,0.00014564708],"domain_scores_gemma":[0.998852,0.00068858854,0.00007975671,0.0001354485,0.00017053183,0.00007362712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013237101,0.0012895555,0.0019510569,0.0009746955,0.0009848352,0.0017105198,0.0027084437,0.002278733,0.008048504],"category_scores_gemma":[0.0036595073,0.0011473983,0.0010458969,0.0018250297,0.00089152507,0.0027291987,0.0018087237,0.0015511416,0.0011517885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021037634,0.00013848425,0.0002853409,0.00014941166,0.00004617949,0.00007480589,0.00007722002,0.8304458,0.001340003,0.014542107,0.0037385954,0.1489516],"study_design_scores_gemma":[0.00006707618,0.000026263328,0.000059372836,0.0000074324025,0.000012905712,0.000024455985,0.000015337082,0.9908285,0.00023852434,0.007896526,0.00081645994,0.000007215675],"about_ca_topic_score_codex":0.013236823,"about_ca_topic_score_gemma":0.01418545,"teacher_disagreement_score":0.013236823,"about_ca_system_score_codex":0.0020113736,"about_ca_system_score_gemma":0.0038786524,"threshold_uncertainty_score":0.026924908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18711299,0.0018741768,0.7826029,0.006190845,0.0001481211,0.00007414977,0.0008827225,0.0002922958,0.020821685],"genre_scores_gemma":[0.9424695,0.0010057417,0.05469744,0.0000957395,0.000085430496,0.000033884753,0.00021692665,0.00003281036,0.0013624851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835616,0.0008879524,0.000085457126,0.0002995355,0.00019949238,0.00017135729],"domain_scores_gemma":[0.9970751,0.0020231323,0.00037518505,0.00025188146,0.00018556479,0.00008913104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020305174,0.0009970579,0.0015881389,0.0010060569,0.00043934656,0.0035331673,0.0016431528,0.0020886976,0.004234092],"category_scores_gemma":[0.009122956,0.00073587714,0.000823576,0.0015758038,0.0019735591,0.0057196394,0.0012297285,0.0007713811,0.00046316703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017431825,0.00003981375,0.0015254109,0.00019237117,0.000054009564,0.0000779143,0.00008200747,0.9362022,0.00044464928,0.041562777,0.001054906,0.018589584],"study_design_scores_gemma":[0.000041579897,0.00013099221,0.00089054607,0.000044414977,0.000032576605,0.000114724346,0.0004228093,0.9162217,0.00045007045,0.079858825,0.0017567697,0.00003497667],"about_ca_topic_score_codex":0.005530193,"about_ca_topic_score_gemma":0.005942734,"teacher_disagreement_score":0.005530193,"about_ca_system_score_codex":0.0011315822,"about_ca_system_score_gemma":0.00096213043,"threshold_uncertainty_score":0.014164507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030890463,0.00034840786,0.95849156,0.00033240527,0.00007635371,0.00006910012,0.00009001583,0.00016037587,0.009541302],"genre_scores_gemma":[0.74990267,0.00064982014,0.24061552,0.00016234779,0.00014407007,0.00020030419,0.0002663274,0.00019165582,0.007867273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992077,0.0002619948,0.00003277255,0.00014617572,0.00024745273,0.0001040474],"domain_scores_gemma":[0.9991773,0.0004141944,0.000097025855,0.000087808505,0.00015143861,0.00007222173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224698,0.0014836356,0.0016645264,0.0008657013,0.00041723982,0.0023101862,0.0018371432,0.0012512351,0.0033520416],"category_scores_gemma":[0.0024971506,0.0013752555,0.0017728388,0.0013664529,0.0007439627,0.0022502847,0.0021921624,0.0020897167,0.0002905473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049271253,0.000077787154,0.00029661934,0.000048576865,0.00008425577,0.000038185546,0.000026717544,0.9765904,0.00039836898,0.008707542,0.00039651306,0.013285794],"study_design_scores_gemma":[0.00001154527,0.000027867984,0.000098836594,0.0000057217258,0.00002467931,0.000005340462,0.0000083798,0.9946181,0.00014520212,0.004766657,0.00028331892,0.000004413672],"about_ca_topic_score_codex":0.009333078,"about_ca_topic_score_gemma":0.010315673,"teacher_disagreement_score":0.009333078,"about_ca_system_score_codex":0.001007109,"about_ca_system_score_gemma":0.0023950567,"threshold_uncertainty_score":0.018557489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017003469,0.99835074,0.0001349177,0.0002487487,0.00021304766,0.0000043671243,0.000036841342,0.0000042465576,0.0008369556],"genre_scores_gemma":[0.0006979461,0.9986131,0.00015161041,0.00013169993,0.00013944313,0.0000029004877,0.00003085138,9.991206e-7,0.0002313984],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994923,0.00007671532,0.00009497248,0.000105695035,0.00018501664,0.000045281424],"domain_scores_gemma":[0.99839395,0.00086070737,0.0002522702,0.00003327733,0.00039772582,0.00006194428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011563792,0.0013210577,0.0017354848,0.005998771,0.00042695977,0.0017533522,0.0011389203,0.0014553096,0.005366675],"category_scores_gemma":[0.0020117,0.0005075224,0.0008908835,0.009379076,0.00060991297,0.0028129367,0.0009788438,0.0012575244,0.0013277422],"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.00008922174,0.00011636275,0.00053851644,0.075108334,0.00017568644,0.00017200237,0.00014610896,0.00075918075,0.0015117672,0.0048169815,0.030055592,0.8865103],"study_design_scores_gemma":[0.000011046991,0.00013265235,0.0018235083,0.017144535,0.00035960367,0.000491646,0.00026757416,0.00014767071,0.0005397338,0.0022681584,0.97677225,0.000041666266],"about_ca_topic_score_codex":0.0026831105,"about_ca_topic_score_gemma":0.0061622337,"teacher_disagreement_score":0.005998771,"about_ca_system_score_codex":0.00089686835,"about_ca_system_score_gemma":0.0027732565,"threshold_uncertainty_score":0.017953336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94902915,0.0004994161,0.036253307,0.0008917398,0.0001227102,0.00009822117,0.00021376909,0.00014798091,0.01274367],"genre_scores_gemma":[0.99656796,0.00007655136,0.0012055056,0.00002584051,0.000022653607,0.000010589067,0.000022484734,0.0000102755275,0.0020579172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987552,0.000616342,0.000031861182,0.0001625688,0.00006778194,0.00036616198],"domain_scores_gemma":[0.9920963,0.0060753757,0.00045795835,0.00025559997,0.00036872338,0.0007460076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031256757,0.0010520597,0.0025283187,0.0007294021,0.0008207904,0.0037404078,0.0026091647,0.0025680282,0.008012051],"category_scores_gemma":[0.008076656,0.00084542227,0.000886197,0.0009555471,0.0016124954,0.0032881796,0.0011371255,0.0015727256,0.00027394778],"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.0055561247,0.00090425176,0.002373725,0.00028769867,0.0002221726,0.0014708252,0.00022727434,0.91486335,0.0034084537,0.054068625,0.0020573735,0.01456024],"study_design_scores_gemma":[0.00030718517,0.00039304144,0.0010992497,0.000009913648,0.00009965931,0.00009946058,0.0001314946,0.9859337,0.00037827186,0.011249073,0.0002420224,0.000056842622],"about_ca_topic_score_codex":0.010438297,"about_ca_topic_score_gemma":0.0058305888,"teacher_disagreement_score":0.010438297,"about_ca_system_score_codex":0.0020315913,"about_ca_system_score_gemma":0.0012855864,"threshold_uncertainty_score":0.026803017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12711728,0.0003704925,0.8642805,0.0011860493,0.0001066737,0.000109501125,0.00020257982,0.00015342448,0.006473507],"genre_scores_gemma":[0.9155972,0.00027128242,0.0771207,0.000113620285,0.00006758662,0.00017694233,0.00010445761,0.000041615487,0.006506648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812216,0.0010484342,0.000088971436,0.000248224,0.00028079975,0.00021136813],"domain_scores_gemma":[0.9907845,0.007583506,0.00057580223,0.00022358737,0.0005188765,0.00031370466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004600259,0.0011230716,0.0023595653,0.0013215471,0.00083284103,0.0028047026,0.0023895805,0.003256578,0.0053497627],"category_scores_gemma":[0.011231665,0.0015047451,0.001360479,0.0016687091,0.0011325107,0.0042280327,0.001807357,0.002103373,0.0004099028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000698729,0.000042984273,0.0002821117,0.00002175916,0.000039283088,0.00007188625,0.0000236685,0.98544693,0.00011846186,0.01050878,0.000101314305,0.0032729509],"study_design_scores_gemma":[0.000010508282,0.000015574107,0.00005608569,0.0000031805112,0.000009929837,0.0000065258982,0.000003229522,0.99383426,0.000034402437,0.005974751,0.0000455923,0.000006026376],"about_ca_topic_score_codex":0.0068748062,"about_ca_topic_score_gemma":0.0053857835,"teacher_disagreement_score":0.0068748062,"about_ca_system_score_codex":0.0021275806,"about_ca_system_score_gemma":0.0014099953,"threshold_uncertainty_score":0.024328768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027243963,0.00013673985,0.9890863,0.00027812715,0.00017606808,0.000031883006,0.00012694401,0.00006482534,0.007374688],"genre_scores_gemma":[0.19000068,0.00079684047,0.7758136,0.00067378837,0.0007121685,0.00029485615,0.0010291997,0.0003773736,0.03030154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991387,0.00030799882,0.000030386886,0.00016180944,0.00029201235,0.00006899873],"domain_scores_gemma":[0.9993309,0.00030476312,0.000060701088,0.000102734266,0.00015244528,0.000048468104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011584879,0.0008647796,0.0010181167,0.0005619397,0.00034270322,0.0013848421,0.0016772968,0.0009883543,0.011164868],"category_scores_gemma":[0.0031569463,0.0004395682,0.0007445244,0.0010804232,0.0008086482,0.0020679887,0.0016458522,0.00255212,0.0017128893],"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.00011759109,0.00023267188,0.0002520968,0.00033078238,0.0000349669,0.000112136026,0.00011298868,0.47604808,0.0035942402,0.37360638,0.020585828,0.12497226],"study_design_scores_gemma":[0.000025097128,0.000057634858,0.00007001427,0.000015366662,0.0000070378273,0.00004720927,0.00001903449,0.93411463,0.00032223738,0.05780264,0.007509293,0.000009795238],"about_ca_topic_score_codex":0.0020826457,"about_ca_topic_score_gemma":0.0024910532,"teacher_disagreement_score":0.011164868,"about_ca_system_score_codex":0.0007154342,"about_ca_system_score_gemma":0.0010638691,"threshold_uncertainty_score":0.037350237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014578203,0.000527227,0.978224,0.00021665888,0.000064425825,0.00010683884,0.00012969783,0.00031878852,0.0058342707],"genre_scores_gemma":[0.3508437,0.00064217113,0.6409717,0.00015514834,0.00010499524,0.00051140616,0.00027836883,0.00022695416,0.006265533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993025,0.00031487667,0.000024678553,0.00009340309,0.00015782371,0.000106729305],"domain_scores_gemma":[0.997184,0.0021838816,0.00018939002,0.000119149845,0.0002254919,0.00009805225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017825806,0.0015642741,0.0014689344,0.0015083597,0.0007901464,0.0014125515,0.0020028928,0.0019622087,0.005881802],"category_scores_gemma":[0.005941154,0.0014109637,0.0009763444,0.0016169233,0.001307424,0.0014516894,0.0012266752,0.0016305005,0.0006139349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026936761,0.000021068312,0.00006748402,0.000031465544,0.000009249928,0.000010537266,0.000017838784,0.9841452,0.00010735123,0.004503455,0.0005493335,0.010509972],"study_design_scores_gemma":[0.000015204388,0.000014010639,0.000021216369,0.000005542829,0.0000035178982,0.0000035427654,0.000008957347,0.9949839,0.000057744444,0.0046019056,0.0002816214,0.0000029216624],"about_ca_topic_score_codex":0.011616633,"about_ca_topic_score_gemma":0.012421064,"teacher_disagreement_score":0.011616633,"about_ca_system_score_codex":0.0020610148,"about_ca_system_score_gemma":0.0025232371,"threshold_uncertainty_score":0.023098052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13537541,0.00031534935,0.85276115,0.00043532904,0.00024056956,0.000100859215,0.00022130835,0.0015653764,0.008984684],"genre_scores_gemma":[0.88816375,0.00013110868,0.10814859,0.00007333366,0.00010485494,0.000036594563,0.00014882171,0.0001156077,0.003077426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994843,0.00016751143,0.00003508245,0.000085258354,0.0001748149,0.000053059324],"domain_scores_gemma":[0.9972422,0.0017471932,0.00022054945,0.00040380255,0.00030859062,0.00007770855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013133422,0.00068666175,0.0008881565,0.00041934,0.00022855961,0.0008807271,0.0010675631,0.00066420325,0.004793181],"category_scores_gemma":[0.0060552373,0.0004066991,0.00041549795,0.0007005495,0.0003751933,0.0019169591,0.0006068193,0.0006833245,0.0005592206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003590646,0.000084785366,0.00086636393,0.0000801754,0.000026423158,0.000064904365,0.000030724244,0.9247233,0.0062771286,0.0069031096,0.00071212393,0.059871882],"study_design_scores_gemma":[0.000014482611,0.00007762966,0.0002530788,0.0000038903136,0.000012861142,0.000020917265,0.0000051349984,0.99443,0.0010410331,0.003578616,0.00055653916,0.000005775042],"about_ca_topic_score_codex":0.0020198096,"about_ca_topic_score_gemma":0.0035245137,"teacher_disagreement_score":0.004793181,"about_ca_system_score_codex":0.0005161136,"about_ca_system_score_gemma":0.0012005,"threshold_uncertainty_score":0.016034722},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39873642,0.00081012654,0.589484,0.0015723895,0.0001643107,0.00013382171,0.00023259017,0.00022138399,0.008644977],"genre_scores_gemma":[0.9537551,0.00042862014,0.038562406,0.00010522768,0.00010281636,0.000062238054,0.000128413,0.00004623988,0.00680901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885285,0.00040945417,0.000046475376,0.00026234696,0.000135923,0.0002928934],"domain_scores_gemma":[0.99670094,0.0021606246,0.00026367474,0.00017570035,0.00030600134,0.0003931632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018336428,0.0009204601,0.0023714944,0.00065961306,0.0015012381,0.0027270203,0.0027006792,0.0023755673,0.0046721357],"category_scores_gemma":[0.0041928184,0.0013191219,0.0009782973,0.002179795,0.001572692,0.0029056615,0.0018861109,0.0013559647,0.0005034131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085925957,0.00017455568,0.0012674629,0.00019421832,0.00008091978,0.0006481681,0.00014740754,0.9631759,0.0044637206,0.018674962,0.0010246597,0.0092887515],"study_design_scores_gemma":[0.00005146896,0.000081289494,0.0002622856,0.0000043266728,0.000023782839,0.000027737526,0.000037155973,0.9918794,0.0005445177,0.006879739,0.0001917408,0.000016524069],"about_ca_topic_score_codex":0.011918453,"about_ca_topic_score_gemma":0.008308409,"teacher_disagreement_score":0.011918453,"about_ca_system_score_codex":0.0017624745,"about_ca_system_score_gemma":0.0016443438,"threshold_uncertainty_score":0.023698151},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065174904,0.00028692427,0.98965293,0.00015549597,0.0001281957,0.000048779282,0.000017978726,0.00009215354,0.0031000667],"genre_scores_gemma":[0.8243377,0.0006315953,0.16596687,0.00025255923,0.00032526147,0.00037073402,0.000107883025,0.000094077055,0.007913396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994392,0.00017458026,0.000031133914,0.00011651721,0.00015897684,0.000079644386],"domain_scores_gemma":[0.999057,0.0005085927,0.00008662028,0.00003506651,0.00024831865,0.0000644405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017016967,0.001483815,0.0013274091,0.0007287265,0.00044545255,0.0015311218,0.002354477,0.0015683838,0.0034986576],"category_scores_gemma":[0.0019169024,0.0006052433,0.00078279176,0.00061812194,0.0008004756,0.0011179349,0.0011700128,0.0013195266,0.00038100974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009446452,0.000104463026,0.00014366655,0.00013957678,0.00004975586,0.00010358595,0.00007340925,0.9480678,0.0020555782,0.011740794,0.0008293004,0.036597487],"study_design_scores_gemma":[0.0000069975727,0.00003544894,0.000015904643,0.0000024146711,0.000005474327,0.0000059200956,0.000004569646,0.998806,0.00007416071,0.0008443397,0.0001966753,0.0000021013848],"about_ca_topic_score_codex":0.004162497,"about_ca_topic_score_gemma":0.0031343708,"teacher_disagreement_score":0.004162497,"about_ca_system_score_codex":0.0005143723,"about_ca_system_score_gemma":0.00078387634,"threshold_uncertainty_score":0.011704147},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61885476,0.0029946812,0.37389544,0.00033054184,0.00016844817,0.00016332878,0.000103512415,0.0002551718,0.0032341322],"genre_scores_gemma":[0.9051885,0.00072021974,0.09271522,0.000032864697,0.00002086216,0.00006815266,0.000044827422,0.00002489864,0.0011844547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984498,0.00090994575,0.00008947825,0.00012116271,0.00035866798,0.0000709349],"domain_scores_gemma":[0.99240804,0.0062276954,0.00022057755,0.000119316064,0.00094576314,0.00007870337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005559038,0.0007557001,0.0014654945,0.0022008573,0.00057457696,0.0015421985,0.000700046,0.0012853784,0.00093366817],"category_scores_gemma":[0.006950065,0.00036293955,0.00086439936,0.0011002844,0.00052946986,0.0016149622,0.0006960446,0.00068256364,0.000101081736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050008153,0.0006959385,0.004099554,0.00082182477,0.00025675184,0.000098837234,0.00036827344,0.63454074,0.0071609337,0.006482358,0.00055971934,0.33991438],"study_design_scores_gemma":[0.00006825695,0.0005351333,0.0013871103,0.000019519573,0.00009256547,0.000016943573,0.000071819355,0.99239254,0.00393969,0.0011446727,0.00030408386,0.000027730157],"about_ca_topic_score_codex":0.005411061,"about_ca_topic_score_gemma":0.005451389,"teacher_disagreement_score":0.005559038,"about_ca_system_score_codex":0.001325261,"about_ca_system_score_gemma":0.0012126138,"threshold_uncertainty_score":0.029399395},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.413831,0.00095477107,0.57499653,0.0008588295,0.00065509806,0.00037956968,0.000245744,0.0005238566,0.0075545395],"genre_scores_gemma":[0.9088406,0.00015764363,0.085611664,0.00007264845,0.00016718765,0.00022163238,0.000088542474,0.00006668562,0.004773385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973757,0.0010392306,0.00016844386,0.00052075007,0.00041115208,0.0004846286],"domain_scores_gemma":[0.99291164,0.004420692,0.0007520546,0.00059642585,0.0005866091,0.00073250936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034940871,0.0016052542,0.0034938164,0.0012557547,0.0015273032,0.002416943,0.002903619,0.0028993024,0.0034329954],"category_scores_gemma":[0.008145416,0.0016405236,0.0012797138,0.0018252904,0.0013497917,0.0021878923,0.0015768891,0.0015223012,0.0006777999],"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.0016201723,0.00029752203,0.00072511507,0.00023325041,0.00013794309,0.0004100105,0.00008983253,0.96502256,0.0049937386,0.009631133,0.0009486107,0.01589011],"study_design_scores_gemma":[0.00017528879,0.00019178572,0.0002507359,0.000005529571,0.000030357149,0.000061577404,0.000023477613,0.99113584,0.0010489215,0.0068003573,0.00025635585,0.000019735171],"about_ca_topic_score_codex":0.0017721133,"about_ca_topic_score_gemma":0.0013810311,"teacher_disagreement_score":0.0034940871,"about_ca_system_score_codex":0.0011697308,"about_ca_system_score_gemma":0.0014319685,"threshold_uncertainty_score":0.018478692},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056158442,0.0011737815,0.92679626,0.001485296,0.00015042524,0.000022085167,0.00013838304,0.00025501224,0.013820217],"genre_scores_gemma":[0.9107299,0.0010859924,0.06318253,0.00073564984,0.00040632795,0.000095181145,0.00036447708,0.00028218594,0.02311774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985103,0.0007657102,0.000055564113,0.00017290906,0.00024034403,0.00025514682],"domain_scores_gemma":[0.9856177,0.009727492,0.001112526,0.0016616505,0.001009203,0.0008714567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007120404,0.0011198337,0.0012998179,0.0013014501,0.0005135432,0.0035644614,0.0020564406,0.0020418463,0.0063173575],"category_scores_gemma":[0.021710586,0.000636854,0.0018698276,0.001056233,0.0024553803,0.004174169,0.0030627744,0.0050874026,0.00070458354],"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.00016367706,0.00009572745,0.0010199152,0.00011743367,0.000090405716,0.00021979185,0.00029640662,0.20038697,0.001772581,0.7789182,0.0021202203,0.014798666],"study_design_scores_gemma":[0.00001262288,0.000018092258,0.00038993225,0.000026378211,0.000019731382,0.00004181697,0.000024427936,0.8223975,0.00037626858,0.17554116,0.0011242409,0.000027834705],"about_ca_topic_score_codex":0.0026278733,"about_ca_topic_score_gemma":0.002422778,"teacher_disagreement_score":0.007120404,"about_ca_system_score_codex":0.0017186415,"about_ca_system_score_gemma":0.0013574472,"threshold_uncertainty_score":0.037656724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006103401,0.0007484347,0.9822311,0.00037572786,0.0000819449,0.000022207852,0.00007715819,0.00009810092,0.010262003],"genre_scores_gemma":[0.7354076,0.0036646395,0.2168311,0.0003113258,0.00047149952,0.0005155223,0.00059276895,0.00051027443,0.041695293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911934,0.000587866,0.000019171363,0.00006735499,0.0001421185,0.000064227446],"domain_scores_gemma":[0.9981838,0.0012954188,0.00014531355,0.00008591416,0.0001839123,0.000105564715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016805329,0.0017362226,0.0023331451,0.0009519664,0.00058124453,0.0020653286,0.0017829294,0.0016111372,0.007640901],"category_scores_gemma":[0.004941217,0.00088554504,0.0014144604,0.0013771862,0.0019566175,0.0025156382,0.0017804692,0.0038449408,0.0011096615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040576888,0.000038158534,0.000098512406,0.0000752064,0.000030177021,0.000034854424,0.00007694766,0.6211252,0.00027021824,0.36749348,0.0025608572,0.008155711],"study_design_scores_gemma":[0.000011481821,0.000012097971,0.000014418621,0.0000091197135,0.000005349538,0.0000057994857,0.000009425728,0.83357966,0.00004226672,0.1653615,0.00094464957,0.000004282982],"about_ca_topic_score_codex":0.0029820362,"about_ca_topic_score_gemma":0.0024497607,"teacher_disagreement_score":0.007640901,"about_ca_system_score_codex":0.0011248603,"about_ca_system_score_gemma":0.0009555116,"threshold_uncertainty_score":0.025561333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3231716,0.011913738,0.57675165,0.016334625,0.001407746,0.0012654003,0.005891877,0.0010189584,0.0622445],"genre_scores_gemma":[0.8101166,0.0043840595,0.09256835,0.00090841425,0.0013695346,0.00068013597,0.00183718,0.0007554202,0.08738034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972447,0.001095576,0.00017979988,0.00068972644,0.00031308443,0.00047707406],"domain_scores_gemma":[0.98484725,0.012032079,0.0011935786,0.00039870277,0.0004045308,0.0011237238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006820928,0.0029475302,0.008893222,0.0024482126,0.0015860451,0.0055550854,0.0050979317,0.009973678,0.0264955],"category_scores_gemma":[0.015225726,0.0061569354,0.0025717744,0.0035341864,0.0037012869,0.009689218,0.0029776106,0.0050347946,0.0018567877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002598947,0.00068705797,0.0014156025,0.0018269143,0.00046063765,0.0018374441,0.00037043114,0.85275346,0.0019187672,0.088453926,0.018349862,0.02932689],"study_design_scores_gemma":[0.001029293,0.000559844,0.0013295877,0.0001990509,0.00024622437,0.00048662827,0.000269969,0.90066314,0.0008397788,0.08799396,0.0061834017,0.00019912948],"about_ca_topic_score_codex":0.010367169,"about_ca_topic_score_gemma":0.0061208284,"teacher_disagreement_score":0.0264955,"about_ca_system_score_codex":0.0033292323,"about_ca_system_score_gemma":0.0023997996,"threshold_uncertainty_score":0.08863622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0595544,0.0015585792,0.90003103,0.0005471224,0.00010540696,0.00050389726,0.00038825214,0.0005205888,0.03679066],"genre_scores_gemma":[0.75143725,0.00063164934,0.24042685,0.000121591205,0.00015253121,0.00041314523,0.00041423587,0.00023435263,0.006168354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993353,0.0028203488,0.0004080444,0.00029739414,0.0026126762,0.00050848577],"domain_scores_gemma":[0.9816176,0.012403921,0.0014303911,0.0006221388,0.0032952297,0.00063066307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072078295,0.0016949929,0.0013653621,0.0041559814,0.00061066245,0.0027329922,0.0014540851,0.001565156,0.0047550783],"category_scores_gemma":[0.030118186,0.0003587626,0.00076927536,0.0016416487,0.0010109753,0.002304179,0.0012713773,0.0010135454,0.0005925518],"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.00042708463,0.00024525338,0.0077915387,0.0007180836,0.00017203233,0.0005193757,0.00029691058,0.6632356,0.01569638,0.13580744,0.007894834,0.1671955],"study_design_scores_gemma":[0.000044456425,0.0008367746,0.002910053,0.00020836378,0.00013383696,0.00068135356,0.00019531693,0.9308543,0.006271275,0.04864549,0.0091728,0.000045967554],"about_ca_topic_score_codex":0.0013415171,"about_ca_topic_score_gemma":0.0015087884,"teacher_disagreement_score":0.0072078295,"about_ca_system_score_codex":0.002217027,"about_ca_system_score_gemma":0.00178051,"threshold_uncertainty_score":0.038119078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4663244,0.0044144234,0.37428904,0.011566496,0.0006246548,0.0003478051,0.0003590837,0.00022501206,0.14184907],"genre_scores_gemma":[0.9632721,0.0011104175,0.010108587,0.00026770748,0.0002811019,0.00014102069,0.00010798066,0.000048131064,0.024662912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99352443,0.0037570614,0.00025003485,0.000668202,0.00064269913,0.0011576834],"domain_scores_gemma":[0.9311821,0.06201204,0.0021731781,0.0008112616,0.0010401681,0.0027813574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012532971,0.0017230494,0.0051594544,0.0019157514,0.0041912654,0.011462334,0.004012282,0.009665674,0.023758015],"category_scores_gemma":[0.03871337,0.0029108287,0.0022473403,0.0036785405,0.007057961,0.011152246,0.00449731,0.0062303375,0.0014326376],"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.0009302402,0.00018276842,0.0008656255,0.00019046423,0.000115326235,0.0009342102,0.0008132702,0.36896166,0.00058412144,0.61715806,0.002224179,0.0070400904],"study_design_scores_gemma":[0.00022187432,0.00014079404,0.00023154732,0.000063481304,0.000056460205,0.00012497285,0.0005905003,0.37279737,0.00014010839,0.6242839,0.0012700446,0.00007894742],"about_ca_topic_score_codex":0.005043904,"about_ca_topic_score_gemma":0.0030846524,"teacher_disagreement_score":0.023758015,"about_ca_system_score_codex":0.0047793007,"about_ca_system_score_gemma":0.0023532878,"threshold_uncertainty_score":0.0794785},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026333868,0.020058306,0.02186998,0.14385936,0.7577666,0.00025646205,0.0071404506,0.0016804081,0.044735007],"genre_scores_gemma":[0.09035693,0.02922594,0.024466792,0.04757388,0.13979535,0.00054892345,0.0077487687,0.0018735583,0.6584099],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974721,0.0007131062,0.00023829093,0.00040406417,0.0009100149,0.00026239615],"domain_scores_gemma":[0.9849128,0.0027363943,0.0003267359,0.00071451964,0.011012351,0.00029724007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002357041,0.0024002746,0.0031279353,0.0046633496,0.00221519,0.0026857366,0.0034418523,0.0043256204,0.1647927],"category_scores_gemma":[0.022178657,0.00074104074,0.0030506486,0.0059251883,0.000954835,0.0029080855,0.0023446968,0.0026972434,0.044119593],"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.000058522135,0.000018207924,0.00018462347,0.00028229467,0.000055614266,0.00029818705,0.000062871186,0.0009349903,0.00013778335,0.0045880196,0.9791404,0.014238461],"study_design_scores_gemma":[0.00010337375,0.000075688076,0.005314662,0.00049636245,0.00035724076,0.00077221944,0.00033221138,0.016432188,0.002400931,0.018930446,0.9545679,0.00021683768],"about_ca_topic_score_codex":0.065835774,"about_ca_topic_score_gemma":0.067262575,"teacher_disagreement_score":0.1647927,"about_ca_system_score_codex":0.0039410843,"about_ca_system_score_gemma":0.0022590992,"threshold_uncertainty_score":0.5512865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073967325,0.00070211844,0.9813145,0.0011703966,0.00026494323,0.000030602292,0.000035116736,0.00008009628,0.009005571],"genre_scores_gemma":[0.7565744,0.0017370002,0.1889664,0.0006986559,0.00080317317,0.00020982466,0.00018237656,0.00023066325,0.05059749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994809,0.00020117682,0.000019832198,0.00008587285,0.00015530715,0.000057100253],"domain_scores_gemma":[0.99861,0.00081708876,0.000106685766,0.00009734938,0.00029629088,0.00007258192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012135209,0.0009669211,0.0010811784,0.00061860046,0.0007642188,0.0013353697,0.0018993482,0.0017171165,0.0040704045],"category_scores_gemma":[0.004279702,0.00064260035,0.000753323,0.0007979106,0.002168837,0.0018054671,0.0019094769,0.0023754213,0.00037235592],"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.00007085287,0.000054029657,0.00029000264,0.000159115,0.00005216616,0.00013920173,0.00008335231,0.6388571,0.001941228,0.31608546,0.0029100236,0.039357416],"study_design_scores_gemma":[0.000008260317,0.0000117327245,0.000048659414,0.0000064757805,0.000005998556,0.000019646199,0.0000052117593,0.9202183,0.00026164495,0.078382865,0.001020363,0.000010702601],"about_ca_topic_score_codex":0.008779029,"about_ca_topic_score_gemma":0.005193969,"teacher_disagreement_score":0.008779029,"about_ca_system_score_codex":0.00096752966,"about_ca_system_score_gemma":0.0018711595,"threshold_uncertainty_score":0.017455816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9448388,0.00010979705,0.05293947,0.0002951406,0.000016553036,0.00003761557,0.00024939468,0.00005894115,0.0014543313],"genre_scores_gemma":[0.99532723,0.0000624003,0.0024756861,0.000021401738,0.000007746349,0.000028075692,0.00014422215,0.000012080054,0.0019210861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997248,0.000052016407,0.000012503382,0.00007515786,0.000030257508,0.000105231265],"domain_scores_gemma":[0.9957664,0.002853405,0.000400891,0.00020944705,0.00041806698,0.0003517866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060363,0.00039692392,0.0007671461,0.00057839457,0.00041111026,0.0013771817,0.00089554477,0.0011667524,0.0027027105],"category_scores_gemma":[0.007810226,0.0004516295,0.0006528675,0.00040134898,0.0010543037,0.0016831518,0.0010272674,0.0009287131,0.000392469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009609482,0.0003776314,0.03744305,0.00014219899,0.00019291112,0.00051904167,0.00082690606,0.90046483,0.009537002,0.029990088,0.0014221688,0.01812318],"study_design_scores_gemma":[0.00002402405,0.00014929318,0.018743634,0.000022782853,0.000041611303,0.000077661454,0.00032185635,0.96578836,0.0009998234,0.013575311,0.00021280405,0.000042804066],"about_ca_topic_score_codex":0.0075887027,"about_ca_topic_score_gemma":0.00532117,"teacher_disagreement_score":0.0075887027,"about_ca_system_score_codex":0.00073922385,"about_ca_system_score_gemma":0.0006847431,"threshold_uncertainty_score":0.015089095},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09073818,0.05333001,0.8233829,0.0060574734,0.0008504832,0.000064963286,0.00092780066,0.0010602947,0.02358791],"genre_scores_gemma":[0.6940849,0.07842223,0.21120125,0.0011299545,0.0019630403,0.0001526562,0.0016433178,0.00066521304,0.010737423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992167,0.00031980843,0.00005797196,0.00013572052,0.0002096525,0.000060167295],"domain_scores_gemma":[0.9963038,0.0021583235,0.00032424508,0.0002881608,0.0007338681,0.00019161044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019214903,0.0010775595,0.0013438732,0.0009957729,0.00034644592,0.0023490642,0.0036688328,0.0018759515,0.0030480523],"category_scores_gemma":[0.008864759,0.00081440853,0.00096711173,0.0029197216,0.0008976989,0.0033840856,0.0010052209,0.00212131,0.0007799526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006708822,0.000057482186,0.0033139356,0.00028527578,0.00004450665,0.000055992383,0.00007253275,0.93230593,0.0004728421,0.022970581,0.0023286205,0.038025316],"study_design_scores_gemma":[0.00000428141,0.000011962262,0.00023458718,0.000022821527,0.000011880178,0.000023728167,0.000017819586,0.9883477,0.0001713091,0.0059471354,0.005199169,0.000007715569],"about_ca_topic_score_codex":0.010130546,"about_ca_topic_score_gemma":0.006605583,"teacher_disagreement_score":0.010130546,"about_ca_system_score_codex":0.0016049624,"about_ca_system_score_gemma":0.0010202447,"threshold_uncertainty_score":0.020143151},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076643154,0.0012294889,0.91015005,0.00064699457,0.0002483052,0.00007618248,0.00016791544,0.00021730908,0.010620546],"genre_scores_gemma":[0.8256115,0.0016517297,0.1539603,0.0003757484,0.00029611908,0.00037813428,0.00029492046,0.00040747062,0.017024074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987134,0.000578764,0.000058181802,0.00017583882,0.00030388514,0.00017002232],"domain_scores_gemma":[0.99076337,0.007037963,0.00067777827,0.00048403486,0.0005226221,0.0005141664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030444046,0.001742374,0.0012697738,0.0008417214,0.0006968181,0.0021732966,0.0020318136,0.0014258404,0.0066000246],"category_scores_gemma":[0.01311674,0.0011906321,0.0008144625,0.001504776,0.0025078263,0.0039407117,0.0016316125,0.0023356027,0.0006015808],"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.0008033631,0.00014021882,0.0003383622,0.0003948483,0.00006184246,0.00034253983,0.0003061529,0.35760587,0.007007018,0.5974255,0.002831145,0.032743037],"study_design_scores_gemma":[0.00007599897,0.00014515819,0.00013641409,0.000023495293,0.000019769066,0.00007927416,0.000043721106,0.57060945,0.0017582502,0.42533168,0.0017483775,0.000028463763],"about_ca_topic_score_codex":0.001029388,"about_ca_topic_score_gemma":0.00063495216,"teacher_disagreement_score":0.0066000246,"about_ca_system_score_codex":0.00095945527,"about_ca_system_score_gemma":0.0011747171,"threshold_uncertainty_score":0.022079289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6300988,0.0011050728,0.22710185,0.009050663,0.00012312239,0.00021411732,0.00015674028,0.000055334633,0.13209426],"genre_scores_gemma":[0.992073,0.00023982293,0.003176797,0.00006132932,0.000035795638,0.0000303989,0.000016791644,0.000010301488,0.0043556266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972076,0.0015106386,0.00010584578,0.0002375716,0.00044951198,0.0004888717],"domain_scores_gemma":[0.9902255,0.00698995,0.0008590785,0.00047451307,0.00082733145,0.0006235504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004421528,0.00049429265,0.00095567544,0.0007015256,0.0016340237,0.0049113375,0.0018065373,0.0027034637,0.011540257],"category_scores_gemma":[0.015427549,0.0005518324,0.00087670906,0.0012195488,0.0041087936,0.00803681,0.0024240965,0.002283203,0.00033916126],"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.00009576445,0.00015614797,0.0015218899,0.000048149537,0.00003537272,0.00021186018,0.00093298074,0.0866509,0.00040532713,0.89935976,0.000983341,0.009598609],"study_design_scores_gemma":[0.000049735743,0.000041805077,0.0012300685,0.000029985438,0.00001972609,0.000051787767,0.0011431817,0.16163312,0.00014337103,0.83355445,0.002078181,0.00002452719],"about_ca_topic_score_codex":0.01136981,"about_ca_topic_score_gemma":0.0074132453,"teacher_disagreement_score":0.011540257,"about_ca_system_score_codex":0.0037276486,"about_ca_system_score_gemma":0.0035102074,"threshold_uncertainty_score":0.038606048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022744595,0.00019284153,0.9927012,0.00014540154,0.00008042557,0.00008175117,0.00008088601,0.00022407458,0.0042188545],"genre_scores_gemma":[0.08274314,0.00036982624,0.9106433,0.00021054407,0.000094949624,0.00032242254,0.00024239715,0.00035585996,0.005017666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990018,0.00030527118,0.000045699166,0.0001101817,0.00044293684,0.000094091985],"domain_scores_gemma":[0.9966415,0.0021645443,0.00014448864,0.00024274772,0.0006888226,0.000117909185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024982162,0.0014291159,0.001607025,0.00112514,0.0007269044,0.0017323904,0.002371296,0.0017331954,0.012773484],"category_scores_gemma":[0.00884157,0.00088910904,0.0011071939,0.002972861,0.00077599456,0.0021110615,0.0019456679,0.0026599322,0.0013598592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057647787,0.00010498447,0.00018058032,0.00014671838,0.00003864543,0.000100131605,0.000043234868,0.8668613,0.0006560219,0.029261649,0.0041688452,0.09838021],"study_design_scores_gemma":[0.000012270035,0.000010886522,0.000023225666,0.00000776283,0.000004349203,0.000013725325,0.0000055614,0.99322176,0.00011135909,0.005817772,0.00076661224,0.0000047209974],"about_ca_topic_score_codex":0.014357246,"about_ca_topic_score_gemma":0.01297794,"teacher_disagreement_score":0.014357246,"about_ca_system_score_codex":0.0012102972,"about_ca_system_score_gemma":0.0029452927,"threshold_uncertainty_score":0.042731583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024892922,0.0011687763,0.9605685,0.0022347677,0.00020221499,0.00010879953,0.000062199135,0.00011207541,0.010649779],"genre_scores_gemma":[0.54569364,0.0020103434,0.41035703,0.0007644919,0.00074456446,0.0006798436,0.00025465607,0.00040570236,0.039089795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589926,0.0024231502,0.00018804026,0.00045103353,0.0006002982,0.00043829277],"domain_scores_gemma":[0.9794698,0.017037349,0.0006434671,0.0012022156,0.001064546,0.00058262865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011816761,0.0011708406,0.0021400822,0.0020716507,0.0021300593,0.0027301137,0.004414221,0.0032685364,0.011040216],"category_scores_gemma":[0.03608686,0.0010441855,0.0017200165,0.0025282297,0.0043103085,0.008399654,0.0046761376,0.0050707376,0.0007787562],"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.00017952308,0.00012659148,0.0008483941,0.00013076271,0.00007888412,0.00011693382,0.00036096587,0.10160758,0.0004526128,0.84479535,0.0043523293,0.046950158],"study_design_scores_gemma":[0.000051548017,0.00004795625,0.00017313691,0.000043194617,0.000027069844,0.00005036188,0.00005665758,0.47477514,0.00040832144,0.5204233,0.003918333,0.000025059971],"about_ca_topic_score_codex":0.003493647,"about_ca_topic_score_gemma":0.0019976983,"teacher_disagreement_score":0.011816761,"about_ca_system_score_codex":0.002638991,"about_ca_system_score_gemma":0.0024948213,"threshold_uncertainty_score":0.06249374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29043525,0.0042403005,0.491672,0.020632919,0.0009127044,0.00056291895,0.007940032,0.0013243321,0.1822795],"genre_scores_gemma":[0.9082732,0.0014705957,0.011669561,0.00073161547,0.00034792587,0.00024631282,0.0011171065,0.00015498413,0.07598876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974235,0.0008894161,0.00007156898,0.00046686898,0.00029302374,0.0008556751],"domain_scores_gemma":[0.9915222,0.0047453893,0.0009903138,0.0003664439,0.0010745471,0.0013011186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025496522,0.002717866,0.0052705933,0.0022142932,0.0024242061,0.0070685023,0.009405096,0.011182196,0.034111295],"category_scores_gemma":[0.008149023,0.0026027458,0.0021229086,0.0051464885,0.0048466376,0.006944075,0.003000171,0.0051513277,0.0042661233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055129593,0.0003258951,0.00088434597,0.00030074097,0.00008927834,0.0009931492,0.00017933463,0.6175721,0.000663343,0.35795593,0.013968567,0.00651604],"study_design_scores_gemma":[0.0003050618,0.00017987579,0.00036882077,0.00003739861,0.00006584168,0.00026861212,0.00018517002,0.9146847,0.00013416186,0.08066992,0.0030011882,0.00009918501],"about_ca_topic_score_codex":0.032659188,"about_ca_topic_score_gemma":0.019503623,"teacher_disagreement_score":0.034111295,"about_ca_system_score_codex":0.006398438,"about_ca_system_score_gemma":0.0029135204,"threshold_uncertainty_score":0.11411363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08060577,0.00063469855,0.90779364,0.00033524568,0.00026084468,0.00022632514,0.0001389876,0.0006712824,0.009333252],"genre_scores_gemma":[0.46748662,0.00024857456,0.52510226,0.00017037925,0.000100347905,0.0003194718,0.00032959826,0.00024955676,0.0059932647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942553,0.0002447356,0.000027036402,0.0000967991,0.00013583398,0.00007003826],"domain_scores_gemma":[0.9984377,0.0010008804,0.000090228845,0.00013376505,0.000248492,0.000088888446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013273573,0.0008162561,0.0013523701,0.0008444134,0.00071904424,0.00085979444,0.002058194,0.0015288185,0.0046657696],"category_scores_gemma":[0.0040224516,0.00057206134,0.0009868433,0.00081783184,0.0005580899,0.0013260355,0.0011277325,0.0012097014,0.00053899724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016093571,0.00020918634,0.00030218734,0.00006112772,0.000034095265,0.000059048805,0.000040457635,0.9451988,0.0011132368,0.0050685634,0.001603765,0.046148617],"study_design_scores_gemma":[0.000020679408,0.000033111908,0.0000447817,0.0000028298289,0.0000067784767,0.000007111537,0.000006788905,0.99856585,0.000120607714,0.00090517965,0.00028313568,0.0000031569202],"about_ca_topic_score_codex":0.010182545,"about_ca_topic_score_gemma":0.010915123,"teacher_disagreement_score":0.010182545,"about_ca_system_score_codex":0.0008524286,"about_ca_system_score_gemma":0.0015148044,"threshold_uncertainty_score":0.020246565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824561,0.0004604531,0.012973051,0.00040532454,0.000067278364,0.00036129728,0.00090736063,0.00016683378,0.002202288],"genre_scores_gemma":[0.9942163,0.0001309375,0.0044522486,0.000047834117,0.000011387243,0.00012975435,0.00082076946,0.000011525724,0.00017922689],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98970234,0.006743154,0.0007182131,0.0008457322,0.0014628174,0.00052779156],"domain_scores_gemma":[0.9745412,0.013203905,0.003982334,0.0020168717,0.005083706,0.0011720356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014198425,0.00076869054,0.0009947427,0.0021411455,0.00074956997,0.0020461066,0.0014947434,0.0012883603,0.001489872],"category_scores_gemma":[0.031365924,0.00028652826,0.0005590423,0.0034459322,0.00065846706,0.002027449,0.001720914,0.00091164245,0.00031788042],"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.010951942,0.006936437,0.45104766,0.00078826945,0.0010113841,0.00014836676,0.0028032651,0.11908863,0.0024046889,0.0059108287,0.006407904,0.39250067],"study_design_scores_gemma":[0.0012188235,0.013235732,0.57138985,0.0005337172,0.0005630365,0.00020082865,0.0040704124,0.3958519,0.0021981045,0.0055437535,0.0049427124,0.0002511074],"about_ca_topic_score_codex":0.023032827,"about_ca_topic_score_gemma":0.010925074,"teacher_disagreement_score":0.023032827,"about_ca_system_score_codex":0.0028661392,"about_ca_system_score_gemma":0.0036861433,"threshold_uncertainty_score":0.075089335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004920076,0.000035618265,0.99274045,0.00003446073,0.000012955783,0.00003963275,0.000067085035,0.00095675705,0.0011929295],"genre_scores_gemma":[0.087505646,0.000052365493,0.9105355,0.000041137988,0.000018734241,0.00024963793,0.00018400548,0.00041951923,0.0009935108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561703,0.0025032896,0.00019612965,0.00038145785,0.0010839306,0.00021821684],"domain_scores_gemma":[0.979705,0.016466424,0.0004675903,0.001817302,0.0014014558,0.0001421925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054934253,0.0014369081,0.0016133046,0.001963706,0.00091313774,0.0020653796,0.0021594667,0.0012836654,0.009285938],"category_scores_gemma":[0.025079241,0.0009616553,0.0019856677,0.0033477147,0.00066033105,0.0026347397,0.0029594684,0.002697451,0.0012560574],"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.00085755606,0.0007876796,0.0024471823,0.0005028113,0.0006117667,0.00026789278,0.00090942875,0.29334885,0.02312218,0.067811735,0.0048381346,0.60449475],"study_design_scores_gemma":[0.000073485295,0.00016403034,0.0010596844,0.000036624035,0.00014458617,0.000084041625,0.00006570779,0.9562991,0.01454217,0.021968741,0.005488581,0.00007317152],"about_ca_topic_score_codex":0.0026194146,"about_ca_topic_score_gemma":0.004183233,"teacher_disagreement_score":0.009285938,"about_ca_system_score_codex":0.0007570494,"about_ca_system_score_gemma":0.0014078338,"threshold_uncertainty_score":0.03106451},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110210665,0.0012287197,0.6740893,0.00856764,0.001378893,0.001308082,0.013985587,0.055379704,0.13385142],"genre_scores_gemma":[0.5814508,0.0008495369,0.33664268,0.00051172957,0.0019131633,0.0007595327,0.01680289,0.007922048,0.053147674],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770206,0.00056715234,0.00013941173,0.00036112044,0.001009867,0.00022045764],"domain_scores_gemma":[0.9874699,0.003317412,0.00087885314,0.003821345,0.0032389264,0.0012735636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004526854,0.0010596561,0.0010876729,0.0023996285,0.0011585354,0.0051480075,0.0024123301,0.0011560946,0.029293783],"category_scores_gemma":[0.013469378,0.00045200723,0.00064324954,0.004664505,0.00077546603,0.0046958444,0.0019640846,0.0012302111,0.006990404],"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.0016536107,0.0004291736,0.011397202,0.0005518482,0.00014770201,0.00018206563,0.00074850424,0.031396873,0.010620661,0.072534375,0.29251733,0.5778207],"study_design_scores_gemma":[0.0004557502,0.00091842434,0.028902583,0.00024036788,0.00026644004,0.00057887513,0.001210485,0.3897471,0.023738272,0.14825542,0.40542752,0.00025874373],"about_ca_topic_score_codex":0.0038340692,"about_ca_topic_score_gemma":0.0026234877,"teacher_disagreement_score":0.029293783,"about_ca_system_score_codex":0.0019197144,"about_ca_system_score_gemma":0.0032611394,"threshold_uncertainty_score":0.09799743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17776796,0.0023848186,0.77214324,0.0026167005,0.00030625897,0.00050261396,0.0017091277,0.00053047563,0.0420389],"genre_scores_gemma":[0.9350172,0.001089008,0.037233498,0.00014800108,0.000060091283,0.0005706331,0.0005573844,0.000109978355,0.025214158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987853,0.0005705209,0.000045348756,0.00017461434,0.00015689094,0.0002673066],"domain_scores_gemma":[0.99772173,0.0016684433,0.00019188388,0.000045049474,0.0002136031,0.00015931172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027461958,0.001479389,0.002747626,0.0012670936,0.0011554252,0.003989897,0.0029226064,0.0050633145,0.009827053],"category_scores_gemma":[0.0048341104,0.002318983,0.0016474443,0.001985869,0.0013132046,0.0026339553,0.001294543,0.002624083,0.00080165453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048517806,0.000023421415,0.000108443084,0.000037688496,0.00002394544,0.00004774898,0.000020725838,0.9928671,0.00012455003,0.0053391457,0.0002776201,0.0010811012],"study_design_scores_gemma":[0.000023791405,0.00002422153,0.000112230075,0.000006341752,0.000014832627,0.0000067931383,0.000016866206,0.997607,0.000043524065,0.0018753847,0.00025931015,0.000009725182],"about_ca_topic_score_codex":0.036712904,"about_ca_topic_score_gemma":0.020617364,"teacher_disagreement_score":0.036712904,"about_ca_system_score_codex":0.0041519417,"about_ca_system_score_gemma":0.004183557,"threshold_uncertainty_score":0.072998464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88169754,0.00044723175,0.10567212,0.00079095125,0.000022740358,0.000058513433,0.00006125591,0.000032175558,0.011217508],"genre_scores_gemma":[0.9955035,0.00013363615,0.002124522,0.000016605143,0.000011080363,0.000014304281,0.000020128819,0.000007780582,0.0021684628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991726,0.00035716587,0.00003973069,0.000109805456,0.000119405224,0.00020123045],"domain_scores_gemma":[0.99277437,0.0041672257,0.0011127692,0.0003557547,0.0009049451,0.0006848691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031913707,0.00036986775,0.0010443844,0.0014994435,0.001638002,0.0031263935,0.0021562942,0.0013885517,0.0033807035],"category_scores_gemma":[0.014234953,0.00043685545,0.0013227018,0.0015070617,0.0028363103,0.0031679543,0.0016604656,0.0016310719,0.00016751389],"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.00028194799,0.00012929614,0.015074514,0.000106232335,0.00013232924,0.0008201526,0.0011515499,0.47309366,0.0026650082,0.48989904,0.0008631395,0.0157831],"study_design_scores_gemma":[0.000019651188,0.00006457575,0.0037166427,0.000012271333,0.000056927984,0.00017940873,0.0005452345,0.9096625,0.00033638225,0.08487304,0.000501898,0.00003151916],"about_ca_topic_score_codex":0.010759603,"about_ca_topic_score_gemma":0.004228404,"teacher_disagreement_score":0.010759603,"about_ca_system_score_codex":0.0021781859,"about_ca_system_score_gemma":0.0016583485,"threshold_uncertainty_score":0.021393955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80074346,0.00023170364,0.19502006,0.00046258356,0.0000882772,0.00023437945,0.00013164985,0.00018334354,0.0029045842],"genre_scores_gemma":[0.9903549,0.000033904384,0.008438407,0.000022176355,0.000016632306,0.000064555374,0.00003295792,0.000017969462,0.001018541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969938,0.0011757454,0.00012842995,0.0005032803,0.0002487733,0.0009499069],"domain_scores_gemma":[0.9880531,0.008193575,0.0008318855,0.0005020743,0.0007592744,0.0016601216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042369333,0.0012321157,0.0024925119,0.00089832314,0.0012869113,0.0025068878,0.0018899217,0.0023927516,0.003882141],"category_scores_gemma":[0.010330268,0.0012560071,0.0008115291,0.0008939408,0.0011402984,0.002409761,0.0022466774,0.0014576231,0.00043071495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027815143,0.00042904489,0.003824679,0.00018153248,0.00010948785,0.00050683285,0.00021564361,0.96747833,0.0037220013,0.0028861521,0.00067956466,0.017185263],"study_design_scores_gemma":[0.00006190106,0.00027933117,0.001436129,0.000008865247,0.000034783137,0.000044768956,0.00017678255,0.99505,0.0006032379,0.002125386,0.0001556746,0.00002315305],"about_ca_topic_score_codex":0.0067041907,"about_ca_topic_score_gemma":0.004707843,"teacher_disagreement_score":0.0067041907,"about_ca_system_score_codex":0.0011581122,"about_ca_system_score_gemma":0.0012296559,"threshold_uncertainty_score":0.022407353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029080578,0.000116481046,0.9925305,0.00006180489,0.00002761435,0.000032383614,0.00014105262,0.0000616279,0.004120479],"genre_scores_gemma":[0.252845,0.00084381294,0.73366416,0.00014872964,0.0001684945,0.0006501816,0.00084822625,0.00031274246,0.010518663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974681,0.0013739632,0.000103049904,0.00031664866,0.0005638395,0.00017432703],"domain_scores_gemma":[0.99534154,0.0030273658,0.00026282412,0.00057848636,0.0006890509,0.00010080407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004432111,0.0015463553,0.0013334189,0.0020194992,0.0004796252,0.0024123508,0.0013055687,0.0008491219,0.007646102],"category_scores_gemma":[0.012495629,0.0004936452,0.0013820383,0.002787008,0.0007294383,0.002488,0.0015269483,0.0018755597,0.0012063467],"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.00009472919,0.0001304457,0.0005509964,0.00016752037,0.00013163466,0.000043064905,0.00006820433,0.45114386,0.00133173,0.41254053,0.0037487461,0.1300485],"study_design_scores_gemma":[0.000012121307,0.000030425133,0.000244942,0.000029139574,0.000042856835,0.0000364779,0.000017358796,0.8088687,0.0009000586,0.18510067,0.004705583,0.00001171387],"about_ca_topic_score_codex":0.0016880993,"about_ca_topic_score_gemma":0.0017382303,"teacher_disagreement_score":0.007646102,"about_ca_system_score_codex":0.0013844471,"about_ca_system_score_gemma":0.0013642086,"threshold_uncertainty_score":0.025578797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8341775,0.0012744139,0.15623336,0.0011308457,0.00013665855,0.0003058029,0.00055555505,0.00041837344,0.005767544],"genre_scores_gemma":[0.9919092,0.00022430316,0.0061776303,0.000043565633,0.000036784768,0.000050633545,0.0000934122,0.000027413158,0.001437158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905604,0.00033806037,0.00005769104,0.0001496864,0.000080680096,0.00031800018],"domain_scores_gemma":[0.98068833,0.01291347,0.002464635,0.0006481517,0.00104119,0.0022442043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941829,0.0011278249,0.0021593764,0.001377301,0.00051871245,0.0025548963,0.0019461837,0.0022870393,0.004844706],"category_scores_gemma":[0.016445138,0.0011840684,0.00085273286,0.0009781986,0.0014211546,0.0030999195,0.0012846114,0.0016316351,0.0002675948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039615477,0.0004547118,0.0064069564,0.0004139268,0.00010225826,0.00052089,0.00016745286,0.9251102,0.0075447843,0.027317895,0.0028953839,0.025103968],"study_design_scores_gemma":[0.00022625708,0.00036489914,0.0041389246,0.000056397344,0.000065052074,0.000116033785,0.0000914585,0.9767198,0.0011442163,0.016751794,0.0002679198,0.00005726657],"about_ca_topic_score_codex":0.0028921913,"about_ca_topic_score_gemma":0.0018400948,"teacher_disagreement_score":0.004941829,"about_ca_system_score_codex":0.002180936,"about_ca_system_score_gemma":0.0024690654,"threshold_uncertainty_score":0.026135266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016299537,0.00032517908,0.9945866,0.0003601121,0.000101491976,0.000102150836,0.00011930962,0.00007670645,0.0026986243],"genre_scores_gemma":[0.077863306,0.0011541162,0.9128694,0.0004071307,0.00037941823,0.0007613017,0.00033705067,0.00024121373,0.005987102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971091,0.0008862776,0.0001533457,0.00052915263,0.0010696759,0.00025243592],"domain_scores_gemma":[0.9937789,0.0047124084,0.00032485893,0.00026068097,0.00070270785,0.0002204071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004014537,0.0019998213,0.0024725255,0.0017190474,0.0013125401,0.0038161108,0.0057534724,0.0037526959,0.007105321],"category_scores_gemma":[0.01135274,0.0023091852,0.0029802916,0.0056221928,0.0015322194,0.003217807,0.0023253064,0.0049959705,0.00089590205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048878584,0.000096221534,0.00013763236,0.00021458043,0.00007894629,0.0002054857,0.000058514514,0.9278562,0.0009638096,0.04855774,0.0025394068,0.019242518],"study_design_scores_gemma":[0.000016077483,0.000016308257,0.000039294595,0.000016533775,0.000016325763,0.000029692872,0.000009597612,0.9850139,0.00016720929,0.013379728,0.0012824434,0.000012848011],"about_ca_topic_score_codex":0.01871072,"about_ca_topic_score_gemma":0.013050809,"teacher_disagreement_score":0.01871072,"about_ca_system_score_codex":0.0025386093,"about_ca_system_score_gemma":0.004050175,"threshold_uncertainty_score":0.03720367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7830782,0.0004881894,0.20139177,0.001221811,0.00027336422,0.00019999573,0.00026805696,0.0017869967,0.011291605],"genre_scores_gemma":[0.9909656,0.000044411583,0.0066348645,0.000031595653,0.00001336277,0.000010753867,0.000042262684,0.000010285269,0.0022469317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996971,0.00007915036,0.0000140820675,0.000054860324,0.000047353933,0.00010749922],"domain_scores_gemma":[0.9995333,0.0001884277,0.000041550116,0.000059293332,0.00012276003,0.000054643115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004115716,0.00032933286,0.0004681946,0.00034232967,0.0009221319,0.00083407515,0.0007600091,0.0007023444,0.004244998],"category_scores_gemma":[0.00072378624,0.00018150148,0.00030100698,0.0003461485,0.00034757736,0.0005488411,0.00064791366,0.00032827366,0.00037309606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001995596,0.0002525172,0.0055631404,0.00015380344,0.000100069694,0.001591909,0.00036178177,0.80649805,0.034112196,0.012757019,0.009517097,0.12709674],"study_design_scores_gemma":[0.000029704039,0.00021886903,0.00071913603,0.000004925027,0.000031055315,0.00016378578,0.00014043518,0.99269426,0.0026188784,0.0017903725,0.0015754099,0.000013184808],"about_ca_topic_score_codex":0.006309508,"about_ca_topic_score_gemma":0.006378373,"teacher_disagreement_score":0.006309508,"about_ca_system_score_codex":0.00078938104,"about_ca_system_score_gemma":0.0007980582,"threshold_uncertainty_score":0.014200985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8449989,0.00032994847,0.12840623,0.0007617866,0.000037723596,0.00066378526,0.0010265438,0.00044385405,0.023331242],"genre_scores_gemma":[0.9691584,0.00015533046,0.025707472,0.000031705837,0.000007123612,0.00015943358,0.00026720404,0.000039353097,0.004473889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959415,0.00012863323,0.000012905659,0.000045356144,0.00007099961,0.00014802572],"domain_scores_gemma":[0.9988681,0.00076280005,0.00006544897,0.000025555377,0.00015229537,0.00012572418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012769665,0.00095636724,0.0011116867,0.0009740503,0.0014632446,0.0019489615,0.0017884269,0.0018208772,0.0038197993],"category_scores_gemma":[0.0020577132,0.0007518202,0.00074736495,0.0016856174,0.0012504744,0.0007292833,0.0008053899,0.0011176739,0.00014089436],"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.000053431864,0.000044248438,0.00071731367,0.000020991933,0.000007968908,0.00008056022,0.00003913123,0.99425125,0.00015538906,0.0015046707,0.0002386331,0.002886438],"study_design_scores_gemma":[0.000030545616,0.000049482795,0.0004241137,0.0000037873708,0.000010031606,0.0000065605245,0.000067817295,0.99834645,0.00012676128,0.00062625326,0.0003009284,0.000007302716],"about_ca_topic_score_codex":0.7007737,"about_ca_topic_score_gemma":0.7127841,"teacher_disagreement_score":0.29922628,"about_ca_system_score_codex":0.011246082,"about_ca_system_score_gemma":0.011148177,"threshold_uncertainty_score":0.601977},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004099342,0.000037815345,0.9986896,0.000016913955,0.00004290949,0.000016564678,0.000026016816,0.0004289828,0.00033121524],"genre_scores_gemma":[0.01744389,0.00007435701,0.9790813,0.000044989025,0.000061030867,0.00012647046,0.00009052041,0.00023962259,0.00283778],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905354,0.00023394955,0.000064335145,0.00015725293,0.00044402306,0.000046926256],"domain_scores_gemma":[0.99860257,0.0006169717,0.000060048253,0.0002698526,0.0003936951,0.00005692937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011773345,0.000965386,0.0012535899,0.0012469278,0.0008438363,0.0009602394,0.0013361528,0.001003904,0.010731416],"category_scores_gemma":[0.0056996183,0.0006000695,0.0012054989,0.0012296548,0.0005485203,0.0009422159,0.0012426061,0.001557086,0.004086187],"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.00023946872,0.00009580946,0.00046386203,0.00035865506,0.0001643426,0.00023256679,0.0001741609,0.042791627,0.049699992,0.08646255,0.00921721,0.81009966],"study_design_scores_gemma":[0.00016467423,0.00021860862,0.0011359878,0.000060014998,0.00016183974,0.0007316059,0.000048530903,0.80340064,0.036061913,0.10495048,0.052916937,0.00014875119],"about_ca_topic_score_codex":0.001650842,"about_ca_topic_score_gemma":0.0026016939,"teacher_disagreement_score":0.010731416,"about_ca_system_score_codex":0.00038742903,"about_ca_system_score_gemma":0.0008224894,"threshold_uncertainty_score":0.035900235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6522619,0.0037732883,0.26308525,0.014762397,0.0004585713,0.00013239343,0.0007482955,0.00040127753,0.06437658],"genre_scores_gemma":[0.95835173,0.0009034704,0.030853057,0.0006960928,0.00034780748,0.00013329448,0.00046574287,0.0001162624,0.008132447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999071,0.00040718162,0.000029748155,0.00022512347,0.00013158827,0.00013526891],"domain_scores_gemma":[0.9846986,0.012041564,0.0009556616,0.0007756577,0.0006971452,0.0008313818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221049,0.00034815454,0.0012503826,0.001389442,0.0019386671,0.0025605224,0.0019619127,0.002112371,0.008630263],"category_scores_gemma":[0.02256016,0.00053711585,0.0008514857,0.00126813,0.0030423962,0.005475046,0.0018361142,0.0021593731,0.0005122733],"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.00029482757,0.0001310146,0.0030083398,0.00025964552,0.0000547659,0.00016908352,0.0004420006,0.043612186,0.0011119071,0.92287177,0.0129835345,0.0150609985],"study_design_scores_gemma":[0.00006146187,0.000037582824,0.0008370736,0.00004288141,0.00001801925,0.00008209047,0.0002125045,0.12930265,0.00042650182,0.86740065,0.0015592711,0.000019448127],"about_ca_topic_score_codex":0.0014612754,"about_ca_topic_score_gemma":0.002432628,"teacher_disagreement_score":0.008630263,"about_ca_system_score_codex":0.0012732793,"about_ca_system_score_gemma":0.00074884575,"threshold_uncertainty_score":0.028871119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7801834,0.00041683586,0.18648073,0.0015791398,0.00008354003,0.0009848342,0.000503931,0.00029649236,0.029471088],"genre_scores_gemma":[0.97622776,0.00013182648,0.021198355,0.000060810296,0.000037007365,0.00011227516,0.00010469508,0.00003125178,0.0020959096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710995,0.001302587,0.000113306414,0.0005059761,0.00033385062,0.0006343249],"domain_scores_gemma":[0.9869937,0.009871657,0.0008253539,0.00046569455,0.0012229565,0.00062073866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008359932,0.0008743273,0.0023854305,0.002234894,0.0016414728,0.004610962,0.0018669564,0.002629636,0.006435443],"category_scores_gemma":[0.014621755,0.0018193714,0.0012688707,0.0012967242,0.0020479243,0.0038213856,0.0016428712,0.0024326365,0.00068225316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009483639,0.00025970183,0.003174155,0.000163264,0.00009733313,0.00041179417,0.0001308371,0.9009678,0.0042789206,0.074464925,0.001531409,0.013571531],"study_design_scores_gemma":[0.00013455984,0.00023466065,0.0021283284,0.000030562216,0.000053282092,0.00008820376,0.0001511821,0.9712266,0.002541829,0.022404298,0.00096309074,0.000043485543],"about_ca_topic_score_codex":0.0052526835,"about_ca_topic_score_gemma":0.0034921332,"teacher_disagreement_score":0.008359932,"about_ca_system_score_codex":0.0050764955,"about_ca_system_score_gemma":0.006743016,"threshold_uncertainty_score":0.044212103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804981,0.0014265745,0.00031164408,0.0015438842,0.0000751242,0.00001720833,0.0002406438,0.000006506832,0.015880309],"genre_scores_gemma":[0.9979457,0.0002338935,0.00006361642,0.00014910226,0.00008729016,0.000005572929,0.00014647754,0.000008961626,0.001359338],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99930584,0.00021493962,0.000034887096,0.0001236435,0.00016442487,0.00015623699],"domain_scores_gemma":[0.9858598,0.009743685,0.0016190762,0.00025336904,0.00069547666,0.001828535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013898126,0.00037118563,0.00060800405,0.000955747,0.00060314056,0.0034228603,0.0008231139,0.002247396,0.027510185],"category_scores_gemma":[0.007945094,0.0003339887,0.0011868655,0.0012902172,0.0012524358,0.0032028866,0.0012383973,0.0019229632,0.0010284828],"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.00901255,0.0026332824,0.9185733,0.0003233399,0.0011974033,0.0006756937,0.002468579,0.002309014,0.003766658,0.029320033,0.0063374205,0.023382736],"study_design_scores_gemma":[0.00036463886,0.0008505598,0.972517,0.0001084202,0.0010552559,0.0003309778,0.0027014923,0.008285754,0.0004775692,0.010881451,0.0023604613,0.0000663888],"about_ca_topic_score_codex":0.014265993,"about_ca_topic_score_gemma":0.015609072,"teacher_disagreement_score":0.027510185,"about_ca_system_score_codex":0.00090021937,"about_ca_system_score_gemma":0.0011662268,"threshold_uncertainty_score":0.09203076},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39630958,0.0011081301,0.58366215,0.00234987,0.00028828616,0.0003970249,0.00047092873,0.000628096,0.014785917],"genre_scores_gemma":[0.9753307,0.00026065105,0.019331278,0.00008098863,0.00009849131,0.000064576474,0.00012924912,0.000080886355,0.0046231784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975318,0.0010517436,0.000096667194,0.0002821956,0.00028647884,0.00075112836],"domain_scores_gemma":[0.99116653,0.005872556,0.0007338452,0.00045642158,0.0009014328,0.00086924364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004036492,0.0015909456,0.004551086,0.001858311,0.0012128281,0.0042736325,0.004263521,0.003513972,0.006875102],"category_scores_gemma":[0.014447132,0.0028998028,0.0018006183,0.0026143093,0.0024537444,0.004831987,0.0017543907,0.002583321,0.00056974194],"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.00038682568,0.000157788,0.0006843136,0.00010045343,0.00006483682,0.00015832565,0.0000963633,0.9435252,0.00095321506,0.04167373,0.0020695564,0.010129325],"study_design_scores_gemma":[0.000030493393,0.00003074607,0.00018374916,0.0000056889753,0.000018574365,0.000019050181,0.000031315183,0.98677987,0.00011217223,0.012662119,0.00011252925,0.000013651841],"about_ca_topic_score_codex":0.009631187,"about_ca_topic_score_gemma":0.0060623037,"teacher_disagreement_score":0.009631187,"about_ca_system_score_codex":0.004347814,"about_ca_system_score_gemma":0.0025410955,"threshold_uncertainty_score":0.03154576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060748886,0.0007694146,0.7909202,0.010124534,0.00020473977,0.00036565494,0.0004942831,0.00016540123,0.13620694],"genre_scores_gemma":[0.90780365,0.00068430597,0.061520323,0.0004111539,0.00019034848,0.00050114765,0.00014338238,0.000068350855,0.028677244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569595,0.0025208634,0.00017005885,0.00043671243,0.00052666926,0.00064977695],"domain_scores_gemma":[0.9950446,0.003391909,0.00043090395,0.00024133721,0.0004035268,0.00048765988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004855175,0.0013727249,0.0017873419,0.0010937757,0.0013649766,0.005528549,0.0047398433,0.0075010434,0.014845485],"category_scores_gemma":[0.01280816,0.0016792406,0.0016820007,0.0020258809,0.00345834,0.0067360383,0.00270798,0.003600076,0.00066774484],"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.000034232846,0.000052848216,0.00019585318,0.000047833393,0.000030778006,0.00012221199,0.00013119626,0.18307891,0.00018482433,0.81174684,0.0012789356,0.0030956012],"study_design_scores_gemma":[0.000074376345,0.000062453,0.0001569974,0.000029261115,0.00003536859,0.00006623261,0.00013531931,0.43045977,0.00014338782,0.565077,0.0037354024,0.000024434403],"about_ca_topic_score_codex":0.012924194,"about_ca_topic_score_gemma":0.010382115,"teacher_disagreement_score":0.014845485,"about_ca_system_score_codex":0.0042771325,"about_ca_system_score_gemma":0.0047886884,"threshold_uncertainty_score":0.049663126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033024043,0.00018491941,0.9598702,0.00042046641,0.00007358287,0.00010310028,0.00005832765,0.00011165738,0.0061537577],"genre_scores_gemma":[0.77936053,0.00042217373,0.21049538,0.00011113683,0.00013204887,0.0002520162,0.0001349154,0.00009975779,0.008991967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983449,0.00070606475,0.0000684707,0.00034347863,0.00027920157,0.00025788156],"domain_scores_gemma":[0.9983291,0.0007769468,0.00025120997,0.00014429064,0.00030459816,0.00019385567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019467588,0.00093011616,0.0011424087,0.0008133182,0.00087667396,0.0022623225,0.0018655317,0.0014596254,0.0030262033],"category_scores_gemma":[0.00461632,0.00077933446,0.0009375567,0.0011557906,0.0011736506,0.0023094323,0.0016904869,0.0011028486,0.00031424317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101872756,0.000040796713,0.0003767621,0.00005974642,0.000037135593,0.00012641023,0.00009455192,0.9161177,0.0016999474,0.064999186,0.00091306213,0.015432712],"study_design_scores_gemma":[0.000012848965,0.000031537587,0.000053620028,0.0000046384507,0.000014765687,0.000024092591,0.000027277165,0.9805234,0.00031576934,0.018178158,0.0008087743,0.0000051748075],"about_ca_topic_score_codex":0.0045162817,"about_ca_topic_score_gemma":0.0034743538,"teacher_disagreement_score":0.0045162817,"about_ca_system_score_codex":0.0022092946,"about_ca_system_score_gemma":0.0017600616,"threshold_uncertainty_score":0.016029596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01528599,0.0016334485,0.97902304,0.0006017907,0.000088816385,0.000041839136,0.000029721403,0.000028514074,0.0032668738],"genre_scores_gemma":[0.5056791,0.0021515945,0.48758304,0.00016808066,0.00022516701,0.0002948553,0.00012338723,0.000095663134,0.0036791684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994024,0.0045338096,0.00018673885,0.0003145893,0.0006849149,0.00025600012],"domain_scores_gemma":[0.9884343,0.009685195,0.0005345172,0.00041297518,0.0006572499,0.00027573825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012314316,0.0018138887,0.0023273528,0.0018121196,0.00080418785,0.0032275843,0.0014231591,0.0021377993,0.0026147445],"category_scores_gemma":[0.02319213,0.0014349505,0.0019447699,0.0023427946,0.0031556527,0.004686355,0.0023037733,0.0032318376,0.00026715736],"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.0001548675,0.00013778733,0.0006003073,0.00028976274,0.0002004165,0.00008292995,0.00023009881,0.64396244,0.0008012067,0.30719727,0.0011776795,0.04516516],"study_design_scores_gemma":[0.000018190976,0.000031872285,0.0001539864,0.000052029452,0.000028683098,0.000019028525,0.000028827866,0.6130464,0.0001848706,0.38575974,0.0006610556,0.000015301724],"about_ca_topic_score_codex":0.0018980579,"about_ca_topic_score_gemma":0.0014705886,"teacher_disagreement_score":0.012314316,"about_ca_system_score_codex":0.0020925375,"about_ca_system_score_gemma":0.0014372488,"threshold_uncertainty_score":0.06512511},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3209117,0.00825285,0.47172153,0.019575419,0.0034478225,0.0010813021,0.002788622,0.01485221,0.15736859],"genre_scores_gemma":[0.8139189,0.0010439175,0.16694723,0.00096796424,0.00032444947,0.000143601,0.00058805424,0.00017637506,0.015889475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960238,0.0024234983,0.0002125734,0.00025642297,0.00083342363,0.00025029955],"domain_scores_gemma":[0.98952115,0.0069681876,0.0006523356,0.00064091705,0.0017675591,0.00044991096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052222083,0.000803423,0.0007738217,0.0014620759,0.0005717937,0.0032920875,0.000994901,0.0011271058,0.021010457],"category_scores_gemma":[0.0127353985,0.0002484946,0.00027826644,0.0012082498,0.000583692,0.0020664337,0.0009281818,0.00090978906,0.004408395],"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.004096131,0.002212438,0.008494235,0.0009691128,0.00020593655,0.00027215868,0.0005579707,0.03722742,0.010893752,0.05903782,0.058519892,0.8175132],"study_design_scores_gemma":[0.0023638282,0.0029802783,0.016164051,0.0009115317,0.0007813819,0.00049052795,0.0011515919,0.5815281,0.062055808,0.18024994,0.15094356,0.00037936482],"about_ca_topic_score_codex":0.0012694679,"about_ca_topic_score_gemma":0.0017538161,"teacher_disagreement_score":0.021010457,"about_ca_system_score_codex":0.0008850819,"about_ca_system_score_gemma":0.0017725198,"threshold_uncertainty_score":0.07028699},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4462366,0.0006349768,0.5408044,0.00093911757,0.00004941838,0.000170527,0.00028027192,0.00017842159,0.010706247],"genre_scores_gemma":[0.9819095,0.00024757645,0.015838608,0.00003998853,0.000020410747,0.0001039753,0.0001283544,0.000024750883,0.0016869857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579227,0.0024278548,0.00018250574,0.0005629915,0.000566172,0.00046828753],"domain_scores_gemma":[0.97011316,0.025280828,0.0021460087,0.0013866356,0.0007385163,0.00033487653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010145413,0.0012488294,0.0022642715,0.0012368296,0.00071860244,0.004167188,0.0016098843,0.0019770965,0.0021331992],"category_scores_gemma":[0.03168901,0.00072116137,0.0013459924,0.0016479313,0.0015579232,0.0039061108,0.0015749849,0.0026827776,0.00026387355],"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.00013295698,0.00013944022,0.0033444897,0.00007239647,0.00011840177,0.00007657501,0.00006715069,0.9300547,0.000973886,0.0553744,0.0002802833,0.009365292],"study_design_scores_gemma":[0.000017576942,0.00007211392,0.0014668686,0.000013371845,0.000036599096,0.000023349241,0.00005421023,0.9708407,0.00073615956,0.02643013,0.00029031248,0.000018708291],"about_ca_topic_score_codex":0.0051905205,"about_ca_topic_score_gemma":0.0036956472,"teacher_disagreement_score":0.010145413,"about_ca_system_score_codex":0.0027394148,"about_ca_system_score_gemma":0.001681501,"threshold_uncertainty_score":0.05365473},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22133474,0.0015065476,0.6170019,0.01733534,0.0003917534,0.0017467459,0.0022507976,0.00070259586,0.13772973],"genre_scores_gemma":[0.9023961,0.0007459784,0.07775746,0.00032162922,0.0000541741,0.0010724135,0.00023150581,0.000052120387,0.017368527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644583,0.0023483734,0.00007864198,0.0003903563,0.00020017839,0.00053660636],"domain_scores_gemma":[0.9977362,0.0011437256,0.0002221585,0.0001555256,0.00030000598,0.00044239342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035849733,0.0013239041,0.0014620153,0.0012158754,0.0016032181,0.005358877,0.0026964725,0.0024051836,0.015332775],"category_scores_gemma":[0.00488942,0.0008285378,0.001356356,0.0028427974,0.002003748,0.0047207926,0.0029995064,0.0023679514,0.0010477368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047250235,0.00037171989,0.0027423233,0.00019811802,0.00017643531,0.0003740741,0.0004851636,0.6516862,0.00042223115,0.31213942,0.0041334955,0.026798395],"study_design_scores_gemma":[0.00047029383,0.00053600967,0.0019891353,0.00009679329,0.000115533825,0.00021733032,0.0013157265,0.71504986,0.00021831391,0.2678963,0.011995056,0.00009958812],"about_ca_topic_score_codex":0.017097982,"about_ca_topic_score_gemma":0.018080177,"teacher_disagreement_score":0.017097982,"about_ca_system_score_codex":0.0058081546,"about_ca_system_score_gemma":0.0064943056,"threshold_uncertainty_score":0.051293314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2101261,0.0014884421,0.7586919,0.0010383229,0.00037195173,0.0008634707,0.0011664934,0.0005753903,0.025677871],"genre_scores_gemma":[0.9031907,0.0006388899,0.08054162,0.00014039795,0.00022293502,0.00040783177,0.00081569504,0.00022818676,0.013813835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965635,0.0013159536,0.00013040433,0.00056783087,0.0005255901,0.0008966829],"domain_scores_gemma":[0.99534684,0.0027349724,0.00059493416,0.00026908572,0.00053789257,0.0005163483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040318095,0.003658676,0.0048482753,0.0019536493,0.0013443372,0.004218317,0.0042615053,0.0041327453,0.008712159],"category_scores_gemma":[0.00593371,0.0029811051,0.0020203057,0.004420439,0.0014119113,0.00314542,0.0032822483,0.0022979076,0.0008785651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037741655,0.00019183444,0.0003375116,0.00009153362,0.0000832027,0.00017118582,0.000033862467,0.9851296,0.00053876825,0.0026306182,0.0006130882,0.009801328],"study_design_scores_gemma":[0.00007435721,0.00020822753,0.00025873785,0.000010143704,0.00004605993,0.000042591408,0.000034704386,0.9940791,0.0006491005,0.004033775,0.0005477658,0.000015481928],"about_ca_topic_score_codex":0.008986911,"about_ca_topic_score_gemma":0.006474265,"teacher_disagreement_score":0.008986911,"about_ca_system_score_codex":0.0034626897,"about_ca_system_score_gemma":0.002261793,"threshold_uncertainty_score":0.029145122},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034664103,0.00009976365,0.8525268,0.00014108943,0.00006755718,0.00016068586,0.0020994674,0.13312301,0.008315181],"genre_scores_gemma":[0.085459985,0.0004457523,0.86607337,0.0003743494,0.000048110083,0.0009487692,0.0060491124,0.029152082,0.011448516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996141,0.000080221485,0.0000418482,0.00007288238,0.00015088076,0.000040007573],"domain_scores_gemma":[0.9988809,0.0006733211,0.000065513814,0.0001400589,0.0001794205,0.00006074098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011120299,0.001268507,0.0009360955,0.0010560548,0.00045793754,0.0017845689,0.0019953144,0.0009757938,0.032963276],"category_scores_gemma":[0.0035934746,0.0009773383,0.0012548706,0.00084422476,0.00047243925,0.0016921657,0.0016659375,0.0020375825,0.007857855],"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.0008624802,0.00047539148,0.0028586285,0.0019838018,0.00042984696,0.00056835683,0.00059356424,0.24364175,0.013558917,0.07007491,0.1791004,0.485852],"study_design_scores_gemma":[0.00021051469,0.00007337807,0.00053049164,0.00010674665,0.00008003521,0.00018568963,0.00004920534,0.8739313,0.011477281,0.035563186,0.0777311,0.000061089115],"about_ca_topic_score_codex":0.0029521172,"about_ca_topic_score_gemma":0.003666852,"teacher_disagreement_score":0.032963276,"about_ca_system_score_codex":0.0005873946,"about_ca_system_score_gemma":0.0012579102,"threshold_uncertainty_score":0.11027312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8289501,0.0003158488,0.14855784,0.0013471858,0.00015713343,0.000071459406,0.00018189038,0.00057882094,0.019839741],"genre_scores_gemma":[0.99612963,0.000035378973,0.0026565085,0.00003933129,0.00003296177,0.000008953706,0.000036427362,0.000026216485,0.0010345534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984713,0.0003696259,0.00005850618,0.0002560348,0.0003761602,0.0004682814],"domain_scores_gemma":[0.9919863,0.0049622417,0.0010474655,0.00041863148,0.00094850664,0.0006368601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014240004,0.00048343092,0.0006923417,0.00078751927,0.0006774098,0.0026231282,0.0009347952,0.0010046153,0.0047315364],"category_scores_gemma":[0.010526364,0.00046495663,0.00024215202,0.0012469657,0.00046217468,0.0021031906,0.00079123554,0.000883069,0.00057570013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006357358,0.001339552,0.09912836,0.00026804177,0.00021844407,0.003220582,0.002084383,0.49504507,0.031638876,0.049837686,0.01722387,0.29363772],"study_design_scores_gemma":[0.000070457085,0.00034117102,0.01599643,0.000015789105,0.00006935344,0.0006239384,0.0007387259,0.94844574,0.00669552,0.025298256,0.0016447535,0.00005988221],"about_ca_topic_score_codex":0.0025278148,"about_ca_topic_score_gemma":0.0031142386,"teacher_disagreement_score":0.0047315364,"about_ca_system_score_codex":0.000917428,"about_ca_system_score_gemma":0.0010051462,"threshold_uncertainty_score":0.01582855},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05938285,0.0037204644,0.89373887,0.007792603,0.00031908546,0.00059885386,0.00010261864,0.00005402076,0.034290653],"genre_scores_gemma":[0.74029374,0.0014625706,0.25388727,0.00038974677,0.00021683161,0.0007280725,0.000064842185,0.000045196695,0.002911712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9738936,0.020108022,0.0007668217,0.0006959084,0.0036022067,0.00093340577],"domain_scores_gemma":[0.9722343,0.023735266,0.0013149418,0.0004488873,0.0015361443,0.00073041447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022252671,0.0021469756,0.0027709762,0.005956544,0.003744008,0.008278591,0.0036323227,0.0040239054,0.0039416086],"category_scores_gemma":[0.031737223,0.001019112,0.003013164,0.004539397,0.0076231216,0.00546768,0.005101367,0.0036319415,0.00019255365],"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.0001594366,0.00026456828,0.001240875,0.00081802637,0.000656052,0.0007659956,0.0021064165,0.37453118,0.0013258595,0.5757454,0.0021648677,0.040221293],"study_design_scores_gemma":[0.000051461666,0.00015407635,0.0005451089,0.0002793122,0.00010569323,0.000105098596,0.0016453746,0.3861866,0.00037613214,0.60693026,0.0035355126,0.000085262865],"about_ca_topic_score_codex":0.00522873,"about_ca_topic_score_gemma":0.006656693,"teacher_disagreement_score":0.022252671,"about_ca_system_score_codex":0.006347093,"about_ca_system_score_gemma":0.006376709,"threshold_uncertainty_score":0.11768472},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17293806,0.0027333444,0.77045864,0.004443827,0.00051327486,0.00047112344,0.0021572537,0.00042410634,0.045860354],"genre_scores_gemma":[0.861296,0.001329228,0.1115369,0.0004486545,0.00027999206,0.00033904932,0.00076458574,0.00019604451,0.023809563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991048,0.00046031276,0.00003693498,0.00014960466,0.00012370755,0.00012454731],"domain_scores_gemma":[0.9970477,0.0022553375,0.00019181038,0.00012215057,0.00017429295,0.00020872094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022871764,0.0012539207,0.0023840284,0.0010043336,0.00062015123,0.0024477153,0.002294569,0.002357697,0.008627685],"category_scores_gemma":[0.004429793,0.001502287,0.0012124943,0.0019794172,0.001540934,0.002629347,0.0010950081,0.0016810282,0.00047372672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015703693,0.000070289425,0.0002463381,0.00025288234,0.0000810315,0.0001639642,0.000033962817,0.9510396,0.00074600434,0.03534467,0.0026446737,0.009219426],"study_design_scores_gemma":[0.00007477356,0.00007199755,0.00030589345,0.000026721664,0.000031198004,0.000065041386,0.000029187677,0.9499094,0.00030705525,0.047751445,0.0014039692,0.000023295692],"about_ca_topic_score_codex":0.005470369,"about_ca_topic_score_gemma":0.0060279197,"teacher_disagreement_score":0.008627685,"about_ca_system_score_codex":0.0018422586,"about_ca_system_score_gemma":0.0027124574,"threshold_uncertainty_score":0.028862476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08224071,0.0008870762,0.9090352,0.00050310674,0.00014120637,0.0001594927,0.00023295789,0.00041751095,0.006382729],"genre_scores_gemma":[0.6495849,0.00034709257,0.33789402,0.00017809191,0.00011235501,0.0005142509,0.0005183826,0.00017823448,0.010672678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993406,0.00035477369,0.000022520471,0.00008319335,0.00012225621,0.0000767167],"domain_scores_gemma":[0.99691004,0.0026184383,0.00011102004,0.000066177374,0.00021044486,0.000083960156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017369261,0.0008301538,0.0030025938,0.0014553033,0.000692285,0.0010056912,0.0022592356,0.0021326584,0.0050822934],"category_scores_gemma":[0.005496563,0.0011174786,0.0007747776,0.0015466493,0.0008964784,0.0015609916,0.0010322693,0.0012260624,0.00036568762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001505104,0.00006879581,0.00021478947,0.00004493601,0.000029540552,0.000018462097,0.000025866055,0.97264737,0.00021241973,0.005855035,0.0014072226,0.019325137],"study_design_scores_gemma":[0.00001537608,0.000011954627,0.000032569547,0.000002077694,0.000002541467,0.0000021363633,0.0000030653046,0.9983625,0.000032804935,0.0014529916,0.00008025747,0.0000016939719],"about_ca_topic_score_codex":0.014535955,"about_ca_topic_score_gemma":0.008811629,"teacher_disagreement_score":0.014535955,"about_ca_system_score_codex":0.0014228575,"about_ca_system_score_gemma":0.0015359136,"threshold_uncertainty_score":0.02890271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14313045,0.00012654526,0.85405445,0.00013271799,0.00007288072,0.0005894616,0.00016127343,0.00038772105,0.0013446235],"genre_scores_gemma":[0.8602164,0.00005988486,0.13821074,0.000035947964,0.000047222886,0.0005444646,0.00020215631,0.00004453058,0.00063861953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98479986,0.009994112,0.00058652984,0.0013565877,0.0025930717,0.00066986744],"domain_scores_gemma":[0.9300234,0.05049174,0.005311519,0.0036385034,0.009652257,0.00088266796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022599496,0.0010348468,0.0011246551,0.0015218484,0.0006342343,0.001928261,0.0011512098,0.0011019789,0.0026603877],"category_scores_gemma":[0.058657065,0.00068809994,0.000902064,0.0006782467,0.001541173,0.0013776873,0.0010985029,0.0010781772,0.00014027263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0085294945,0.0011225841,0.009174939,0.0003650125,0.00027332437,0.00014908808,0.00033066922,0.7254211,0.016161477,0.09263073,0.0012030461,0.14463861],"study_design_scores_gemma":[0.00022124936,0.0010594209,0.0036080698,0.000013192837,0.000058526763,0.000020447153,0.00002945898,0.98017544,0.0057509043,0.008622035,0.00039328734,0.000047898888],"about_ca_topic_score_codex":0.0026910538,"about_ca_topic_score_gemma":0.0016461327,"teacher_disagreement_score":0.022599496,"about_ca_system_score_codex":0.0020115948,"about_ca_system_score_gemma":0.003771359,"threshold_uncertainty_score":0.119519055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7367115,0.00091174815,0.25172716,0.00031534894,0.00010392615,0.00012965532,0.00006894642,0.00024867282,0.009783152],"genre_scores_gemma":[0.9665353,0.00014302933,0.031549823,0.00002460572,0.000011746195,0.00005907826,0.000031109645,0.000028012024,0.0016172436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997062,0.000085047606,0.000013165868,0.00006281816,0.00007888462,0.000053877557],"domain_scores_gemma":[0.99958414,0.00020665002,0.000095909185,0.000023082945,0.00006757475,0.000022678529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010795147,0.0007349026,0.0009642651,0.000549437,0.0003846971,0.0010381853,0.00058371865,0.000877855,0.0010114359],"category_scores_gemma":[0.0014218416,0.0005202259,0.0006828028,0.0004544768,0.0004739205,0.0006408994,0.0006613838,0.0006587028,0.00012613795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024367722,0.00018123047,0.00030667856,0.00006915963,0.000038103968,0.000048021844,0.000021596086,0.96542215,0.016392253,0.0028809975,0.00014116101,0.014254983],"study_design_scores_gemma":[0.000031638883,0.00018251305,0.00015993253,0.0000031904904,0.0000139778285,0.00000858516,0.0000054301004,0.991025,0.007912012,0.00045540926,0.00019524516,0.0000072500043],"about_ca_topic_score_codex":0.0019322195,"about_ca_topic_score_gemma":0.0020080379,"teacher_disagreement_score":0.0019322195,"about_ca_system_score_codex":0.00093100587,"about_ca_system_score_gemma":0.0011487461,"threshold_uncertainty_score":0.0067549944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018656595,0.00037207527,0.9742268,0.00014439593,0.00005386669,0.00014139566,0.00009830124,0.00034393554,0.0059627155],"genre_scores_gemma":[0.20085312,0.0003551067,0.7949843,0.000110199275,0.00006345508,0.00039387855,0.00024272219,0.00013775293,0.0028594835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914,0.000328669,0.00003932398,0.0000923692,0.00027888242,0.000120799115],"domain_scores_gemma":[0.9966254,0.0025797468,0.0001954512,0.00020152707,0.00032209556,0.00007575369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020458028,0.0011176851,0.0012750013,0.0016267046,0.00078112003,0.00123405,0.0014221789,0.0018037021,0.0057156654],"category_scores_gemma":[0.0064326054,0.00090327126,0.0010071142,0.0015112917,0.0010930154,0.0011774971,0.0010346693,0.0015401931,0.0005657463],"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.00009709052,0.00007479926,0.00018725435,0.00008438902,0.000017155677,0.000022885179,0.000045762525,0.92615813,0.00059105584,0.012317051,0.0009156045,0.05948874],"study_design_scores_gemma":[0.000047440055,0.00004185576,0.000074684234,0.000012263455,0.000008398034,0.0000105591835,0.000015134423,0.98988974,0.00024528312,0.009090453,0.00055703014,0.000007201946],"about_ca_topic_score_codex":0.008754562,"about_ca_topic_score_gemma":0.009376166,"teacher_disagreement_score":0.008754562,"about_ca_system_score_codex":0.0013769259,"about_ca_system_score_gemma":0.0028750587,"threshold_uncertainty_score":0.019120812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82341146,0.00036073642,0.07580655,0.0010109252,0.00006924672,0.00011131153,0.000118999655,0.0002760418,0.09883476],"genre_scores_gemma":[0.99644166,0.00003783566,0.0020852895,0.000022119302,0.0000061065693,0.000013022119,0.00002074192,0.00002209904,0.001351136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982438,0.0005593976,0.00006692718,0.00019001507,0.0004281198,0.0005117028],"domain_scores_gemma":[0.9947918,0.0022935087,0.0008395833,0.000322704,0.0010390566,0.0007132895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031154882,0.0003749668,0.0004044408,0.0007721349,0.0012389689,0.005856795,0.00074869016,0.001182825,0.0041233497],"category_scores_gemma":[0.012726338,0.0003725285,0.0001904945,0.00058173225,0.0007701254,0.0027389056,0.0016842876,0.00126156,0.001205604],"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.0029729535,0.00064003334,0.0449968,0.00024468612,0.00008788302,0.0012598203,0.006098871,0.19015446,0.031710308,0.4958128,0.008223095,0.21779831],"study_design_scores_gemma":[0.00017141677,0.00124771,0.09230855,0.00021206788,0.00008673386,0.0007563789,0.010376725,0.43956438,0.033636354,0.40444702,0.016994439,0.00019821966],"about_ca_topic_score_codex":0.0012586232,"about_ca_topic_score_gemma":0.0015637066,"teacher_disagreement_score":0.005856795,"about_ca_system_score_codex":0.0017177584,"about_ca_system_score_gemma":0.0013920293,"threshold_uncertainty_score":0.016476512},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28629807,0.0009447108,0.70423126,0.0013582446,0.00006495401,0.00026119463,0.00031230837,0.00034042718,0.0061888234],"genre_scores_gemma":[0.9231136,0.0001589776,0.07547683,0.00013298716,0.00007797793,0.00014465483,0.00025068497,0.0000697798,0.0005745407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9711783,0.016437227,0.0025156785,0.0021832364,0.00637235,0.0013132328],"domain_scores_gemma":[0.46605298,0.50041664,0.013588114,0.010305832,0.0076647345,0.0019717012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.051781118,0.0013517889,0.0033198916,0.008385991,0.0016061844,0.007693248,0.00286059,0.0038947097,0.0034597388],"category_scores_gemma":[0.26881558,0.0015744824,0.0029141228,0.004735299,0.0044645574,0.010561236,0.0045595774,0.0031104763,0.0003770767],"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.004087332,0.0006464247,0.0111091435,0.00080627477,0.0008680024,0.00046088206,0.000914915,0.73077816,0.0044071637,0.14616945,0.0009801275,0.098772205],"study_design_scores_gemma":[0.00012966787,0.00048299783,0.003488513,0.00013611435,0.00022832853,0.00010833463,0.00013268716,0.8100322,0.0023818384,0.18250404,0.00026429497,0.000111109395],"about_ca_topic_score_codex":0.0019904266,"about_ca_topic_score_gemma":0.0006717655,"teacher_disagreement_score":0.051781118,"about_ca_system_score_codex":0.0031548415,"about_ca_system_score_gemma":0.0014523538,"threshold_uncertainty_score":0.273848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9996208,0.00007561532,0.000109292,0.000021079353,0.0000017857232,0.00001235459,0.000019150772,0.0000011456236,0.00013875618],"genre_scores_gemma":[0.9995882,0.000050618117,0.0001894509,0.000008508693,0.0000024100857,0.000011160386,0.00001986621,6.459921e-7,0.00012912002],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992944,0.00042892896,0.00003246059,0.000048960257,0.000074582684,0.000120735305],"domain_scores_gemma":[0.99722654,0.0015103094,0.0007130214,0.0001271657,0.00022544667,0.00019754555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001399475,0.00042201317,0.00027840602,0.00033956164,0.00033357283,0.0004954828,0.00032944907,0.00045399016,0.0016745189],"category_scores_gemma":[0.0046192547,0.00015844694,0.0006571681,0.00026916512,0.0003165618,0.00034816883,0.00044638643,0.00031400868,0.00013774628],"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.016504273,0.016584594,0.84671885,0.0005985703,0.00096670596,0.00040120183,0.0015591737,0.020332796,0.029059941,0.00048391064,0.0002017939,0.066588216],"study_design_scores_gemma":[0.00018202554,0.028860083,0.9466527,0.000060222952,0.0006725735,0.00008173194,0.001759642,0.010808462,0.010160405,0.00037504802,0.0003620048,0.000024945146],"about_ca_topic_score_codex":0.0050620367,"about_ca_topic_score_gemma":0.0072890394,"teacher_disagreement_score":0.0050620367,"about_ca_system_score_codex":0.0005424537,"about_ca_system_score_gemma":0.0006972243,"threshold_uncertainty_score":0.010065138},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27215257,0.002300257,0.713767,0.0025750387,0.00021761093,0.000112082336,0.00021570157,0.0005369516,0.0081228195],"genre_scores_gemma":[0.9876173,0.00043351197,0.010204807,0.00010563763,0.00014124773,0.000045754725,0.000029112332,0.000053786833,0.0013687627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996167,0.0018852542,0.00012727395,0.00049181597,0.0004606031,0.00086797314],"domain_scores_gemma":[0.970021,0.025741398,0.001506384,0.00075210416,0.0009299797,0.0010491431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006248855,0.0016750229,0.003047167,0.0014018328,0.0016635751,0.004210203,0.0034774968,0.0024794056,0.001932327],"category_scores_gemma":[0.02743568,0.001885672,0.0008206762,0.0025409127,0.0031885372,0.0050384626,0.0027158158,0.002093419,0.00030113698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002828511,0.000058731406,0.00040843015,0.00007033674,0.000036866946,0.000103000166,0.00009740474,0.95625603,0.0014950393,0.036508262,0.0006170558,0.004065942],"study_design_scores_gemma":[0.000017650964,0.00002444406,0.000099725716,0.000007645138,0.000014239612,0.0000186124,0.000017868551,0.97587615,0.00025363883,0.02356389,0.00009565145,0.000010531221],"about_ca_topic_score_codex":0.0043326165,"about_ca_topic_score_gemma":0.0030169794,"teacher_disagreement_score":0.006248855,"about_ca_system_score_codex":0.005113845,"about_ca_system_score_gemma":0.0021651953,"threshold_uncertainty_score":0.037103653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32925,0.00084727845,0.57131207,0.00360636,0.00006957028,0.00025251304,0.00025532907,0.00008572647,0.094321124],"genre_scores_gemma":[0.97896564,0.00041813293,0.012378423,0.00009049988,0.00006405449,0.00013257394,0.000049778562,0.000028019116,0.007872889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985109,0.0008237372,0.000039856695,0.0001243755,0.00023265161,0.00026844186],"domain_scores_gemma":[0.9941527,0.004060187,0.0007018187,0.0002805464,0.00045360855,0.00035108006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028357708,0.0007606753,0.00086826016,0.001010388,0.0011543548,0.002534557,0.0019234465,0.001487545,0.00863214],"category_scores_gemma":[0.010087434,0.0005994693,0.0009158141,0.0012253842,0.0022575294,0.004105043,0.0015587066,0.0014788623,0.00043704084],"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.000065982975,0.00008162828,0.00035885838,0.000058892907,0.000024612857,0.00009307443,0.00024770212,0.3277842,0.0004263585,0.66650975,0.0009811891,0.003367827],"study_design_scores_gemma":[0.000053360098,0.000041124433,0.00033145738,0.00002048044,0.00001699709,0.000030860872,0.00021014483,0.6148421,0.00014024165,0.38314888,0.00115066,0.000013658249],"about_ca_topic_score_codex":0.0052613565,"about_ca_topic_score_gemma":0.0038495648,"teacher_disagreement_score":0.00863214,"about_ca_system_score_codex":0.0028493826,"about_ca_system_score_gemma":0.0023734765,"threshold_uncertainty_score":0.028877437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026951197,0.0022415945,0.9915507,0.00046644115,0.00010447123,0.000016352198,0.000023122793,0.0001309557,0.002771316],"genre_scores_gemma":[0.24047258,0.00939317,0.7371466,0.00029686614,0.0006543234,0.00023362234,0.0001727692,0.0003271434,0.011303015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950266,0.0001733819,0.000024047427,0.00010162652,0.00015116509,0.000047052054],"domain_scores_gemma":[0.9994654,0.00026379756,0.000064331485,0.00007034973,0.00010835093,0.000027789316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011526633,0.00127267,0.0009910634,0.0007300333,0.0004562833,0.0022555217,0.00203316,0.001260512,0.0029783908],"category_scores_gemma":[0.0025663504,0.0006201495,0.00063496124,0.0020771173,0.0011986073,0.0029612754,0.00085033354,0.0017428178,0.0007712969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086764434,0.00007247207,0.00017970792,0.00026526226,0.000041725223,0.000044435717,0.00007751678,0.63628966,0.0021350381,0.23637655,0.005538374,0.11889248],"study_design_scores_gemma":[0.000015237917,0.000017218052,0.000041510288,0.000013734655,0.000009864872,0.000033875087,0.000017499307,0.89481825,0.0005795049,0.10060107,0.0038443664,0.00000783382],"about_ca_topic_score_codex":0.0022874898,"about_ca_topic_score_gemma":0.002134189,"teacher_disagreement_score":0.0029783908,"about_ca_system_score_codex":0.0011322384,"about_ca_system_score_gemma":0.00097282976,"threshold_uncertainty_score":0.009963691},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25042856,0.0018608641,0.7406671,0.0009251104,0.000816631,0.000074715485,0.00030298886,0.0010955189,0.003828451],"genre_scores_gemma":[0.9704155,0.0005126334,0.026516778,0.00011583201,0.00023165508,0.000025890417,0.000107600754,0.00010262422,0.0019714658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973792,0.0009862017,0.00012215435,0.00040550146,0.00061994407,0.00048710298],"domain_scores_gemma":[0.97637254,0.015955662,0.002313244,0.0028112258,0.0015730773,0.00097432925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076194177,0.0010784997,0.0012263159,0.0012230346,0.0009312508,0.002202258,0.0030624429,0.0017253335,0.002124925],"category_scores_gemma":[0.031277496,0.00083199976,0.00094435085,0.0023461806,0.00077083585,0.004194051,0.0012997845,0.0026930112,0.00033352288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011287497,0.00011750545,0.005059528,0.00004000374,0.000076797915,0.00006894804,0.00004108188,0.9541301,0.0014961507,0.013222139,0.00067337666,0.024961423],"study_design_scores_gemma":[0.000004788192,0.000015428168,0.0005893996,0.0000031035772,0.000024374003,0.000008646276,0.0000052754467,0.99609536,0.00028408848,0.0028323727,0.00013019163,0.0000070143656],"about_ca_topic_score_codex":0.018640468,"about_ca_topic_score_gemma":0.01508962,"teacher_disagreement_score":0.018640468,"about_ca_system_score_codex":0.003059048,"about_ca_system_score_gemma":0.005033689,"threshold_uncertainty_score":0.04029578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95713884,0.0014277722,0.027203308,0.0011159759,0.00011336716,0.00034470746,0.0017504538,0.0002584999,0.010647012],"genre_scores_gemma":[0.99552506,0.00033595218,0.0020157169,0.0000799014,0.000017948907,0.000043583605,0.00026143604,0.000026534839,0.0016938737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973003,0.0015917914,0.00010420007,0.00027445052,0.00020682007,0.00052245345],"domain_scores_gemma":[0.96328074,0.033541948,0.001174956,0.00077220134,0.00093223376,0.00029793053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070018456,0.0013631008,0.0015138657,0.0022497014,0.00056131394,0.0024941924,0.001731486,0.002500382,0.00638892],"category_scores_gemma":[0.019218653,0.0013399433,0.0037028578,0.0019293783,0.0013117096,0.003796179,0.0014464271,0.0024960437,0.00030139866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010093583,0.00028000242,0.0035587554,0.00023962556,0.00026177766,0.0003421914,0.000059791324,0.984006,0.0018360775,0.0034513797,0.00084450457,0.004110589],"study_design_scores_gemma":[0.000120123645,0.00072653824,0.006095687,0.000045427652,0.0007354912,0.00016203377,0.0002497661,0.9836736,0.0031130114,0.004418669,0.00055647636,0.0001032914],"about_ca_topic_score_codex":0.024750395,"about_ca_topic_score_gemma":0.01029172,"teacher_disagreement_score":0.024750395,"about_ca_system_score_codex":0.004359434,"about_ca_system_score_gemma":0.0011006367,"threshold_uncertainty_score":0.049212635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36075416,0.00023325613,0.63340664,0.00017197785,0.000045444,0.00006183166,0.000041088442,0.00018955779,0.005096085],"genre_scores_gemma":[0.97449976,0.000031488787,0.024613762,0.00001570264,0.0000068666523,0.000046926933,0.00003498432,0.00001231241,0.00073828263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985135,0.00004159732,0.000005030586,0.000038883314,0.00003516914,0.000027968965],"domain_scores_gemma":[0.9997253,0.00013252631,0.000053849304,0.000022051478,0.000041959644,0.000024253433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004126291,0.00052226015,0.0005691769,0.0003152394,0.00037402802,0.00042598488,0.00045528245,0.0004523445,0.00073205115],"category_scores_gemma":[0.0009330715,0.000248578,0.00048380755,0.00029651858,0.0003319014,0.00039840862,0.00066050596,0.00041382783,0.000086491564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009722298,0.000039293325,0.0006999474,0.000029316676,0.00003166248,0.000046210058,0.000075259326,0.9685348,0.0049894517,0.0008013989,0.00017906465,0.024476245],"study_design_scores_gemma":[0.000010147514,0.000034257857,0.00022541765,0.0000014954244,0.00000609378,0.000005220415,0.000009033936,0.9990771,0.0003379508,0.00019998952,0.00009112701,0.0000020709606],"about_ca_topic_score_codex":0.0053683734,"about_ca_topic_score_gemma":0.0058843647,"teacher_disagreement_score":0.0053683734,"about_ca_system_score_codex":0.00043290167,"about_ca_system_score_gemma":0.00057697814,"threshold_uncertainty_score":0.010674298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8069918,0.00067655207,0.17147584,0.0026580968,0.0003424046,0.00018224276,0.00017000554,0.0003747833,0.01712833],"genre_scores_gemma":[0.9940063,0.000074217794,0.0051713567,0.00004304459,0.000063516716,0.000018494364,0.00003800882,0.00002039287,0.000564679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964014,0.0014818766,0.0002216921,0.000586389,0.0005262835,0.0007823338],"domain_scores_gemma":[0.9702462,0.022581875,0.0027572366,0.0008976351,0.0019137973,0.0016032811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009099696,0.000993564,0.0023011884,0.0011658531,0.0011517621,0.0083178785,0.0019407211,0.0028245018,0.0032873906],"category_scores_gemma":[0.031956527,0.0017641574,0.0004588536,0.001891528,0.0017527989,0.0059477445,0.0021732915,0.002116807,0.0004872323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024253358,0.0007428074,0.008312295,0.00012302268,0.0001627889,0.00087932457,0.0006000595,0.8960819,0.007954199,0.033698283,0.0021835195,0.046836507],"study_design_scores_gemma":[0.00012530372,0.00015615654,0.0018493937,0.0000054067873,0.000044656947,0.000056417983,0.00018734945,0.97538835,0.001101242,0.020612216,0.000434603,0.00003888353],"about_ca_topic_score_codex":0.0035309116,"about_ca_topic_score_gemma":0.0040873983,"teacher_disagreement_score":0.009099696,"about_ca_system_score_codex":0.0014370573,"about_ca_system_score_gemma":0.0033842528,"threshold_uncertainty_score":0.048124373},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027232436,0.0006720019,0.9671243,0.00155787,0.00024382483,0.000117500545,0.000338649,0.00047287552,0.0022406303],"genre_scores_gemma":[0.77346486,0.0013907561,0.20755354,0.0009747671,0.0010593386,0.00039176227,0.00086315896,0.00048369353,0.013818059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938776,0.0031744728,0.00030569642,0.000924838,0.0007146076,0.001002897],"domain_scores_gemma":[0.8931278,0.089036904,0.0057906914,0.004516908,0.005166572,0.0023612278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025344135,0.0027296518,0.0052046305,0.0021581508,0.0014156933,0.0034633859,0.0052783187,0.0036568034,0.008974107],"category_scores_gemma":[0.07003237,0.0021979054,0.002523838,0.0025613836,0.003315831,0.007728474,0.0045034457,0.004967015,0.00066345703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003519765,0.00016554442,0.0021404016,0.00014671906,0.000114683695,0.0002502802,0.00018799886,0.7788819,0.00046000045,0.19409676,0.0041830484,0.019020667],"study_design_scores_gemma":[0.00004329572,0.000031526015,0.00012793523,0.000012524513,0.000024502075,0.000021306296,0.000020655145,0.9170768,0.00008938579,0.08226171,0.00027254014,0.000017738763],"about_ca_topic_score_codex":0.013405141,"about_ca_topic_score_gemma":0.010338764,"teacher_disagreement_score":0.025344135,"about_ca_system_score_codex":0.0035549542,"about_ca_system_score_gemma":0.0049958355,"threshold_uncertainty_score":0.13403422},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019347528,0.00046273615,0.9748443,0.00015391807,0.0000162217,0.00006448981,0.000080740836,0.000037079433,0.0049930345],"genre_scores_gemma":[0.68287545,0.0012096679,0.30921865,0.000088960594,0.000053979147,0.0005657395,0.00032652484,0.00010985292,0.005551184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980446,0.0010488158,0.00010546035,0.0001841355,0.00036705882,0.0002500195],"domain_scores_gemma":[0.9897473,0.009077789,0.00029111013,0.00026740684,0.00050716073,0.000109351364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061303475,0.0014625542,0.0023058502,0.0022467053,0.00082278496,0.0029852323,0.0011832094,0.00206923,0.004378427],"category_scores_gemma":[0.013446258,0.0008717166,0.0024784422,0.0019256118,0.0013283209,0.002166565,0.0021354447,0.0024612455,0.0006051712],"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.00005024859,0.000071977025,0.0004517343,0.00018267684,0.00008270548,0.0000916789,0.00008296523,0.8695496,0.0010254036,0.10957964,0.00029564564,0.018535886],"study_design_scores_gemma":[0.0000093923045,0.000016523369,0.00014886983,0.000023738146,0.000017595747,0.000015390653,0.000022646647,0.9498711,0.0005347426,0.048877906,0.00045389918,0.000008225674],"about_ca_topic_score_codex":0.004415187,"about_ca_topic_score_gemma":0.0026907225,"teacher_disagreement_score":0.0061303475,"about_ca_system_score_codex":0.0026429498,"about_ca_system_score_gemma":0.0025788133,"threshold_uncertainty_score":0.032420814},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004933437,0.000106607265,0.9986578,0.00004873037,0.000017143726,0.000025212146,0.00003378797,0.000034677778,0.0005826485],"genre_scores_gemma":[0.036193725,0.00043526394,0.9610015,0.00008921753,0.00008351427,0.00027636628,0.00023730315,0.000085970925,0.0015972523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997042,0.0014348313,0.00020462807,0.00033668845,0.0007703653,0.0002115322],"domain_scores_gemma":[0.9977118,0.0013510004,0.000106668005,0.00025001887,0.0004772768,0.00010316348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040998105,0.0015520059,0.002008506,0.0019060948,0.0007490002,0.002266222,0.0018944569,0.0014137722,0.0054813796],"category_scores_gemma":[0.006154103,0.0009890656,0.0039563617,0.0033030123,0.00082593324,0.002674855,0.0020158428,0.0030837492,0.0015878842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073429444,0.00014394181,0.00055070716,0.0006367142,0.00028844166,0.00023008419,0.00038207465,0.40317222,0.0048574763,0.34134802,0.006492714,0.24182409],"study_design_scores_gemma":[0.000021038411,0.000044700348,0.00018071164,0.00010924336,0.00007154448,0.000113823495,0.000032353648,0.68728113,0.0005299209,0.30595213,0.005636158,0.000027201304],"about_ca_topic_score_codex":0.002085336,"about_ca_topic_score_gemma":0.002788653,"teacher_disagreement_score":0.0054813796,"about_ca_system_score_codex":0.0011354802,"about_ca_system_score_gemma":0.0016631024,"threshold_uncertainty_score":0.021682143},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05848368,0.0011301683,0.8921019,0.0029462248,0.00018606671,0.0000659878,0.00023522339,0.00017888777,0.04467182],"genre_scores_gemma":[0.90137726,0.0014617133,0.06395294,0.00040277588,0.00026310427,0.00023487101,0.00024017975,0.00010458092,0.03196252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994765,0.00019611335,0.000030522446,0.00007334317,0.00014491084,0.00007868341],"domain_scores_gemma":[0.99873894,0.00063025113,0.00017595051,0.00006942528,0.00025322573,0.00013219875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010956691,0.000779752,0.0013833295,0.0012790705,0.0007871643,0.0034154754,0.00187619,0.0028628362,0.0067692925],"category_scores_gemma":[0.0046457606,0.00066710816,0.0009851918,0.0015858194,0.002117182,0.0031605435,0.0020505395,0.0022808306,0.00096282194],"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.0000126071645,0.000031802163,0.00014772192,0.000037325484,0.0000131579745,0.000086334294,0.0000765264,0.10411558,0.0005217296,0.89145905,0.00072962034,0.0027686239],"study_design_scores_gemma":[0.000013055881,0.000014028078,0.00005595339,0.0000107573,0.000008818622,0.00005615942,0.000024925179,0.63683784,0.00008970982,0.36202106,0.0008513837,0.000016314592],"about_ca_topic_score_codex":0.002796203,"about_ca_topic_score_gemma":0.0015131263,"teacher_disagreement_score":0.0067692925,"about_ca_system_score_codex":0.0013664496,"about_ca_system_score_gemma":0.0017863314,"threshold_uncertainty_score":0.022645533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067143743,0.00043672332,0.9814612,0.00075310643,0.00011188228,0.000034038963,0.00007554792,0.00008313489,0.010329919],"genre_scores_gemma":[0.4930728,0.0020672623,0.45378128,0.00032656058,0.00059850974,0.00037827357,0.00038378703,0.00029760884,0.04909405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929154,0.00031887728,0.000029499808,0.00011659369,0.00016765652,0.000075779004],"domain_scores_gemma":[0.9985421,0.0011165359,0.000080996826,0.000043191718,0.00012072176,0.000096563126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015628828,0.0011247966,0.0013976623,0.0010127737,0.000687155,0.0025273329,0.0022062673,0.002588756,0.008222026],"category_scores_gemma":[0.0050665922,0.0014809036,0.0014394213,0.0015055033,0.0013953841,0.002971058,0.0012847767,0.003003435,0.00060328806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025474992,0.00007055692,0.00016998421,0.00004577834,0.00003649357,0.00009888848,0.000054319906,0.6937414,0.00040040942,0.28586513,0.0021262113,0.01736539],"study_design_scores_gemma":[0.000013720072,0.0000102859785,0.000046231384,0.0000080477885,0.000011842837,0.000018141023,0.000008891286,0.91046256,0.00007054468,0.08769733,0.0016439182,0.000008497371],"about_ca_topic_score_codex":0.0066214935,"about_ca_topic_score_gemma":0.0058575473,"teacher_disagreement_score":0.008222026,"about_ca_system_score_codex":0.0013604447,"about_ca_system_score_gemma":0.0015190786,"threshold_uncertainty_score":0.027505398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047429907,0.0009425532,0.97951686,0.0006177516,0.00007431735,0.000036421672,0.00009622187,0.000034632307,0.013938279],"genre_scores_gemma":[0.4740341,0.011126113,0.47482854,0.00076193275,0.0013356544,0.0005561656,0.00066527945,0.0002918807,0.036400303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697924,0.0015231799,0.00012568763,0.00043163841,0.00073513185,0.00020518502],"domain_scores_gemma":[0.996214,0.0023615297,0.00032201383,0.00041286202,0.0005016503,0.00018796127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036003615,0.0021755632,0.0023999687,0.002185388,0.0010748678,0.004964595,0.004391588,0.003881328,0.0069758845],"category_scores_gemma":[0.009465502,0.0016099564,0.0026830938,0.0037880298,0.0034982786,0.010048706,0.0031762726,0.0028384756,0.00074063794],"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.00001595446,0.00002614684,0.0002789084,0.00014571956,0.00004188119,0.00009337852,0.00009045595,0.23679332,0.00023571172,0.7493966,0.0019040329,0.010977871],"study_design_scores_gemma":[0.00001678888,0.000019358318,0.00009603314,0.000033730325,0.000031407842,0.00008585922,0.000043468375,0.30761454,0.000110915615,0.6869152,0.005017954,0.000014753545],"about_ca_topic_score_codex":0.0041147256,"about_ca_topic_score_gemma":0.00386048,"teacher_disagreement_score":0.0069758845,"about_ca_system_score_codex":0.0027996316,"about_ca_system_score_gemma":0.0019229613,"threshold_uncertainty_score":0.023336649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95773476,0.00064940326,0.0012733724,0.0016793977,0.00005220667,0.000059977065,0.000063065876,0.00006354754,0.03842429],"genre_scores_gemma":[0.9975497,0.00018818582,0.0003786919,0.00024751874,0.00004454876,0.00001710807,0.000039454884,0.000011659416,0.0015230606],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9973054,0.00092854205,0.00013478851,0.00030302207,0.0005761321,0.0007521284],"domain_scores_gemma":[0.9793971,0.010453349,0.0042684935,0.002015372,0.0013087931,0.0025568206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039960206,0.00078994123,0.0011668841,0.001481927,0.0012985516,0.0037042124,0.0011659553,0.0038249756,0.02157535],"category_scores_gemma":[0.015621203,0.0010318884,0.0014692617,0.0011242239,0.0026432902,0.0031237702,0.0041084033,0.0018022971,0.0023781373],"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.010116096,0.009479906,0.6806835,0.00079911266,0.00083660235,0.007536024,0.0062351753,0.00289989,0.039537553,0.028259268,0.007641245,0.20597564],"study_design_scores_gemma":[0.001117019,0.0029088333,0.9040934,0.00033541216,0.0015818747,0.008265406,0.0077519068,0.0037275502,0.0077688186,0.05650288,0.0057705077,0.00017640617],"about_ca_topic_score_codex":0.0015887568,"about_ca_topic_score_gemma":0.0018749642,"teacher_disagreement_score":0.02157535,"about_ca_system_score_codex":0.00070452614,"about_ca_system_score_gemma":0.0011949263,"threshold_uncertainty_score":0.072176754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15893677,0.003275611,0.7452126,0.0054225475,0.00057084183,0.00029964632,0.0051808795,0.0010667862,0.08003437],"genre_scores_gemma":[0.92201805,0.0013182048,0.03353226,0.00036273702,0.00024288692,0.00027859976,0.0015874191,0.00023887902,0.040420957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862707,0.0005414401,0.000068953865,0.00022718444,0.00017780764,0.000357503],"domain_scores_gemma":[0.9959881,0.0026860354,0.0003761519,0.00023870642,0.00038741666,0.00032364935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019026216,0.0023352592,0.002952467,0.0014820345,0.00088731654,0.0043381783,0.00493772,0.003630865,0.011951758],"category_scores_gemma":[0.0075501096,0.002295246,0.0018278133,0.0025225864,0.0019964438,0.004928138,0.0021719497,0.0024951904,0.0013860493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014365953,0.000055938435,0.00016862684,0.000105540086,0.000027822913,0.00011605347,0.00004432807,0.90049076,0.00024386977,0.09385327,0.001764573,0.0029856048],"study_design_scores_gemma":[0.00005284878,0.00003131566,0.000074381605,0.000018000572,0.000021304304,0.000023906727,0.000018449176,0.9370715,0.000096661795,0.06163812,0.0009358849,0.000017681488],"about_ca_topic_score_codex":0.014048012,"about_ca_topic_score_gemma":0.0073079476,"teacher_disagreement_score":0.014048012,"about_ca_system_score_codex":0.0032621627,"about_ca_system_score_gemma":0.0023034425,"threshold_uncertainty_score":0.039982557},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0921265,0.0017869299,0.88636035,0.0024773234,0.00062230945,0.00019535504,0.0014090588,0.00023547534,0.0147867855],"genre_scores_gemma":[0.79074925,0.0024230068,0.17572558,0.00033868576,0.0007360424,0.00039091852,0.0014135297,0.00025902208,0.027963974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989538,0.0003372697,0.00003381213,0.0003719731,0.00014687421,0.00015625717],"domain_scores_gemma":[0.9983656,0.0010994816,0.00016169563,0.000082289815,0.00012353659,0.00016742578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017487521,0.0014851488,0.0022815382,0.00093895657,0.00089865533,0.0021850138,0.0028761758,0.0025989693,0.0064448104],"category_scores_gemma":[0.0044368897,0.0012019073,0.0010560427,0.0024911903,0.001304803,0.0027667563,0.0013974999,0.0017788707,0.00082506175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016449438,0.000060275303,0.0002616872,0.0001708394,0.00005516318,0.00013889992,0.000047229303,0.94122905,0.0006086,0.03587458,0.0036684466,0.01772069],"study_design_scores_gemma":[0.000044851146,0.000032117867,0.00014705831,0.000008121233,0.000017409155,0.000048055204,0.00003405097,0.96399075,0.00021942635,0.03395927,0.0014879066,0.000010946966],"about_ca_topic_score_codex":0.006060417,"about_ca_topic_score_gemma":0.0041297753,"teacher_disagreement_score":0.0064448104,"about_ca_system_score_codex":0.0021359427,"about_ca_system_score_gemma":0.00212851,"threshold_uncertainty_score":0.021560073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022009661,0.0006898856,0.95307374,0.0008493785,0.00020730503,0.00021830597,0.0007512034,0.00015177496,0.02204879],"genre_scores_gemma":[0.31649464,0.000937771,0.6531709,0.00051404774,0.00044931477,0.0009645384,0.0012573169,0.00060439593,0.025607133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991574,0.0003613228,0.00003313339,0.00013899562,0.00017081448,0.00013837345],"domain_scores_gemma":[0.9982882,0.0012444856,0.00013797345,0.000075412536,0.00012921765,0.00012468215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017362525,0.0018294392,0.0019743934,0.0011731152,0.0007001601,0.002855141,0.0027399294,0.0031655142,0.0149770165],"category_scores_gemma":[0.0050925747,0.0016275157,0.0015347551,0.0016304486,0.0012127571,0.0024602907,0.0022658242,0.0020329035,0.0010750679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064889675,0.00006175957,0.00023027732,0.00022035016,0.00003517834,0.00013487267,0.000056129546,0.91637415,0.0005418631,0.066078395,0.003683675,0.012518523],"study_design_scores_gemma":[0.000015309037,0.000019429921,0.000041454095,0.000022950879,0.000008566839,0.000024608755,0.000032184817,0.9787088,0.00013509295,0.019590948,0.00139448,0.0000062570566],"about_ca_topic_score_codex":0.004619656,"about_ca_topic_score_gemma":0.0036631166,"teacher_disagreement_score":0.0149770165,"about_ca_system_score_codex":0.0013465438,"about_ca_system_score_gemma":0.0011343387,"threshold_uncertainty_score":0.05010307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87551093,0.00036400207,0.11073203,0.0006528137,0.000029825787,0.00015372375,0.0008003213,0.00094615505,0.01081026],"genre_scores_gemma":[0.95273155,0.00018901016,0.04594186,0.000022666416,0.0000074974223,0.00004701269,0.0002843172,0.00001922412,0.00075680856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885356,0.0006675462,0.00006345164,0.000061804414,0.00029966215,0.000053952794],"domain_scores_gemma":[0.9952598,0.003776382,0.00032257516,0.00016730207,0.0003795789,0.00009434636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018021342,0.0006613491,0.00046388392,0.0031967894,0.0004516287,0.0019507209,0.00047147606,0.00078118074,0.001753646],"category_scores_gemma":[0.0065274304,0.00034072335,0.00055027194,0.0015386121,0.00047601538,0.001972943,0.00083880866,0.00033852697,0.00019233364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081121066,0.0002804758,0.084450305,0.00018073975,0.00039055911,0.0004590703,0.0005731422,0.7978824,0.0050293496,0.012666667,0.0014072114,0.09586897],"study_design_scores_gemma":[0.000040273375,0.00015299095,0.008327268,0.000026973054,0.00009244083,0.00012795068,0.0007035939,0.97565514,0.00271703,0.01033558,0.0017913178,0.000029415944],"about_ca_topic_score_codex":0.01085302,"about_ca_topic_score_gemma":0.0077496124,"teacher_disagreement_score":0.01085302,"about_ca_system_score_codex":0.0011844244,"about_ca_system_score_gemma":0.0008704255,"threshold_uncertainty_score":0.021579683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09411089,0.0020923892,0.88583326,0.0006436766,0.00037168027,0.00032044327,0.00039102836,0.0019873043,0.014249246],"genre_scores_gemma":[0.2915547,0.00051322626,0.70225763,0.0002482497,0.00008279438,0.0003338371,0.00045990193,0.00036132243,0.0041883173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994929,0.00028429812,0.0000151446075,0.00005065231,0.000084998974,0.00007212084],"domain_scores_gemma":[0.99889094,0.00074468757,0.00006889261,0.00009165357,0.00015727952,0.00004644919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000965267,0.00064045185,0.0010119048,0.0011585386,0.0008596629,0.0009282221,0.0014789454,0.0016757526,0.007892832],"category_scores_gemma":[0.0037686261,0.00053177925,0.0007068043,0.0020259137,0.0007114209,0.0010722639,0.000827775,0.0008531038,0.0008974292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019363526,0.000116701915,0.00041773717,0.00013915126,0.000056000008,0.00008122196,0.00011031436,0.79573256,0.0013461938,0.011229313,0.006805682,0.18377152],"study_design_scores_gemma":[0.000066786255,0.000060127782,0.00014352294,0.000022890747,0.000021026515,0.000031156513,0.000035520963,0.9909135,0.0003355146,0.006614619,0.0017452578,0.000010045324],"about_ca_topic_score_codex":0.006464592,"about_ca_topic_score_gemma":0.006208031,"teacher_disagreement_score":0.007892832,"about_ca_system_score_codex":0.00088859326,"about_ca_system_score_gemma":0.0013491554,"threshold_uncertainty_score":0.026404083},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015531354,0.00054090604,0.98125196,0.00009075822,0.000015666626,0.000018363857,0.000026329559,0.0000204056,0.0025043322],"genre_scores_gemma":[0.7661233,0.001194419,0.23012638,0.00007720465,0.000052130086,0.0001674505,0.00009385465,0.00005732686,0.0021078347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9888573,0.0066818018,0.00058403786,0.0006054224,0.0027172368,0.00055420183],"domain_scores_gemma":[0.9857041,0.011128606,0.00069850066,0.001086488,0.001217353,0.00016497078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01291936,0.001126802,0.0024384,0.002229133,0.0006306875,0.0041527795,0.0013809496,0.0008008364,0.0011907421],"category_scores_gemma":[0.020178512,0.00080502394,0.0021018242,0.004250797,0.0021813202,0.0038917456,0.0032073245,0.0022253194,0.00022627984],"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.000104790546,0.000071176095,0.0008595119,0.00031598256,0.00021086147,0.000122058904,0.00019239387,0.44564813,0.0024675808,0.50274557,0.00032491016,0.046936926],"study_design_scores_gemma":[0.0000069162998,0.00005415333,0.00046297276,0.000051659674,0.000042775162,0.000060383718,0.000044809265,0.76767,0.0015271917,0.22926107,0.0007932936,0.00002476076],"about_ca_topic_score_codex":0.0012727889,"about_ca_topic_score_gemma":0.0010138153,"teacher_disagreement_score":0.01291936,"about_ca_system_score_codex":0.0021101877,"about_ca_system_score_gemma":0.0017883742,"threshold_uncertainty_score":0.06832498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052240184,0.00022551061,0.9924206,0.00016935062,0.000076274155,0.000073006406,0.000121324476,0.00022753024,0.0014622756],"genre_scores_gemma":[0.18466811,0.00050283363,0.80876493,0.00026930173,0.00020143068,0.00032138135,0.00075173454,0.00018869393,0.0043315827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993579,0.00026351147,0.000028332852,0.00009920308,0.00017577167,0.00007532103],"domain_scores_gemma":[0.998577,0.0008966487,0.00007560432,0.00009858198,0.00029209492,0.000059997543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009063623,0.0009180807,0.0012126196,0.0010500291,0.00062251877,0.0011667773,0.0014173533,0.0011524805,0.005771867],"category_scores_gemma":[0.0019946499,0.00062897854,0.0012796457,0.0017222458,0.0004698405,0.0009905287,0.0009804968,0.0015670798,0.0008820523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012528087,0.00021462885,0.00047298323,0.000259233,0.000079754434,0.00016827416,0.00008919067,0.7888876,0.0038696725,0.016992778,0.0075219446,0.18131869],"study_design_scores_gemma":[0.000011474751,0.000029643246,0.000051083418,0.0000073874194,0.000011640233,0.000022935903,0.000010620854,0.99400324,0.00032723503,0.0048807426,0.00063768285,0.0000063788084],"about_ca_topic_score_codex":0.0042758347,"about_ca_topic_score_gemma":0.0049946695,"teacher_disagreement_score":0.005771867,"about_ca_system_score_codex":0.0005730335,"about_ca_system_score_gemma":0.0010111203,"threshold_uncertainty_score":0.019308865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11451266,0.00079767255,0.87341005,0.0006409983,0.00015930334,0.0002005163,0.00007153441,0.0007264079,0.009480897],"genre_scores_gemma":[0.9241821,0.00019129617,0.07320063,0.00012271863,0.000038448703,0.00013800112,0.000030164632,0.000070765884,0.0020258243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994824,0.00018043688,0.000017565791,0.00012778354,0.00007555338,0.00011632118],"domain_scores_gemma":[0.9991097,0.00044507213,0.00014974999,0.00005289436,0.0001682723,0.00007427981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007379203,0.00093734055,0.0010255689,0.0009931594,0.00039434645,0.0009315778,0.00070724596,0.0012824185,0.005270713],"category_scores_gemma":[0.0034270885,0.00031595185,0.0003398646,0.0003959172,0.00061678194,0.0010432383,0.00057903246,0.0007863517,0.0007005629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018455262,0.001428533,0.0035679897,0.00096468616,0.0001653803,0.0002822823,0.00030373046,0.49119464,0.07275245,0.018417152,0.0062845745,0.40279308],"study_design_scores_gemma":[0.00021646869,0.00071361306,0.0033587012,0.00010368418,0.00008931079,0.00012821541,0.0003233884,0.9678173,0.014066537,0.010525729,0.0026040124,0.000053031697],"about_ca_topic_score_codex":0.0010489109,"about_ca_topic_score_gemma":0.0013407072,"teacher_disagreement_score":0.005270713,"about_ca_system_score_codex":0.00045953778,"about_ca_system_score_gemma":0.0013766388,"threshold_uncertainty_score":0.017632306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012460021,0.00016531342,0.98446554,0.00014830589,0.000044768545,0.000048297243,0.00005634438,0.0002756668,0.0023358096],"genre_scores_gemma":[0.3465164,0.00026691085,0.6477633,0.00012266528,0.000065645465,0.00042090123,0.00026444695,0.00021444188,0.004365206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919623,0.00038685367,0.000033122986,0.00011314408,0.00017962132,0.000090994756],"domain_scores_gemma":[0.9976921,0.0016585437,0.00017866414,0.00009460959,0.000314828,0.00006127522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018646562,0.0013427102,0.0015376674,0.0010610835,0.0006268851,0.0017391507,0.0018960823,0.0016373588,0.004355662],"category_scores_gemma":[0.004641324,0.0011636602,0.0012983698,0.0012529232,0.0007140488,0.0021000528,0.0012053548,0.0018896789,0.0005612596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017696479,0.000033391745,0.00007604846,0.000018786854,0.000008622536,0.000005083063,0.0000090215135,0.9875466,0.000102362006,0.001782539,0.00021752714,0.010182418],"study_design_scores_gemma":[0.0000029246446,0.000005930287,0.0000073612628,0.000001956655,0.0000020231969,7.748066e-7,0.0000024743615,0.9990646,0.00006996879,0.0007626181,0.00007830619,9.764052e-7],"about_ca_topic_score_codex":0.010042385,"about_ca_topic_score_gemma":0.009637179,"teacher_disagreement_score":0.010042385,"about_ca_system_score_codex":0.0010036238,"about_ca_system_score_gemma":0.0015160599,"threshold_uncertainty_score":0.019967914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08999046,0.000077328245,0.904378,0.00018743379,0.000032913085,0.00017738431,0.00017017382,0.000101747406,0.004884572],"genre_scores_gemma":[0.8429445,0.00009407508,0.15290348,0.0000598256,0.00002514083,0.0003382357,0.00017814015,0.00002217454,0.0034344145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996172,0.0024912253,0.00011992577,0.0004230368,0.00042185737,0.00037194998],"domain_scores_gemma":[0.99303955,0.0053586704,0.0004488771,0.00039857058,0.00044774628,0.00030663525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053738933,0.0011599753,0.0012654756,0.001159929,0.000765305,0.0021402654,0.0027529395,0.0029278037,0.0041612815],"category_scores_gemma":[0.011499951,0.0007040845,0.0010938898,0.0014653841,0.0012389737,0.0031604746,0.0011522109,0.0012846397,0.00043627532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019766642,0.0001860861,0.0008694624,0.00004550357,0.000057312453,0.00008690312,0.00008489179,0.88540447,0.0024069324,0.10246818,0.0004355927,0.007756971],"study_design_scores_gemma":[0.00001909024,0.000068255074,0.00020956522,0.00000383839,0.000012251192,0.000015154338,0.0000129471455,0.9845243,0.0001814852,0.014812646,0.00012833026,0.000012143339],"about_ca_topic_score_codex":0.0041072234,"about_ca_topic_score_gemma":0.0029443158,"teacher_disagreement_score":0.0053738933,"about_ca_system_score_codex":0.002284535,"about_ca_system_score_gemma":0.001660876,"threshold_uncertainty_score":0.02842021},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03255511,0.0015759364,0.96047354,0.00049363665,0.00025483634,0.00006293366,0.00026364936,0.00080573064,0.0035145273],"genre_scores_gemma":[0.6281015,0.0012461109,0.35833874,0.00013046587,0.00036120895,0.000112354755,0.0011805177,0.00014103753,0.010387981],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861085,0.00042571418,0.00008862096,0.00023569976,0.00053783634,0.00010128324],"domain_scores_gemma":[0.99792767,0.00092810654,0.000171783,0.000387942,0.0005252435,0.000059226943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017430659,0.0007454977,0.0018928375,0.0016178156,0.00043616284,0.0016174805,0.0008214156,0.0010103481,0.0037337595],"category_scores_gemma":[0.007769541,0.00044598128,0.0010055002,0.0016105996,0.00048347263,0.0014063717,0.00076493353,0.0016592204,0.001639148],"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.00043589913,0.00017375858,0.0022734052,0.0002643369,0.0003176844,0.0001655346,0.00006447617,0.24681307,0.006233106,0.054881606,0.011358661,0.6770185],"study_design_scores_gemma":[0.000012838455,0.00006624671,0.0005922105,0.000013394707,0.000036153506,0.00005670781,0.000014177426,0.976616,0.0018896135,0.01827622,0.0024123907,0.000014031242],"about_ca_topic_score_codex":0.0009675749,"about_ca_topic_score_gemma":0.0006921095,"teacher_disagreement_score":0.0037337595,"about_ca_system_score_codex":0.00033644692,"about_ca_system_score_gemma":0.0006391147,"threshold_uncertainty_score":0.01249063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052995753,0.00089850544,0.9385726,0.00084708567,0.00033483788,0.00009453637,0.00043873256,0.00012980754,0.0056881686],"genre_scores_gemma":[0.7838448,0.0028840078,0.18449736,0.00019850068,0.00056037074,0.0003434401,0.0008488802,0.00017173005,0.026650872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995596,0.00014458012,0.000017771577,0.0001323494,0.00007348167,0.00007217877],"domain_scores_gemma":[0.9992805,0.00046853244,0.000092659604,0.000037742142,0.00004514271,0.000075358745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007953729,0.0008633709,0.0010194747,0.00042059264,0.00032818574,0.0013252074,0.0014380806,0.0013444684,0.004691841],"category_scores_gemma":[0.0026633677,0.0005867083,0.0005940401,0.0009173266,0.0004973197,0.0019265566,0.00075941253,0.0013290555,0.0004335015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041483392,0.0001636085,0.0007552688,0.00036071482,0.00009884152,0.00024258877,0.00009924995,0.81773734,0.0038971081,0.11157561,0.0055871727,0.05906762],"study_design_scores_gemma":[0.000039136652,0.000043496886,0.00019007396,0.000008667272,0.00002318728,0.00004332731,0.000023612947,0.97035587,0.0005490311,0.026264444,0.0024514343,0.000007787629],"about_ca_topic_score_codex":0.0026089735,"about_ca_topic_score_gemma":0.0014017519,"teacher_disagreement_score":0.004691841,"about_ca_system_score_codex":0.0006701764,"about_ca_system_score_gemma":0.0009944513,"threshold_uncertainty_score":0.01569575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025274701,0.000976238,0.9658364,0.0006329489,0.00015128571,0.00004930676,0.000111604924,0.00014224941,0.0068253153],"genre_scores_gemma":[0.54906553,0.0011748491,0.44344974,0.00044853776,0.00044126683,0.0002325509,0.0002716673,0.000109839006,0.004806079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693954,0.00133445,0.00018885272,0.00031437998,0.0010564899,0.00016628217],"domain_scores_gemma":[0.994787,0.0036394296,0.00044390507,0.00038840057,0.00056826,0.00017305417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004535027,0.00076411397,0.0012109759,0.0026420408,0.000989714,0.0035574075,0.0014303984,0.0011067489,0.0032109348],"category_scores_gemma":[0.010083192,0.00056182995,0.0014855851,0.0026731612,0.0038975968,0.00483294,0.0020811993,0.0028167204,0.00037227749],"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.000028613755,0.00001586686,0.000095548705,0.00005015428,0.000019393095,0.000051796564,0.00015842674,0.006081623,0.00080906594,0.9833172,0.0003939804,0.008978368],"study_design_scores_gemma":[0.000010426132,0.000015651312,0.000058935595,0.000013272104,0.000008194834,0.000023026834,0.000031256342,0.026108375,0.00027861184,0.9726528,0.00079127325,0.000008074496],"about_ca_topic_score_codex":0.0010058522,"about_ca_topic_score_gemma":0.0009400639,"teacher_disagreement_score":0.004535027,"about_ca_system_score_codex":0.0021765872,"about_ca_system_score_gemma":0.0012236072,"threshold_uncertainty_score":0.023983836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001405055,0.000075011696,0.9974087,0.00005645961,0.0000344777,0.000021902635,0.000013308714,0.0000642609,0.00092088047],"genre_scores_gemma":[0.17921247,0.00065818185,0.8119874,0.00021989574,0.00022945774,0.00038994534,0.000170696,0.00047605365,0.0066559077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835664,0.00048239145,0.00007790349,0.0001945099,0.0006696715,0.00021883356],"domain_scores_gemma":[0.99882,0.0004912511,0.00009110799,0.00020846118,0.00027684495,0.0001123914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023019484,0.0017763366,0.0022949718,0.0010422072,0.0010440681,0.0022169107,0.003006406,0.0014251786,0.003890376],"category_scores_gemma":[0.0040953388,0.0011619162,0.0013403874,0.0022647153,0.0011610665,0.0028055683,0.002897862,0.0030573907,0.00083637435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054720822,0.00007285315,0.00010580508,0.00007171546,0.00003642267,0.0000601345,0.000072559225,0.84914124,0.0023288876,0.114269055,0.0015795107,0.03220706],"study_design_scores_gemma":[0.000005031505,0.000013857458,0.00001666262,0.0000032965395,0.0000055802516,0.0000069207217,0.000005458804,0.9870908,0.0002224144,0.012016043,0.0006089234,0.000004972265],"about_ca_topic_score_codex":0.004113157,"about_ca_topic_score_gemma":0.006740695,"teacher_disagreement_score":0.004113157,"about_ca_system_score_codex":0.0019226035,"about_ca_system_score_gemma":0.0035497537,"threshold_uncertainty_score":0.013949573},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00890694,0.0004157389,0.9896086,0.00012286642,0.000042225663,0.000031142317,0.000059416576,0.00006435115,0.0007487562],"genre_scores_gemma":[0.36957255,0.0013493091,0.6265716,0.00017215218,0.00021267957,0.00043736005,0.00039101118,0.00016348953,0.0011298489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98334056,0.011232349,0.0012576809,0.0007270379,0.003102876,0.00033947008],"domain_scores_gemma":[0.86165744,0.12579283,0.0037962142,0.0059248633,0.0025372256,0.00029145126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02040395,0.00088705873,0.0021768545,0.0022309686,0.00093585294,0.0035560776,0.0014357304,0.0018771574,0.0025274565],"category_scores_gemma":[0.11010224,0.0008551185,0.001572284,0.0076635825,0.0012721804,0.0054499856,0.0021859922,0.0050465325,0.00047293535],"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.00026870723,0.00022968794,0.0037528116,0.0013307213,0.00035938455,0.0008223284,0.0009261633,0.4353334,0.005078319,0.26733378,0.0025976764,0.28196704],"study_design_scores_gemma":[0.00003159042,0.00011138701,0.0013489466,0.00017954085,0.00008111099,0.00025925235,0.00022514015,0.7824659,0.005100649,0.20591506,0.004207317,0.000074069925],"about_ca_topic_score_codex":0.00091048365,"about_ca_topic_score_gemma":0.00076618,"teacher_disagreement_score":0.02040395,"about_ca_system_score_codex":0.0008309916,"about_ca_system_score_gemma":0.0011924828,"threshold_uncertainty_score":0.10790771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04752322,0.0011510247,0.93376505,0.0011227444,0.00012150572,0.0002237368,0.0004215406,0.00073296204,0.014938259],"genre_scores_gemma":[0.27386615,0.0010101978,0.71133363,0.00027167372,0.00017775531,0.00041482557,0.0011895731,0.00040234695,0.011333894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935395,0.0002737904,0.000027625492,0.0001218479,0.00011070914,0.00011213364],"domain_scores_gemma":[0.9973309,0.002011955,0.00020567731,0.00012438073,0.00016390097,0.00016314712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015246004,0.001233009,0.0018955058,0.0013380246,0.0012029026,0.0018810923,0.0023411044,0.002370468,0.006960054],"category_scores_gemma":[0.0046128486,0.00097196316,0.0010298544,0.0025967848,0.0010183011,0.0025048198,0.001788191,0.0026643,0.0011166699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032389766,0.0003937194,0.0009542196,0.00032276972,0.00011805373,0.00013617906,0.00019245651,0.7191638,0.0008146786,0.065220684,0.014464745,0.19789487],"study_design_scores_gemma":[0.00007358578,0.000046025056,0.00014787294,0.000018933333,0.000023339559,0.000029106865,0.000042205447,0.92707473,0.0002576536,0.07053316,0.0017460905,0.000007306394],"about_ca_topic_score_codex":0.0070590614,"about_ca_topic_score_gemma":0.008380493,"teacher_disagreement_score":0.0070590614,"about_ca_system_score_codex":0.001371377,"about_ca_system_score_gemma":0.0020992104,"threshold_uncertainty_score":0.02328372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98419076,0.00022094209,0.004403399,0.0010118487,0.000042134256,0.000021304555,0.000062304134,0.000027910353,0.010019443],"genre_scores_gemma":[0.9977633,0.00006713975,0.000324993,0.000033536995,0.000023751667,0.0000037974082,0.000026575453,0.00000563645,0.0017512247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990368,0.00032461277,0.000051256877,0.00012535029,0.000080744205,0.00038127528],"domain_scores_gemma":[0.9891812,0.0075554806,0.000977371,0.00028258158,0.00047038507,0.0015330368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003831428,0.0006451212,0.0020822522,0.0005956914,0.0010726429,0.004607455,0.0010692995,0.0032893694,0.009327079],"category_scores_gemma":[0.010923641,0.00058129855,0.0005953341,0.00071206485,0.0019257391,0.0036432059,0.0012017608,0.0016194067,0.0004184433],"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.0316678,0.0022598556,0.04996754,0.0007513186,0.00056684954,0.010787431,0.0033653693,0.36494228,0.019814763,0.4529034,0.013793078,0.04918035],"study_design_scores_gemma":[0.0021172909,0.0030500086,0.021538232,0.00009607272,0.00035880503,0.0016497461,0.0068457103,0.73082227,0.0038120744,0.2255366,0.0038533167,0.00031990817],"about_ca_topic_score_codex":0.0021859277,"about_ca_topic_score_gemma":0.0021680284,"teacher_disagreement_score":0.009327079,"about_ca_system_score_codex":0.0014824034,"about_ca_system_score_gemma":0.0012519713,"threshold_uncertainty_score":0.031202197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010031528,0.00034228523,0.98325217,0.00026437946,0.00006926102,0.00013414057,0.00011160187,0.000055553894,0.005739143],"genre_scores_gemma":[0.41665044,0.0013520465,0.5709967,0.00019093815,0.000122032005,0.00069299585,0.00024197344,0.00012783357,0.0096250065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995992,0.00197211,0.00019000111,0.00048025855,0.0010736813,0.00029199017],"domain_scores_gemma":[0.9956434,0.003085852,0.00024425465,0.0003624255,0.00060114806,0.000062936575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065404144,0.0024608793,0.004270509,0.002346634,0.00092900865,0.0055132546,0.0028739735,0.002687493,0.0046459367],"category_scores_gemma":[0.010350431,0.0014276671,0.0027012355,0.004793538,0.0012529984,0.0041247285,0.0015026747,0.0030505296,0.0005319843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058680886,0.000103282735,0.00024122524,0.00014246671,0.00019486024,0.000046882473,0.000034623805,0.90596676,0.0010180855,0.064425215,0.00049013615,0.02727775],"study_design_scores_gemma":[0.00002094064,0.00004386733,0.0001695321,0.000040219315,0.00011303434,0.0000326226,0.000027393547,0.96125257,0.0011384182,0.03524568,0.0018921731,0.000023516324],"about_ca_topic_score_codex":0.00762703,"about_ca_topic_score_gemma":0.0071008923,"teacher_disagreement_score":0.00762703,"about_ca_system_score_codex":0.0035493034,"about_ca_system_score_gemma":0.0040267063,"threshold_uncertainty_score":0.03458947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82583743,0.0008764397,0.15285271,0.0022584652,0.00026286358,0.00034571192,0.0010134266,0.00037505478,0.016177911],"genre_scores_gemma":[0.9900383,0.00014616472,0.006607761,0.000048147453,0.000022349086,0.000028656157,0.000101302525,0.000026784142,0.0029806886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786794,0.00077803415,0.00016820697,0.00039671944,0.00022068931,0.0005684641],"domain_scores_gemma":[0.9889621,0.008268659,0.00086182606,0.00038665844,0.00086674606,0.00065402966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059539555,0.0011651808,0.0033303988,0.0012462283,0.00087333226,0.0056997966,0.0023894599,0.0044134646,0.006339108],"category_scores_gemma":[0.014988728,0.002815001,0.001550122,0.0016870847,0.0016258607,0.0038766407,0.0015457629,0.0028995574,0.00065178605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015080874,0.00017323424,0.0011613412,0.00014870356,0.00007110108,0.00046384585,0.00015302877,0.974309,0.0017996572,0.013402614,0.00079722103,0.006012116],"study_design_scores_gemma":[0.00013014575,0.00019637166,0.00087902776,0.0000227212,0.00006038111,0.00006906085,0.0001315866,0.9872777,0.001035809,0.009792536,0.0003487325,0.000055876746],"about_ca_topic_score_codex":0.008876984,"about_ca_topic_score_gemma":0.005844979,"teacher_disagreement_score":0.008876984,"about_ca_system_score_codex":0.0032367124,"about_ca_system_score_gemma":0.0031354304,"threshold_uncertainty_score":0.031487882},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38342932,0.0007636135,0.60247535,0.00085706444,0.00016735023,0.00020840028,0.0002797629,0.00049307744,0.0113260625],"genre_scores_gemma":[0.982771,0.00015205752,0.01106057,0.000040567764,0.000039670624,0.00007883392,0.000057887173,0.000018558721,0.0057809027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909437,0.0002702467,0.0000466662,0.00025192313,0.00012707854,0.00020967101],"domain_scores_gemma":[0.9980557,0.0011390469,0.00024256553,0.000104769424,0.00028242997,0.00017551216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014246942,0.0010392056,0.0018621614,0.0005904718,0.0012007824,0.0024339175,0.0020346746,0.002300096,0.004192878],"category_scores_gemma":[0.0020734998,0.0010026623,0.00075870875,0.0010882631,0.0015337339,0.0013457092,0.0016060186,0.0010465891,0.0004596977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005246765,0.00012988498,0.00051992456,0.00012610982,0.00004895611,0.0003866671,0.00009412683,0.97993934,0.0059575206,0.0048994925,0.0003240744,0.0070491894],"study_design_scores_gemma":[0.00004417447,0.00008414102,0.00016016696,0.0000023599666,0.000011890861,0.000011016962,0.000006566087,0.9980282,0.0003956258,0.0011486054,0.00009728395,0.00000989566],"about_ca_topic_score_codex":0.010670749,"about_ca_topic_score_gemma":0.006548543,"teacher_disagreement_score":0.010670749,"about_ca_system_score_codex":0.0012940771,"about_ca_system_score_gemma":0.0010342633,"threshold_uncertainty_score":0.021217287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16292106,0.00416053,0.8096317,0.00060256023,0.0001910787,0.000091942624,0.00013706415,0.00049987505,0.021764262],"genre_scores_gemma":[0.6680851,0.0015607924,0.3245576,0.000111094036,0.000114584036,0.00021861793,0.00020605016,0.00032300488,0.0048230966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991973,0.0004043184,0.000030123269,0.00008670658,0.00020726149,0.000074267475],"domain_scores_gemma":[0.99321544,0.005539591,0.00027131368,0.00035189695,0.00051453995,0.00010732122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022886884,0.0014966212,0.0021599045,0.0015517842,0.0010092922,0.0015306883,0.0010099192,0.0029735535,0.0040430822],"category_scores_gemma":[0.008170557,0.0008286542,0.0011387717,0.003175569,0.0016606174,0.0021359723,0.0011860755,0.0013944043,0.000452593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001074314,0.0000622254,0.00024362997,0.00011549517,0.000021593034,0.000026137315,0.00006429801,0.96747535,0.00069093326,0.009277369,0.0008670857,0.0210484],"study_design_scores_gemma":[0.000011828113,0.000028740247,0.000079147736,0.0000055574988,0.000007055618,0.000009645873,0.000014179908,0.9957048,0.00049989525,0.003373653,0.00026018205,0.000005212161],"about_ca_topic_score_codex":0.0049283137,"about_ca_topic_score_gemma":0.0030956783,"teacher_disagreement_score":0.0049283137,"about_ca_system_score_codex":0.0008151306,"about_ca_system_score_gemma":0.00075088156,"threshold_uncertainty_score":0.013525426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002895299,0.000092352195,0.99596715,0.00019124652,0.000026871252,0.000025088071,0.000046972804,0.00027385185,0.00048119418],"genre_scores_gemma":[0.1649798,0.00019144447,0.82586825,0.00032635135,0.00015181291,0.00045495713,0.0005728436,0.0008855866,0.0065688626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958402,0.0026263765,0.000120614604,0.0006329706,0.0005265382,0.00025337652],"domain_scores_gemma":[0.99160016,0.006047683,0.00039796537,0.00051165884,0.0011461297,0.0002963257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070080385,0.002264598,0.0035225379,0.0012051746,0.0011218842,0.0022449072,0.004205144,0.0031299295,0.004692959],"category_scores_gemma":[0.016793834,0.0018070816,0.0017793442,0.0018377973,0.0024283654,0.0028268758,0.004156441,0.003443881,0.0015190851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028087397,0.000116534706,0.00041988379,0.0002143984,0.0001179427,0.000047848516,0.0000883392,0.8927337,0.0018198593,0.043870725,0.005682905,0.054606903],"study_design_scores_gemma":[0.000013196234,0.000020234176,0.00002620848,0.0000041921126,0.0000059419935,0.000005504819,0.000005531579,0.99018705,0.0002844829,0.009210305,0.00023194407,0.0000055252312],"about_ca_topic_score_codex":0.0063670417,"about_ca_topic_score_gemma":0.0066756536,"teacher_disagreement_score":0.0070080385,"about_ca_system_score_codex":0.0020061152,"about_ca_system_score_gemma":0.0045034285,"threshold_uncertainty_score":0.037062466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951068,0.0002207732,0.0016930522,0.00012158117,0.000008425502,0.000025513396,0.00010417306,0.000033443852,0.0026862293],"genre_scores_gemma":[0.9979577,0.00003205671,0.0005400711,0.0000066170987,0.0000039617735,0.000004586469,0.000089366964,0.0000048014836,0.0013608044],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988148,0.00022056192,0.00010375455,0.0002232902,0.0003654624,0.00027227425],"domain_scores_gemma":[0.9933542,0.0025133726,0.0017699342,0.00045410497,0.0011067474,0.00080166524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025752247,0.00031460257,0.00042615324,0.0015487728,0.00080999476,0.002316121,0.0011311074,0.0009700301,0.003527821],"category_scores_gemma":[0.008248423,0.0002290105,0.00046471244,0.0010434914,0.00029776336,0.0022761945,0.0008031467,0.0011079974,0.0004670479],"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.0049037435,0.0018546225,0.66610384,0.00017182095,0.0001917754,0.002434352,0.0017558971,0.09206938,0.020285305,0.00793577,0.0035805595,0.19871293],"study_design_scores_gemma":[0.000045567263,0.0010103487,0.59774876,0.00007877921,0.0001687798,0.00061252114,0.0041397675,0.38475406,0.0051360037,0.0036253906,0.0025767328,0.00010326653],"about_ca_topic_score_codex":0.014324912,"about_ca_topic_score_gemma":0.015021893,"teacher_disagreement_score":0.014324912,"about_ca_system_score_codex":0.0019700637,"about_ca_system_score_gemma":0.0013235549,"threshold_uncertainty_score":0.028483033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008609106,0.00014825992,0.98707145,0.00014608684,0.00003646564,0.00010878191,0.00009374458,0.0001599616,0.0036261296],"genre_scores_gemma":[0.55949575,0.00028764887,0.43287802,0.00013897406,0.00009778569,0.0005940861,0.00026915327,0.00016588694,0.0060726833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986082,0.0006079494,0.00006313295,0.00018473614,0.00032609317,0.00020996868],"domain_scores_gemma":[0.9983853,0.0011042687,0.00010972773,0.0000683452,0.00025236016,0.000080059166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003543246,0.0015262208,0.0021488112,0.0012185101,0.00066257553,0.0022516705,0.0031727657,0.0021872958,0.006840489],"category_scores_gemma":[0.004341772,0.001693975,0.0016816412,0.001200125,0.0008695435,0.0023734742,0.0015972272,0.0017921678,0.0005208662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037167294,0.00002847569,0.000058505495,0.000042051608,0.000021180578,0.00003355208,0.000021802087,0.98704463,0.0003783158,0.004722501,0.00023467524,0.007377205],"study_design_scores_gemma":[0.000006079672,0.000016298496,0.000016544114,0.0000026276134,0.0000044791514,0.0000023670555,0.0000025782851,0.9987109,0.000098855526,0.001049573,0.00008595715,0.0000037370644],"about_ca_topic_score_codex":0.011832636,"about_ca_topic_score_gemma":0.0097863935,"teacher_disagreement_score":0.011832636,"about_ca_system_score_codex":0.0018796559,"about_ca_system_score_gemma":0.0019502763,"threshold_uncertainty_score":0.023527503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5679196,0.0011631906,0.40131962,0.003773888,0.00042002063,0.00072574103,0.00080852193,0.0011794107,0.022689935],"genre_scores_gemma":[0.9676124,0.00041258414,0.02433636,0.00013814126,0.00011237886,0.00010945677,0.00016191309,0.00007910174,0.0070377435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993111,0.00024113487,0.00003271242,0.00009513618,0.000083705076,0.00023607613],"domain_scores_gemma":[0.9963787,0.0022909166,0.00035619977,0.00018132973,0.00039670465,0.00039613873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020897484,0.001303253,0.0023838559,0.001798964,0.0010298608,0.003045703,0.0016762712,0.0029822178,0.006734354],"category_scores_gemma":[0.0051739863,0.0013582975,0.00092654454,0.0016331846,0.0014876582,0.0027874412,0.0011130759,0.0022532148,0.00064633973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010570515,0.0003598526,0.0005049895,0.00018203167,0.00004638685,0.00021311025,0.00012560861,0.9570813,0.0036237452,0.017452521,0.0027649791,0.016588507],"study_design_scores_gemma":[0.00009251508,0.00011167477,0.0002765646,0.000016029571,0.000025296124,0.000017919514,0.000046702244,0.99073493,0.00069531216,0.007698548,0.00026466674,0.00001988574],"about_ca_topic_score_codex":0.013728619,"about_ca_topic_score_gemma":0.006083496,"teacher_disagreement_score":0.013728619,"about_ca_system_score_codex":0.0034814815,"about_ca_system_score_gemma":0.00395842,"threshold_uncertainty_score":0.027297437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003280648,0.99712557,0.0005011072,0.0005306322,0.00014150319,0.0000059298227,0.000043268792,0.0000046543664,0.0013192713],"genre_scores_gemma":[0.0020618844,0.9966079,0.00055432844,0.00019738931,0.00018236038,0.0000063458137,0.00006305603,0.0000018551746,0.0003249775],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912363,0.00014235498,0.00018102005,0.00015834419,0.00034523397,0.000049339684],"domain_scores_gemma":[0.9956787,0.002311306,0.00064407126,0.0000891231,0.0011781434,0.00009861999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014906632,0.00084587553,0.0012488472,0.004373229,0.0004219876,0.0018212533,0.0013470285,0.0014990703,0.0033417982],"category_scores_gemma":[0.0059527988,0.0006951324,0.0006414292,0.011802065,0.0008701825,0.0029812453,0.00085830013,0.0011374218,0.0009637865],"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.00008881213,0.000081914455,0.0008649123,0.021828433,0.00009755657,0.0001932678,0.00009594798,0.002130475,0.00029359575,0.008736163,0.040444758,0.9251442],"study_design_scores_gemma":[0.00002112991,0.000091544265,0.0039714747,0.015771288,0.0002526748,0.0012550323,0.00023632971,0.00072472234,0.00044649994,0.0056530237,0.97153676,0.000039526723],"about_ca_topic_score_codex":0.0068850527,"about_ca_topic_score_gemma":0.013894863,"teacher_disagreement_score":0.0068850527,"about_ca_system_score_codex":0.0023548442,"about_ca_system_score_gemma":0.005533359,"threshold_uncertainty_score":0.017085671},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26226988,0.00076776784,0.73079604,0.00034244318,0.000052980926,0.00034258378,0.00043843448,0.00018842648,0.004801488],"genre_scores_gemma":[0.7471093,0.00051741634,0.25032493,0.00006299846,0.000022394706,0.0003814208,0.0005190661,0.000052472435,0.0010100196],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99297637,0.0031239646,0.0009842237,0.0003576547,0.0021010574,0.0004566671],"domain_scores_gemma":[0.986809,0.009822457,0.0007837156,0.0009245856,0.0015179748,0.00014220893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0080975825,0.0011568508,0.002019088,0.0054256977,0.00136185,0.004448023,0.00063950307,0.0013200514,0.0011240194],"category_scores_gemma":[0.025980394,0.0005503073,0.0012403382,0.007604678,0.0012838673,0.004104895,0.0012851505,0.0014952581,0.00051162887],"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.00071032054,0.00058273226,0.04864179,0.001021832,0.00028355554,0.0002427471,0.0013403628,0.24906524,0.01708942,0.090813145,0.0014157606,0.5887931],"study_design_scores_gemma":[0.000052519616,0.00025539144,0.017641965,0.00030018942,0.00016445856,0.00014629312,0.0013932104,0.8276859,0.027203921,0.11960617,0.0054388894,0.00011110909],"about_ca_topic_score_codex":0.003105462,"about_ca_topic_score_gemma":0.002443904,"teacher_disagreement_score":0.0080975825,"about_ca_system_score_codex":0.0017435513,"about_ca_system_score_gemma":0.0023408418,"threshold_uncertainty_score":0.042824626},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15637678,0.022974823,0.71107846,0.0036432738,0.0012543991,0.000100156736,0.0009117379,0.00020769986,0.103452735],"genre_scores_gemma":[0.8538036,0.008398293,0.11370071,0.00028778103,0.0009336787,0.00014077805,0.00050828693,0.000049437636,0.022177547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988065,0.00038772103,0.00010271415,0.000119266115,0.00051582325,0.000068010886],"domain_scores_gemma":[0.9958181,0.0028452447,0.0003900406,0.00024796368,0.00051625236,0.00018235199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002203825,0.00066296465,0.001054257,0.0018294654,0.00079359114,0.0032238108,0.00065859634,0.0009586338,0.0058423337],"category_scores_gemma":[0.007458705,0.00039770812,0.0007153268,0.002617142,0.002473269,0.0052383095,0.0007089981,0.0016168784,0.0005641962],"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.00005427154,0.00002640568,0.00020855918,0.00010158268,0.000017107339,0.00010128019,0.00027204724,0.009468141,0.00040239768,0.97681344,0.001140199,0.011394441],"study_design_scores_gemma":[0.000012636078,0.000022282264,0.00025214738,0.000024456787,0.000009754194,0.00007460667,0.00008815647,0.024312736,0.000113503345,0.9709726,0.0041055335,0.000011477674],"about_ca_topic_score_codex":0.002972533,"about_ca_topic_score_gemma":0.0021622262,"teacher_disagreement_score":0.0058423337,"about_ca_system_score_codex":0.0016467724,"about_ca_system_score_gemma":0.0009456735,"threshold_uncertainty_score":0.019544542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21607237,0.0005660449,0.76987654,0.0007370088,0.00010178478,0.00011145372,0.00047197402,0.0003072726,0.011755508],"genre_scores_gemma":[0.98352045,0.0001670397,0.012963743,0.000036445927,0.000017925211,0.000083428895,0.00008625537,0.000013846248,0.0031108295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995906,0.00012063538,0.000020707856,0.00011798885,0.000096571275,0.000053530093],"domain_scores_gemma":[0.9994677,0.0002768359,0.000094459974,0.000017444101,0.00011089536,0.000032641692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009461318,0.00075820927,0.0013948885,0.0004931333,0.00053808716,0.0015437742,0.0015543901,0.0022490784,0.001970347],"category_scores_gemma":[0.0017700766,0.00055681524,0.0006421271,0.0008286293,0.00088814076,0.0012247809,0.0007674942,0.001021422,0.00018853409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022934391,0.000012644381,0.00010736895,0.000012126029,0.0000099832405,0.000024586903,0.0000131669485,0.9964395,0.0002732441,0.0017962073,0.00007068886,0.0012175718],"study_design_scores_gemma":[0.0000040161,0.000008175844,0.00004092619,9.2106836e-7,0.0000034581217,0.0000021083767,0.0000019097615,0.99948645,0.00004027643,0.00037135524,0.000038014266,0.0000023578946],"about_ca_topic_score_codex":0.018788029,"about_ca_topic_score_gemma":0.010011614,"teacher_disagreement_score":0.018788029,"about_ca_system_score_codex":0.0017501761,"about_ca_system_score_gemma":0.0012569136,"threshold_uncertainty_score":0.03735739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012629384,0.0005958822,0.9828266,0.00032750415,0.00003646769,0.00005961774,0.000046282552,0.0000418436,0.00343649],"genre_scores_gemma":[0.6697042,0.0013047063,0.3236784,0.000102194055,0.00014848288,0.00051212945,0.000091202994,0.000049706516,0.0044089914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973677,0.0016644247,0.00010402688,0.00020026766,0.00053814024,0.00012545561],"domain_scores_gemma":[0.9942345,0.0049853628,0.0002570293,0.000099114426,0.00028825202,0.0001357399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048256987,0.0017499712,0.0020922062,0.002924142,0.0013090539,0.0033410378,0.002614747,0.0026968122,0.0031413976],"category_scores_gemma":[0.009129907,0.0015270176,0.0032866003,0.0029098822,0.0016587039,0.0035627848,0.0020338015,0.0021316225,0.00022579214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007433409,0.0000779932,0.00029845856,0.00016207254,0.00014805463,0.00019718839,0.000104488325,0.9158629,0.00040127573,0.07002663,0.00038096224,0.012265723],"study_design_scores_gemma":[0.000009572382,0.00002661004,0.00006946839,0.000019785524,0.000026317386,0.000026587972,0.000020211502,0.96863335,0.000094584924,0.03087687,0.00018108256,0.000015526162],"about_ca_topic_score_codex":0.004310765,"about_ca_topic_score_gemma":0.0039754026,"teacher_disagreement_score":0.0048256987,"about_ca_system_score_codex":0.0020041056,"about_ca_system_score_gemma":0.0014894812,"threshold_uncertainty_score":0.02552104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9101138,0.00054416806,0.007845214,0.0016985172,0.00009834145,0.000025568877,0.00010321184,0.00006318721,0.079508126],"genre_scores_gemma":[0.99741167,0.000096866046,0.0008001367,0.00004765475,0.00006099776,0.0000046674386,0.000008510611,0.000012226852,0.0015572128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912935,0.00024605088,0.00002909429,0.00012022984,0.00029164922,0.00018361538],"domain_scores_gemma":[0.9858569,0.0100125335,0.0010315381,0.0007867918,0.0010267186,0.001285558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008645559,0.00031240607,0.0005764183,0.0010402274,0.00093911093,0.0052043567,0.00052200136,0.0013734141,0.010590816],"category_scores_gemma":[0.009705368,0.00067135465,0.0003647474,0.0005937424,0.002304701,0.003440044,0.0015879725,0.0012604394,0.0008443318],"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.003988919,0.0028069632,0.12354936,0.00045119252,0.00021453925,0.0022067728,0.0031321496,0.01713074,0.08424818,0.6297682,0.0038729166,0.12863009],"study_design_scores_gemma":[0.00064215355,0.0011767091,0.34756508,0.00018958504,0.00066831056,0.0028182794,0.0031081776,0.18204638,0.0106780445,0.44255304,0.008109274,0.00044489247],"about_ca_topic_score_codex":0.0014415331,"about_ca_topic_score_gemma":0.0015390692,"teacher_disagreement_score":0.010590816,"about_ca_system_score_codex":0.0008804552,"about_ca_system_score_gemma":0.001121615,"threshold_uncertainty_score":0.035429835},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015196945,0.000119386365,0.9822245,0.00008299517,0.000051699495,0.00006581921,0.000086521264,0.0002081339,0.001963926],"genre_scores_gemma":[0.29894608,0.00015814086,0.6965599,0.00009234194,0.0000877563,0.0003411475,0.00034158654,0.00024034404,0.0032327909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928564,0.00029024994,0.000040284092,0.00014642964,0.00015810366,0.000079345984],"domain_scores_gemma":[0.9984938,0.0008504749,0.0001229321,0.00013078545,0.00029208226,0.000109915505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015728478,0.0010223619,0.0021846052,0.0012953336,0.0010667396,0.0013152605,0.002322167,0.0013760155,0.0041124695],"category_scores_gemma":[0.002909723,0.0013003041,0.0012582929,0.0023626024,0.00048434973,0.0017228075,0.0016479031,0.0012134579,0.00044287933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089889705,0.000073099254,0.00031018085,0.00003852457,0.000057874768,0.00003377683,0.000042690255,0.957522,0.0005959336,0.0036965057,0.00088342495,0.036656193],"study_design_scores_gemma":[0.0000055772757,0.000007877501,0.00002087528,0.0000014167897,0.0000040205414,0.000002001394,0.000003670085,0.9992939,0.000049088572,0.0004995144,0.00011039233,0.0000017268009],"about_ca_topic_score_codex":0.016909134,"about_ca_topic_score_gemma":0.0150254,"teacher_disagreement_score":0.016909134,"about_ca_system_score_codex":0.00085797015,"about_ca_system_score_gemma":0.001580894,"threshold_uncertainty_score":0.03362143},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03023682,0.009617295,0.04390504,0.40693215,0.12845959,0.00030299442,0.0016518333,0.0014304918,0.37746388],"genre_scores_gemma":[0.2935574,0.01464511,0.027710926,0.08913971,0.05516981,0.00018176479,0.00075387995,0.00055230624,0.51828915],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974831,0.0006754587,0.00033798226,0.00024694388,0.0009510767,0.00030559063],"domain_scores_gemma":[0.99204344,0.004493149,0.0005514884,0.0005777888,0.001860091,0.0004740708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017354672,0.00078692846,0.00046711625,0.0008768481,0.005939056,0.0032812858,0.0030237813,0.014117794,0.013502468],"category_scores_gemma":[0.011978207,0.00063199014,0.00096791226,0.00089968345,0.0024934392,0.0035823614,0.0023672758,0.01157344,0.0045949477],"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.0003367392,0.00006327401,0.003365275,0.00038565055,0.00002974839,0.02261421,0.0024090614,0.0035873146,0.007498778,0.05116192,0.8450802,0.063467935],"study_design_scores_gemma":[0.00001462531,0.00012927037,0.0029981658,0.000254032,0.000026879032,0.0019830647,0.0021528979,0.00083658664,0.0011957008,0.0037205357,0.98660207,0.00008621732],"about_ca_topic_score_codex":0.049875923,"about_ca_topic_score_gemma":0.13656987,"teacher_disagreement_score":0.049875923,"about_ca_system_score_codex":0.0027868885,"about_ca_system_score_gemma":0.005115127,"threshold_uncertainty_score":0.09917122},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25908294,0.00035256302,0.7259706,0.0012420282,0.00019062946,0.0017242737,0.0006523013,0.0040109893,0.0067736492],"genre_scores_gemma":[0.41670242,0.00018050967,0.5800763,0.00020388853,0.000039796632,0.00037518184,0.00038301462,0.00008121316,0.0019576452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975916,0.0009823272,0.00023929878,0.00020313555,0.0008923895,0.0000913095],"domain_scores_gemma":[0.98724663,0.00518375,0.00051177386,0.0007517809,0.005811205,0.000494735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007663079,0.0004703812,0.00070478936,0.0012030962,0.00059250975,0.0016333176,0.0012658252,0.0013477595,0.00402325],"category_scores_gemma":[0.020598395,0.00027250408,0.00030436536,0.0005088026,0.00035124048,0.0013544551,0.0005161114,0.00068819243,0.0010590587],"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.0020540664,0.0014007582,0.0149168605,0.000615494,0.00020330313,0.0005112922,0.0011264046,0.08459882,0.06795671,0.0032234741,0.0061657936,0.817227],"study_design_scores_gemma":[0.00072821,0.0017280694,0.013590575,0.00024797232,0.00033118625,0.00078166,0.00095837726,0.9009359,0.063929625,0.0031727427,0.013434411,0.00016137483],"about_ca_topic_score_codex":0.006677718,"about_ca_topic_score_gemma":0.0070441603,"teacher_disagreement_score":0.007663079,"about_ca_system_score_codex":0.00090295414,"about_ca_system_score_gemma":0.002360407,"threshold_uncertainty_score":0.040526748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05013501,0.0018954219,0.91989744,0.0020205632,0.0003503021,0.00018849307,0.0014745864,0.00025184796,0.02378626],"genre_scores_gemma":[0.6640889,0.0027123466,0.2841935,0.0007964784,0.00037617734,0.00063760823,0.002470524,0.00040132224,0.044323035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816847,0.0007624555,0.00006950404,0.0003578064,0.00040955428,0.00023223317],"domain_scores_gemma":[0.99865806,0.0007399572,0.00016906142,0.00008055095,0.00018756613,0.0001647003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024207917,0.0024056481,0.0024778047,0.0017913994,0.0007872169,0.0028494773,0.0031787872,0.0040316526,0.006984025],"category_scores_gemma":[0.005601871,0.0011993153,0.0013989953,0.003383814,0.0012443069,0.0026788292,0.0031979398,0.0021389674,0.00079638726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014151318,0.00012761689,0.00079901714,0.00032773794,0.00019762431,0.00025841896,0.00004820657,0.93962604,0.00083302543,0.03295912,0.003271437,0.02141039],"study_design_scores_gemma":[0.000037439888,0.0000614118,0.00032477244,0.000024064535,0.00004262643,0.000103760634,0.000035961868,0.97082627,0.00026178226,0.026139276,0.0021253463,0.000017236913],"about_ca_topic_score_codex":0.0058305473,"about_ca_topic_score_gemma":0.0040179035,"teacher_disagreement_score":0.006984025,"about_ca_system_score_codex":0.0013935813,"about_ca_system_score_gemma":0.001491334,"threshold_uncertainty_score":0.023363888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005474411,0.000054814165,0.9927705,0.0001562431,0.0000909322,0.000076068114,0.000034677847,0.00040411457,0.0009381682],"genre_scores_gemma":[0.22329761,0.00012994606,0.7722524,0.00032704722,0.0002045095,0.00048570038,0.00016679105,0.0002621013,0.0028739234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961816,0.0025971662,0.000098975055,0.0003651413,0.00045443285,0.00030271176],"domain_scores_gemma":[0.99096394,0.0072703506,0.0005338624,0.0005600355,0.0004267123,0.00024510873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052145943,0.00093791983,0.0016414009,0.0011315407,0.00059595495,0.00092633144,0.0016595402,0.0009937031,0.0059484574],"category_scores_gemma":[0.0137589015,0.00086235837,0.001129381,0.0016275955,0.0008128502,0.0018689246,0.0011040259,0.0018381629,0.00076832296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006299364,0.00044294496,0.00071363046,0.0001320431,0.000096259384,0.000046959,0.00005144047,0.79365593,0.002489479,0.050684158,0.0043374575,0.14671983],"study_design_scores_gemma":[0.000078520934,0.00009035997,0.000072471106,0.0000044989984,0.000013644008,0.000010142847,0.0000047341405,0.9829742,0.00033685195,0.01581044,0.000591186,0.000013036336],"about_ca_topic_score_codex":0.002851692,"about_ca_topic_score_gemma":0.0038369664,"teacher_disagreement_score":0.0059484574,"about_ca_system_score_codex":0.0011129953,"about_ca_system_score_gemma":0.0030395123,"threshold_uncertainty_score":0.027577698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14736831,0.0023240962,0.81696004,0.0042814026,0.00044429136,0.00025805613,0.0023000182,0.0006991111,0.025364604],"genre_scores_gemma":[0.6127287,0.0028949599,0.3576572,0.0004331409,0.00045506662,0.00039465318,0.0040367227,0.00043344006,0.020966021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984249,0.0006066761,0.00009328832,0.00034602653,0.00030092016,0.00022818756],"domain_scores_gemma":[0.99314696,0.005266498,0.0004041354,0.00044048874,0.00036186463,0.00038008735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013701597,0.0008822822,0.0013428318,0.001023785,0.0013165603,0.0025022917,0.0024925226,0.0023145766,0.007157907],"category_scores_gemma":[0.009853308,0.0008451234,0.001052172,0.0022558651,0.001529666,0.0058473325,0.0024211027,0.0024444354,0.000815251],"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.0011379429,0.00028085153,0.0013788585,0.0012590224,0.00021887523,0.00062248664,0.00037793623,0.41875577,0.0031635598,0.4287894,0.02266174,0.12135356],"study_design_scores_gemma":[0.0001668112,0.00009334968,0.00024040247,0.000059313526,0.00005736219,0.00035572206,0.00015101513,0.2660542,0.0011579052,0.7206582,0.010979139,0.000026534977],"about_ca_topic_score_codex":0.0022691004,"about_ca_topic_score_gemma":0.0018827118,"teacher_disagreement_score":0.007157907,"about_ca_system_score_codex":0.0010383892,"about_ca_system_score_gemma":0.0021443518,"threshold_uncertainty_score":0.02394551},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02173411,0.00024255723,0.97494054,0.00006774204,0.000019034025,0.000096870666,0.00024719624,0.00012029381,0.00253162],"genre_scores_gemma":[0.60753286,0.0004708614,0.39020073,0.00005739664,0.00005755538,0.0003241273,0.00041102976,0.000049790273,0.0008956803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957137,0.0015806442,0.00036387332,0.00077378034,0.001304347,0.00026353062],"domain_scores_gemma":[0.9965659,0.0016025475,0.00051081483,0.00090102083,0.00034106948,0.0000786351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031927682,0.0016597061,0.0016229245,0.0043757525,0.00061561854,0.0024341226,0.0017515486,0.0014870458,0.0011208855],"category_scores_gemma":[0.008721903,0.00061260513,0.00206701,0.004963632,0.0013860493,0.0024506126,0.0018324737,0.001654948,0.0002600644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012550973,0.00030741008,0.009636234,0.0005547005,0.0005456784,0.00013679806,0.00029591064,0.55565596,0.033883147,0.21373187,0.00069399504,0.1844328],"study_design_scores_gemma":[0.000016989632,0.00029585618,0.011599698,0.000073397554,0.00012792279,0.00027643685,0.0001141893,0.8724327,0.015682885,0.09497102,0.004293891,0.000115068884],"about_ca_topic_score_codex":0.0011072835,"about_ca_topic_score_gemma":0.0011132604,"teacher_disagreement_score":0.0043757525,"about_ca_system_score_codex":0.0012116238,"about_ca_system_score_gemma":0.00086833263,"threshold_uncertainty_score":0.016885161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7225868,0.00016683259,0.25986218,0.0005798862,0.0000384876,0.00014867932,0.00027414726,0.00006239753,0.01628058],"genre_scores_gemma":[0.9745198,0.00008646438,0.02024895,0.000020103753,0.000008834569,0.000059683553,0.00017934384,0.000015351146,0.004861496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939966,0.00023200928,0.000015905009,0.000085857035,0.0000541791,0.00021227499],"domain_scores_gemma":[0.9988601,0.0006294368,0.00014090724,0.000059024023,0.00009804767,0.00021253605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012845113,0.0005064698,0.0007083707,0.00066463224,0.00093446206,0.0019697226,0.0010491413,0.0011464292,0.0047481866],"category_scores_gemma":[0.0024186359,0.0005626415,0.0008878823,0.0011839664,0.00074654917,0.0018465988,0.0015908873,0.0007971579,0.00025801134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007337457,0.00004945128,0.0014623989,0.000012420323,0.000024537238,0.00008242875,0.00005519531,0.97841966,0.00021632333,0.0141255595,0.00035893416,0.0051196944],"study_design_scores_gemma":[0.000006603274,0.000023876493,0.00027611674,0.0000044202006,0.000008514904,0.0000071679706,0.0001737999,0.99408025,0.000118026626,0.005030839,0.00026722343,0.0000031457798],"about_ca_topic_score_codex":0.023344403,"about_ca_topic_score_gemma":0.02298901,"teacher_disagreement_score":0.023344403,"about_ca_system_score_codex":0.001606749,"about_ca_system_score_gemma":0.0023915807,"threshold_uncertainty_score":0.046417058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5783408,0.004337982,0.39443618,0.00065996667,0.00042651777,0.00018596814,0.00010902538,0.000862779,0.020640697],"genre_scores_gemma":[0.8989918,0.0007097351,0.09847897,0.000073233605,0.000056219593,0.00007037912,0.000052615047,0.00010616152,0.0014607677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989483,0.0006191933,0.000033351167,0.00008185259,0.00021502444,0.00010226725],"domain_scores_gemma":[0.99546343,0.003510078,0.0001652783,0.0003364397,0.00039805926,0.00012679145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017416005,0.00048984896,0.0011061344,0.001356622,0.00048262195,0.0011663034,0.0014752742,0.001777794,0.0019320272],"category_scores_gemma":[0.006088255,0.0003797301,0.0007099264,0.0014406616,0.0006747864,0.0012741407,0.00052466814,0.000759827,0.00016092285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010390674,0.00048638147,0.002480846,0.0003664121,0.00019980386,0.00014199084,0.00016426157,0.88758045,0.0041454923,0.013745527,0.0009042274,0.08874563],"study_design_scores_gemma":[0.000060372127,0.0003704148,0.0008315157,0.000013349668,0.000052444913,0.000052285308,0.00006006798,0.995394,0.0010562083,0.0014967747,0.0005975109,0.000015156094],"about_ca_topic_score_codex":0.004800048,"about_ca_topic_score_gemma":0.0056788074,"teacher_disagreement_score":0.004800048,"about_ca_system_score_codex":0.00084537757,"about_ca_system_score_gemma":0.0009196518,"threshold_uncertainty_score":0.009544253},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14121039,0.0023723205,0.83006114,0.0013084541,0.00048224544,0.00012768737,0.0038566978,0.0008804305,0.019700628],"genre_scores_gemma":[0.9310584,0.0006665714,0.054528143,0.000068392954,0.00024610676,0.00010059875,0.0008915275,0.00008317268,0.012357012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981236,0.00061582425,0.00013620486,0.00063888426,0.00031693504,0.00016844594],"domain_scores_gemma":[0.9910517,0.0046533826,0.0015955911,0.001239851,0.0012222695,0.00023713561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011702519,0.0011726174,0.0009391691,0.0026428492,0.0004334984,0.002121386,0.0013870054,0.0015972668,0.010140171],"category_scores_gemma":[0.014565862,0.00058068056,0.0008530571,0.0045317216,0.001084451,0.0036564157,0.0022022529,0.001116179,0.003469993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043887843,0.00007748102,0.039939404,0.0004644613,0.00018883967,0.00063060806,0.00022513658,0.7910873,0.003005734,0.07145623,0.006007067,0.086478725],"study_design_scores_gemma":[0.00003575553,0.00019855991,0.013838166,0.00007548266,0.00013867865,0.001385703,0.00019046341,0.9157887,0.001970572,0.05855101,0.0077082054,0.00011870549],"about_ca_topic_score_codex":0.0026211157,"about_ca_topic_score_gemma":0.0021729947,"teacher_disagreement_score":0.010140171,"about_ca_system_score_codex":0.0007876464,"about_ca_system_score_gemma":0.00046334232,"threshold_uncertainty_score":0.033922255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7395509,0.00097399706,0.21401337,0.0012987946,0.00025475633,0.0000863846,0.00023466547,0.00032096708,0.043266226],"genre_scores_gemma":[0.9909394,0.000097792064,0.003496322,0.000014888822,0.000030443229,0.000009572337,0.000032017433,0.000018130178,0.005361541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993662,0.00026585764,0.000017248069,0.00006453611,0.00012777539,0.00015823347],"domain_scores_gemma":[0.998602,0.00090555736,0.00009600218,0.000119794044,0.00011108274,0.00016563851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012052878,0.0004911578,0.0009796564,0.00062927563,0.00050728227,0.0026022173,0.0015351869,0.0012155175,0.012357929],"category_scores_gemma":[0.0042866124,0.0005191232,0.0006803556,0.0008460601,0.0007575225,0.0029268905,0.00090906466,0.0012094906,0.00046131221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001578515,0.00043394513,0.0021962817,0.00008850635,0.000082182734,0.0011349391,0.00018639895,0.7206608,0.0050252033,0.18906821,0.00405794,0.075487114],"study_design_scores_gemma":[0.000050305385,0.00010573124,0.00065154943,0.00000742689,0.000022060516,0.00013986131,0.00006181775,0.97023815,0.00057301717,0.027140647,0.0009911879,0.000018328514],"about_ca_topic_score_codex":0.0013907884,"about_ca_topic_score_gemma":0.001066824,"teacher_disagreement_score":0.012357929,"about_ca_system_score_codex":0.0015525749,"about_ca_system_score_gemma":0.00041429244,"threshold_uncertainty_score":0.041341364},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017878752,0.00029067305,0.9784863,0.00008132353,0.000024878318,0.00017181502,0.00008395816,0.00027358206,0.0027086628],"genre_scores_gemma":[0.3597074,0.00045354373,0.63787025,0.00003114048,0.000032130887,0.00044081677,0.00018549425,0.00009491447,0.001184452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895963,0.0043420484,0.0006368237,0.0004133619,0.004677895,0.0003334871],"domain_scores_gemma":[0.99421716,0.0032801027,0.00053232815,0.0004507267,0.0013745542,0.00014508519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0102277715,0.0022966757,0.0029958624,0.009034612,0.0010907956,0.0044685327,0.0011010917,0.001364078,0.002788954],"category_scores_gemma":[0.015504617,0.00076861883,0.0020273197,0.009780343,0.0008712399,0.0042731697,0.002299923,0.0011782858,0.0007364026],"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.00062257244,0.000635717,0.0051946756,0.0012640483,0.0007127278,0.0001559001,0.00092974736,0.256565,0.013457112,0.06223723,0.0021530646,0.65607214],"study_design_scores_gemma":[0.000068811234,0.0004932579,0.0030889257,0.0001505308,0.00028404337,0.00015406366,0.00034472882,0.9491018,0.012759574,0.030150926,0.0032508965,0.00015245008],"about_ca_topic_score_codex":0.001959287,"about_ca_topic_score_gemma":0.0015104071,"teacher_disagreement_score":0.0102277715,"about_ca_system_score_codex":0.0017310295,"about_ca_system_score_gemma":0.0026697144,"threshold_uncertainty_score":0.05409026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04854432,0.00022269298,0.9464137,0.00009580107,0.000038937902,0.000059504036,0.00016797104,0.00043859484,0.0040184404],"genre_scores_gemma":[0.88130426,0.00020509918,0.11231908,0.000043759683,0.000033225813,0.000104950894,0.0002889539,0.00010278864,0.005597896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996001,0.00011670958,0.0000112411035,0.00007557302,0.000105805084,0.00009065615],"domain_scores_gemma":[0.99915195,0.00057624315,0.00008571632,0.000054625863,0.000085784195,0.000045723737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006976919,0.0007063864,0.0012557021,0.0007121093,0.00050778536,0.0010287846,0.0015292765,0.0012245108,0.005158586],"category_scores_gemma":[0.0019633772,0.00059900584,0.0007810642,0.0011626086,0.00085908273,0.001386091,0.0009343134,0.00066713226,0.00035726564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094661,0.000038159647,0.00015332106,0.000026181282,0.0000106774405,0.00001557065,0.00001205668,0.9819449,0.0006201082,0.0038091945,0.0003102581,0.012964861],"study_design_scores_gemma":[0.000004309877,0.00002226499,0.00003740395,0.0000010091122,0.0000025081508,0.0000019868296,0.0000019758381,0.9969252,0.0002222126,0.0026745293,0.00010466772,0.000001962993],"about_ca_topic_score_codex":0.014016591,"about_ca_topic_score_gemma":0.0074050887,"teacher_disagreement_score":0.014016591,"about_ca_system_score_codex":0.000980005,"about_ca_system_score_gemma":0.0010187271,"threshold_uncertainty_score":0.02787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13794497,0.0018015327,0.8433081,0.0011176133,0.0003058233,0.00073904404,0.00050978066,0.0008049468,0.013468263],"genre_scores_gemma":[0.5954022,0.00043163123,0.39978224,0.00030428162,0.00011282648,0.00039094314,0.0004543288,0.00015692231,0.0029646873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844813,0.00072030653,0.00006294274,0.00015245957,0.00018902092,0.00042715346],"domain_scores_gemma":[0.9949351,0.004034214,0.00025701354,0.00015556715,0.000279647,0.00033845875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027345899,0.001322198,0.0022999372,0.0022450183,0.0016314929,0.0021406047,0.0035745488,0.0030922105,0.0060567325],"category_scores_gemma":[0.005393454,0.0011752303,0.0012980601,0.0025111516,0.001428203,0.002582256,0.0018759926,0.0015148188,0.0005639451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025651656,0.0001731832,0.00058471743,0.00009484463,0.00007654091,0.00012296125,0.000106449115,0.9610607,0.00050601724,0.0056410027,0.0022671847,0.02910992],"study_design_scores_gemma":[0.00009271952,0.000078151716,0.00016107145,0.000012345684,0.00002325126,0.00002629103,0.000060400354,0.9950837,0.00017754243,0.0037950866,0.0004760407,0.000013468661],"about_ca_topic_score_codex":0.017380942,"about_ca_topic_score_gemma":0.018114211,"teacher_disagreement_score":0.017380942,"about_ca_system_score_codex":0.0026821462,"about_ca_system_score_gemma":0.0036396352,"threshold_uncertainty_score":0.034559548},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009149974,0.00013538908,0.9866991,0.00011550166,0.00004041549,0.0000746536,0.00006723865,0.00033259622,0.0033850758],"genre_scores_gemma":[0.27886644,0.0003340671,0.7162992,0.000079756814,0.000073832394,0.00033236033,0.00028576973,0.00022551227,0.0035030255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984755,0.00037036417,0.00007494599,0.00021949463,0.00067217124,0.00018750002],"domain_scores_gemma":[0.99843997,0.00084143836,0.000205071,0.00018092844,0.00025154356,0.00008113597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068037,0.0011590746,0.0021470657,0.0012731252,0.00077891536,0.0032210203,0.0020869174,0.0011596688,0.0033987935],"category_scores_gemma":[0.003433221,0.0017280205,0.001801088,0.0029986284,0.000718295,0.0027353873,0.0015596658,0.0019527745,0.00064243964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008791788,0.00010212745,0.00016822448,0.00005885249,0.00004184253,0.000029817704,0.00001977623,0.95375556,0.0016040708,0.012522312,0.0004301947,0.031179218],"study_design_scores_gemma":[0.000012591695,0.000022628788,0.0000438512,0.000003248807,0.000009868868,0.000005695323,0.0000038464996,0.99499017,0.0006569449,0.0037592992,0.000487197,0.000004541426],"about_ca_topic_score_codex":0.0071553257,"about_ca_topic_score_gemma":0.007887901,"teacher_disagreement_score":0.0071553257,"about_ca_system_score_codex":0.001800297,"about_ca_system_score_gemma":0.0037326494,"threshold_uncertainty_score":0.01422739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019356808,0.0011982877,0.9733176,0.002711203,0.00008339616,0.000053182644,0.000075744945,0.00006850854,0.0031352309],"genre_scores_gemma":[0.68723834,0.0021243647,0.30858207,0.00031215465,0.0002734595,0.00020801382,0.00011888167,0.000055854754,0.0010868027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939453,0.0034621612,0.0004851677,0.0005839762,0.0011454435,0.0003779978],"domain_scores_gemma":[0.9843449,0.010947167,0.0015671568,0.0017218277,0.00083027204,0.0005886028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008552919,0.0010618597,0.002893732,0.0020920378,0.0010463189,0.0073469635,0.0024843744,0.0024730735,0.0016198239],"category_scores_gemma":[0.02609897,0.001085374,0.001760639,0.0033803922,0.0046563228,0.011226915,0.004275339,0.0045460775,0.00022854134],"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.00008175981,0.00007516066,0.0007712887,0.00018487764,0.00009678212,0.00009529474,0.00032480241,0.28149334,0.00059508736,0.6963155,0.0005496852,0.019416438],"study_design_scores_gemma":[0.000011225453,0.000014444975,0.00012676418,0.000042905427,0.0000215186,0.000014898379,0.00005941306,0.37530756,0.0001388808,0.6236694,0.0005763431,0.000016682385],"about_ca_topic_score_codex":0.0030459533,"about_ca_topic_score_gemma":0.002264515,"teacher_disagreement_score":0.008552919,"about_ca_system_score_codex":0.0028833214,"about_ca_system_score_gemma":0.0027507688,"threshold_uncertainty_score":0.045232713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9225184,0.00017134252,0.06411144,0.00036457067,0.000041616146,0.00010432367,0.00013336688,0.00008117804,0.012473871],"genre_scores_gemma":[0.994255,0.000031756845,0.0035586625,0.000012205709,0.000007709204,0.000019568257,0.000031289674,0.0000053982694,0.002078293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795425,0.00049486314,0.00016432654,0.000536089,0.0003264759,0.00052400725],"domain_scores_gemma":[0.99193984,0.004769054,0.0013005809,0.0007475763,0.00064128626,0.0006017158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029572097,0.00047680715,0.0011870068,0.00069708115,0.001240438,0.0030803108,0.0022913597,0.0013015561,0.0051051],"category_scores_gemma":[0.008627673,0.0009680981,0.0006346914,0.0016013058,0.0013325245,0.002619295,0.0016093204,0.0005531518,0.00040542052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030068122,0.00062900444,0.019812683,0.00015125316,0.00025567616,0.0007316675,0.00141032,0.8734475,0.0055449265,0.030307852,0.0018028801,0.062899396],"study_design_scores_gemma":[0.00014768029,0.0004175913,0.011528758,0.000019304916,0.00016993587,0.0001855924,0.00156283,0.94647545,0.0022379889,0.035896547,0.0012838164,0.000074597454],"about_ca_topic_score_codex":0.007862425,"about_ca_topic_score_gemma":0.0069476604,"teacher_disagreement_score":0.007862425,"about_ca_system_score_codex":0.0019825415,"about_ca_system_score_gemma":0.0023386702,"threshold_uncertainty_score":0.01707828},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14826664,0.0013581024,0.8077226,0.0022389176,0.00022303037,0.00008621447,0.00044757666,0.00010139982,0.039555587],"genre_scores_gemma":[0.8789326,0.001034226,0.10494469,0.00022694864,0.00038197546,0.000118436714,0.00055153016,0.00006973327,0.013739805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821067,0.000936241,0.0000696537,0.00024638392,0.0003699453,0.00016713436],"domain_scores_gemma":[0.99465793,0.0034753357,0.00043488183,0.00049211405,0.00056882383,0.0003708881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027226794,0.00063646655,0.0010589705,0.0010764247,0.00055440725,0.0023740174,0.0011813146,0.0017056211,0.0062811663],"category_scores_gemma":[0.012466589,0.00030548492,0.0007783318,0.0015495502,0.0012135012,0.0036312859,0.0012425149,0.0015369656,0.00034160918],"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.0001809284,0.000058277295,0.00038036142,0.000115392795,0.00006369417,0.00015565382,0.00016797382,0.13150126,0.0007491768,0.83880913,0.004257734,0.023560382],"study_design_scores_gemma":[0.000028899005,0.000035835015,0.00028285815,0.00001672961,0.000013067358,0.000086931024,0.000052183867,0.40851882,0.00036196364,0.58788466,0.00269791,0.000020164349],"about_ca_topic_score_codex":0.0013256428,"about_ca_topic_score_gemma":0.0006509741,"teacher_disagreement_score":0.0062811663,"about_ca_system_score_codex":0.0010782388,"about_ca_system_score_gemma":0.00069698214,"threshold_uncertainty_score":0.021012604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01584273,0.098713614,0.63451886,0.1768271,0.005508656,0.000063235486,0.0002978651,0.00025111155,0.06797681],"genre_scores_gemma":[0.62241685,0.076476045,0.24810317,0.011163117,0.022343623,0.0005258114,0.00032398838,0.00031682447,0.018330589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954211,0.0023243492,0.00019605216,0.00041734194,0.0014103121,0.00023079426],"domain_scores_gemma":[0.9767305,0.019274933,0.00047557228,0.0013481134,0.001535437,0.00063544814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007917574,0.0008976896,0.0026414355,0.001710287,0.0017989958,0.008490801,0.003682819,0.0055298284,0.0069953674],"category_scores_gemma":[0.02855567,0.000852684,0.0009910889,0.002788527,0.012216593,0.0119092185,0.0032286183,0.01068207,0.00082404935],"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.000010599633,0.000026646663,0.00006582225,0.00010030849,0.00000995134,0.00001731238,0.000047443005,0.006153805,0.00004694254,0.98025423,0.003976397,0.0092906],"study_design_scores_gemma":[0.000006115987,0.000006205585,0.00003072247,0.000025016285,0.0000018238193,0.000009762812,0.000033934877,0.0191036,0.000018713778,0.9756471,0.005111305,0.0000057222637],"about_ca_topic_score_codex":0.0022363341,"about_ca_topic_score_gemma":0.0014564431,"teacher_disagreement_score":0.008490801,"about_ca_system_score_codex":0.0029578647,"about_ca_system_score_gemma":0.003032524,"threshold_uncertainty_score":0.04187262},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15127283,0.007086813,0.7705756,0.02225435,0.0013677116,0.0003697614,0.0005238248,0.00041587665,0.04613339],"genre_scores_gemma":[0.93530995,0.001592715,0.04845816,0.0009809092,0.0007912793,0.00008920108,0.00012180847,0.0002264254,0.012429478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702483,0.0013353744,0.00009895346,0.00026211343,0.00056085346,0.00071774545],"domain_scores_gemma":[0.99299884,0.0051924475,0.0002627184,0.0002872945,0.0009280864,0.00033065883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060126595,0.0010463652,0.001948943,0.0014151953,0.0011774455,0.00424222,0.0030381933,0.0027430227,0.009323987],"category_scores_gemma":[0.022326982,0.0005247669,0.00129905,0.0017825213,0.0013662038,0.0055384543,0.0018815043,0.0023615102,0.00033635827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031470234,0.00015568038,0.0018617591,0.00032103053,0.00006710215,0.00035000607,0.0001468689,0.57333815,0.001630301,0.38914797,0.010357138,0.022309259],"study_design_scores_gemma":[0.0000107980095,0.00003300742,0.00037200731,0.00002467892,0.000022969482,0.00005231917,0.00005213717,0.9540074,0.00032672365,0.044500157,0.0005827229,0.000015122307],"about_ca_topic_score_codex":0.02082839,"about_ca_topic_score_gemma":0.01086259,"teacher_disagreement_score":0.02082839,"about_ca_system_score_codex":0.004870712,"about_ca_system_score_gemma":0.0044778674,"threshold_uncertainty_score":0.04141432},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030607289,0.012793639,0.8512679,0.04386288,0.003613202,0.00018806738,0.00014321049,0.0012937392,0.05623008],"genre_scores_gemma":[0.6422248,0.0066763735,0.30655006,0.009884172,0.002815282,0.00032058236,0.00024317206,0.00083689834,0.030448688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815243,0.00066665787,0.000051425377,0.00034834436,0.0005293274,0.00025179362],"domain_scores_gemma":[0.99337405,0.0034641798,0.0003243682,0.0012699685,0.0012254481,0.00034196454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033607043,0.00070680457,0.0014022874,0.00060978107,0.0013167609,0.002662456,0.0020433324,0.0031008138,0.017295994],"category_scores_gemma":[0.01496126,0.00038234584,0.00061809097,0.0011847917,0.002474088,0.007365226,0.0019824111,0.0019620564,0.0041152453],"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.00050067325,0.0002252778,0.0023190894,0.00082780566,0.00017761509,0.00015026158,0.00039375684,0.05683233,0.003685737,0.18727681,0.052904326,0.6947062],"study_design_scores_gemma":[0.00021343671,0.0002574743,0.001531238,0.0004951375,0.00010109997,0.000482212,0.0007499708,0.22061634,0.0031232531,0.70180684,0.07051214,0.00011082429],"about_ca_topic_score_codex":0.0034865441,"about_ca_topic_score_gemma":0.0027224997,"teacher_disagreement_score":0.017295994,"about_ca_system_score_codex":0.0007114554,"about_ca_system_score_gemma":0.0013414167,"threshold_uncertainty_score":0.05786085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20704064,0.001459338,0.7781508,0.00044624132,0.00006780836,0.0003680171,0.00022708722,0.00030742807,0.011932645],"genre_scores_gemma":[0.8791823,0.0005970467,0.118947335,0.00002394038,0.000031618543,0.0001378883,0.00013147936,0.00004105851,0.0009073313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99058175,0.0044383206,0.00071674836,0.00034674298,0.0035467797,0.00036964144],"domain_scores_gemma":[0.98616713,0.009474636,0.0010908043,0.0008348401,0.0023036522,0.00012898831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012318503,0.001206942,0.0022680762,0.0064378246,0.0006597438,0.0042562867,0.0004837455,0.0008717157,0.0013057932],"category_scores_gemma":[0.032212857,0.000420795,0.0012324789,0.004462807,0.0005626429,0.002555143,0.0014425163,0.0010287273,0.0002573831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053314265,0.00016024434,0.010164,0.0005809594,0.00052075565,0.0002396526,0.00045299492,0.66741335,0.007540759,0.05674633,0.0012354113,0.25441238],"study_design_scores_gemma":[0.000046153007,0.00020987504,0.004952671,0.00009533785,0.00012329342,0.00006413842,0.00028130758,0.95569456,0.006337681,0.029778225,0.002358939,0.000057812867],"about_ca_topic_score_codex":0.001980514,"about_ca_topic_score_gemma":0.0012469811,"teacher_disagreement_score":0.012318503,"about_ca_system_score_codex":0.0019498012,"about_ca_system_score_gemma":0.0023185033,"threshold_uncertainty_score":0.06514728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903138,0.0003316498,0.0028285657,0.0013139803,0.00008468178,0.000086186286,0.00018338895,0.00008772889,0.004770019],"genre_scores_gemma":[0.998395,0.000058778754,0.0005169781,0.000053573563,0.00002520128,0.000009731585,0.00006434501,0.0000071733966,0.0008691698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9878846,0.0059987484,0.0005952568,0.00108362,0.0014103872,0.0030274051],"domain_scores_gemma":[0.7834521,0.17561276,0.015376029,0.009911736,0.008394219,0.0072531644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018130314,0.0011069936,0.0015448638,0.0014555024,0.0014499576,0.0063098725,0.0032970496,0.0049284725,0.0115595],"category_scores_gemma":[0.07773241,0.0010166275,0.0013817884,0.0022265424,0.0026976934,0.0100113535,0.003029763,0.0025944146,0.0006534882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.03587615,0.008017983,0.08203314,0.0005629323,0.00075831875,0.0016414714,0.0010937555,0.748339,0.005940453,0.025880696,0.0034649349,0.08639112],"study_design_scores_gemma":[0.0024400682,0.011436626,0.06314333,0.00019827796,0.002193836,0.00044873194,0.006996298,0.8611929,0.008614992,0.040004253,0.002936569,0.00039421377],"about_ca_topic_score_codex":0.013557991,"about_ca_topic_score_gemma":0.0072411573,"teacher_disagreement_score":0.018130314,"about_ca_system_score_codex":0.0041065915,"about_ca_system_score_gemma":0.004388601,"threshold_uncertainty_score":0.09588343},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033977207,0.00018659353,0.9135185,0.0019051472,0.0006799775,0.0069441753,0.010807432,0.0014932253,0.030487841],"genre_scores_gemma":[0.4111009,0.0003557592,0.5219219,0.000784552,0.00029493292,0.03174212,0.007815939,0.0006307279,0.025353175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.975464,0.017501835,0.0008474625,0.0019564892,0.0032795728,0.00095061446],"domain_scores_gemma":[0.9447896,0.035171974,0.0027467788,0.010092955,0.006328171,0.00087048125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.034250405,0.0011385889,0.0010250855,0.0011012768,0.0007759757,0.003335675,0.0017498203,0.0016325278,0.0523968],"category_scores_gemma":[0.11696586,0.0008642816,0.0016881588,0.0012334295,0.0025067185,0.0019808165,0.0017158485,0.0037669097,0.00769734],"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.0049568852,0.000942393,0.007274776,0.0007176044,0.00027956124,0.0002011467,0.00047137693,0.108387075,0.0045421934,0.6836302,0.048563883,0.14003283],"study_design_scores_gemma":[0.0017932256,0.0034910645,0.01745503,0.00031043237,0.00024687476,0.00018665589,0.0004357177,0.50139976,0.024234684,0.34933385,0.1008434,0.0002694343],"about_ca_topic_score_codex":0.002774304,"about_ca_topic_score_gemma":0.001681578,"teacher_disagreement_score":0.0523968,"about_ca_system_score_codex":0.0027682171,"about_ca_system_score_gemma":0.005910887,"threshold_uncertainty_score":0.18113565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22657642,0.0018669354,0.7393933,0.002180371,0.00063527125,0.0008847812,0.0011857443,0.00048230862,0.026794836],"genre_scores_gemma":[0.8975786,0.0013236253,0.08026789,0.00031539143,0.00048166033,0.00040470343,0.00080261414,0.00024890326,0.018576646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974661,0.0011276655,0.00011577937,0.00041725853,0.00035642172,0.000516863],"domain_scores_gemma":[0.992857,0.0047482764,0.0009169364,0.00037002488,0.00043002304,0.00067782763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036409511,0.0030047714,0.0037532323,0.0013623973,0.001687333,0.003487732,0.0036017115,0.004643271,0.010023862],"category_scores_gemma":[0.008915849,0.0021790254,0.0013720295,0.0032306842,0.0015871329,0.00434009,0.0027062434,0.0023081077,0.0007847135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048636858,0.0002038024,0.0004468891,0.00020756593,0.00008910491,0.00032122727,0.000073859585,0.9750797,0.00087751093,0.0070652417,0.0018192161,0.0133294985],"study_design_scores_gemma":[0.00012004415,0.00020798123,0.00021125302,0.000016700711,0.000040114308,0.00007470214,0.00005817192,0.9836668,0.0005707439,0.014126891,0.000891429,0.000015240984],"about_ca_topic_score_codex":0.0045161806,"about_ca_topic_score_gemma":0.0037287557,"teacher_disagreement_score":0.010023862,"about_ca_system_score_codex":0.0022384995,"about_ca_system_score_gemma":0.0014953377,"threshold_uncertainty_score":0.033533156},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050305072,0.030686064,0.37479562,0.101059176,0.008983873,0.0001951744,0.0012802511,0.00028825988,0.4324064],"genre_scores_gemma":[0.811194,0.023591423,0.06551085,0.00834691,0.013029832,0.00019922803,0.00046118742,0.0003316684,0.07733497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667704,0.0012385397,0.00020959922,0.00050561386,0.0009920945,0.00037711565],"domain_scores_gemma":[0.98142034,0.0131251095,0.00084966474,0.002098484,0.0020871724,0.0004193179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027240396,0.0012670689,0.0015132834,0.0014976142,0.0023169576,0.004986604,0.0030551737,0.006138118,0.01565408],"category_scores_gemma":[0.021802956,0.0008198583,0.0023603926,0.0049780565,0.0067585893,0.015697356,0.0034238477,0.00880869,0.0017297898],"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.000036466157,0.000011431986,0.000168879,0.00014498702,0.00002065583,0.0003626757,0.0001275764,0.010589253,0.00018924827,0.9727501,0.008032764,0.007565914],"study_design_scores_gemma":[0.000008160539,0.00001250342,0.00012421218,0.0000594092,0.00001117464,0.00015364555,0.0000600396,0.0064718383,0.000063673164,0.9780661,0.014950293,0.00001893978],"about_ca_topic_score_codex":0.00724545,"about_ca_topic_score_gemma":0.0061616492,"teacher_disagreement_score":0.01565408,"about_ca_system_score_codex":0.0036491859,"about_ca_system_score_gemma":0.0017516086,"threshold_uncertainty_score":0.052368164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025564665,0.0005216666,0.9664835,0.00016761111,0.0000846302,0.0001795773,0.00014759135,0.0013705366,0.005480263],"genre_scores_gemma":[0.22739004,0.00024589608,0.76764464,0.00015743353,0.00004113924,0.00055288145,0.00029467428,0.00019780421,0.0034754823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947304,0.00023046319,0.000022975577,0.00005601607,0.00014915041,0.00006828252],"domain_scores_gemma":[0.99891317,0.0007240347,0.00007169256,0.000060104405,0.0001855282,0.000045523957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00177775,0.00087337976,0.001393335,0.0017731013,0.0008575926,0.0009010968,0.001986074,0.0015608595,0.006496226],"category_scores_gemma":[0.0034070069,0.00061340904,0.00073523645,0.001949199,0.0005622665,0.0009406937,0.0009705936,0.0011839607,0.0008464701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025186327,0.00014731221,0.00033155287,0.00015543356,0.000078314035,0.000057508285,0.000082866994,0.79995257,0.00212937,0.007195865,0.0037850845,0.18583234],"study_design_scores_gemma":[0.000048127033,0.000054005355,0.00007703009,0.00000825447,0.000014389888,0.000015447964,0.000007824422,0.997322,0.00043670056,0.0015331695,0.00047788385,0.0000052013047],"about_ca_topic_score_codex":0.0069533275,"about_ca_topic_score_gemma":0.0060511804,"teacher_disagreement_score":0.0069533275,"about_ca_system_score_codex":0.0010076243,"about_ca_system_score_gemma":0.0018294514,"threshold_uncertainty_score":0.021732032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1699277,0.0016997785,0.8196302,0.0005875221,0.00010657681,0.00023888642,0.00022125854,0.0005517852,0.0070362873],"genre_scores_gemma":[0.9782981,0.0005453677,0.018941738,0.00004925016,0.000044593304,0.00008709065,0.00007806592,0.00005891758,0.00189683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973761,0.0010877029,0.0001674092,0.0002411203,0.00057868316,0.0005489856],"domain_scores_gemma":[0.9827727,0.012766995,0.0017133876,0.0009959843,0.001358321,0.0003925654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066725775,0.0016281124,0.0024181285,0.0013283374,0.0007340201,0.0036916898,0.0031059992,0.0017414918,0.0026395808],"category_scores_gemma":[0.028436864,0.0015670193,0.0013859529,0.0014746576,0.001471994,0.0050617275,0.0019650036,0.0026747915,0.00029190723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019678309,0.000069911956,0.00023522625,0.00010268221,0.000026407868,0.000060888564,0.000118505566,0.97440356,0.0006268472,0.012746523,0.00029390835,0.011118823],"study_design_scores_gemma":[0.00001863497,0.00009884163,0.00018707362,0.000019871377,0.000026110618,0.000035110454,0.000027352477,0.9913146,0.00031570432,0.007814525,0.00012413738,0.000018095441],"about_ca_topic_score_codex":0.0035373196,"about_ca_topic_score_gemma":0.0025426815,"teacher_disagreement_score":0.0066725775,"about_ca_system_score_codex":0.0024027536,"about_ca_system_score_gemma":0.0026238982,"threshold_uncertainty_score":0.035288393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33892292,0.00042089308,0.65103066,0.00040126676,0.00013668464,0.00011850207,0.0004996942,0.00025306057,0.008216297],"genre_scores_gemma":[0.9515821,0.00029216288,0.04171367,0.00003134048,0.000131892,0.00008839976,0.0003128376,0.000073590214,0.0057739597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991837,0.00030289753,0.00002791976,0.00016140766,0.0001298151,0.00019429658],"domain_scores_gemma":[0.9967039,0.0019223368,0.0007579106,0.00023333926,0.00017803715,0.0002045111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017133362,0.00069068035,0.0011919218,0.00058244355,0.0003870508,0.00093566836,0.0016969411,0.0010177502,0.004210863],"category_scores_gemma":[0.0066357795,0.0009966162,0.0006739663,0.0013211563,0.00055012666,0.0014797766,0.0006184755,0.00093849684,0.000308259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001528856,0.000038241815,0.00051799853,0.000032162505,0.000020286865,0.00014346489,0.000021155462,0.9798677,0.0004056479,0.011275636,0.00076435803,0.0067604478],"study_design_scores_gemma":[0.000021229336,0.000035732126,0.0003422634,0.0000029967284,0.000010967705,0.00003481702,0.000010887648,0.9914231,0.00012154003,0.0077663767,0.00022448698,0.0000056579365],"about_ca_topic_score_codex":0.0056827967,"about_ca_topic_score_gemma":0.0062549883,"teacher_disagreement_score":0.0056827967,"about_ca_system_score_codex":0.00078796543,"about_ca_system_score_gemma":0.0010223658,"threshold_uncertainty_score":0.014086723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9023828,0.0003249372,0.08293791,0.0010545712,0.00008388028,0.00017330132,0.0010435726,0.00034662234,0.011652452],"genre_scores_gemma":[0.9913809,0.00008408909,0.004768383,0.000023928988,0.00000956304,0.000043136464,0.00021504973,0.000022155951,0.0034527741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989957,0.000396692,0.000053535594,0.00025337707,0.00006657278,0.0002340032],"domain_scores_gemma":[0.9984316,0.0007873429,0.00024771632,0.00011375161,0.00027698497,0.00014257732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001336371,0.0007778654,0.0015069334,0.0008143868,0.00072089094,0.0022306119,0.002916819,0.0025990226,0.0033251985],"category_scores_gemma":[0.003010169,0.00087105605,0.0012118845,0.0012825265,0.00095414836,0.001832301,0.0014056849,0.001149034,0.0004195541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045422326,0.00002696692,0.0007950706,0.000008604592,0.00001713146,0.00007490654,0.000021860438,0.99610823,0.000078783974,0.0013338459,0.0001561319,0.001332999],"study_design_scores_gemma":[0.000012474642,0.000018964955,0.00029607164,0.0000023408106,0.000009364905,0.000017361297,0.000048237052,0.9986576,0.00004506344,0.00074706663,0.0001376769,0.000007751142],"about_ca_topic_score_codex":0.13432454,"about_ca_topic_score_gemma":0.06979929,"teacher_disagreement_score":0.13432454,"about_ca_system_score_codex":0.0051923622,"about_ca_system_score_gemma":0.0031666334,"threshold_uncertainty_score":0.26708537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21364096,0.0008503175,0.75810754,0.00094760035,0.00018410076,0.00019420306,0.0012986521,0.0005475806,0.024228986],"genre_scores_gemma":[0.9501777,0.0002480241,0.03832042,0.00008735982,0.000028821732,0.00018476305,0.0003341188,0.00008961284,0.010529259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999658,0.000105976214,0.00001672169,0.00008084897,0.000049538496,0.00008897561],"domain_scores_gemma":[0.99921775,0.0004818259,0.00009415003,0.0000302462,0.00011397794,0.000062084786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009997864,0.0007693762,0.0015958393,0.000701767,0.00051856064,0.0016307661,0.0018552655,0.0024875754,0.0063923174],"category_scores_gemma":[0.0022235499,0.0009974203,0.0012312897,0.0010954353,0.00072404044,0.0012389064,0.0011045007,0.0012254588,0.0004491266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008432383,0.0000058208884,0.000062145635,0.0000047935237,0.0000061604437,0.0000081986045,0.0000033696624,0.9987482,0.000059866812,0.00041240614,0.000054555585,0.00062601676],"study_design_scores_gemma":[0.0000039782826,0.0000063336583,0.000054360476,0.0000012957577,0.0000034490886,0.0000018330919,0.0000028262948,0.99954873,0.000023394936,0.00027938018,0.00007264987,0.0000017511899],"about_ca_topic_score_codex":0.0382681,"about_ca_topic_score_gemma":0.02273446,"teacher_disagreement_score":0.0382681,"about_ca_system_score_codex":0.0017242269,"about_ca_system_score_gemma":0.0017848451,"threshold_uncertainty_score":0.07609069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49823722,0.0026218495,0.4432317,0.0041105137,0.00053824804,0.000416897,0.0035774119,0.0005347474,0.04673145],"genre_scores_gemma":[0.94920266,0.0010085833,0.028058868,0.00023148577,0.00022993045,0.00014488689,0.0014565836,0.00018233509,0.019484658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852633,0.00057205156,0.00006754851,0.00031718815,0.00015554432,0.000361379],"domain_scores_gemma":[0.99713886,0.0017965314,0.00028423857,0.00017156768,0.00018765427,0.0004211538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014274645,0.0016517248,0.0031352947,0.0010945972,0.0009996325,0.0025760895,0.0042687044,0.0032709467,0.014308071],"category_scores_gemma":[0.006155384,0.0015453987,0.0012848153,0.002596118,0.0013618104,0.0035724351,0.0019280344,0.0019306542,0.00089521083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090770074,0.00024912212,0.0013499252,0.00048682216,0.00014332276,0.0008738261,0.00014665288,0.91446644,0.0011607821,0.04907617,0.0101435855,0.02099573],"study_design_scores_gemma":[0.00014962339,0.00017892075,0.00072284,0.000056027067,0.00007045225,0.00028823395,0.00034949445,0.9333266,0.0004833049,0.061604075,0.0027231546,0.000047377456],"about_ca_topic_score_codex":0.008203829,"about_ca_topic_score_gemma":0.0040267385,"teacher_disagreement_score":0.014308071,"about_ca_system_score_codex":0.0015411099,"about_ca_system_score_gemma":0.0011039722,"threshold_uncertainty_score":0.04786527},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013612582,0.00023597149,0.9974022,0.00008118756,0.000017140681,0.0000066772077,0.000018078736,0.00003794541,0.00083949714],"genre_scores_gemma":[0.46287307,0.004265694,0.5136257,0.00021557328,0.00065108825,0.00018170057,0.00043222975,0.00059110956,0.017163794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984066,0.00070863304,0.00007640344,0.00025094597,0.0004418235,0.00011560772],"domain_scores_gemma":[0.99531144,0.003279629,0.0003593364,0.00036867175,0.0005653576,0.00011557181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031773837,0.001591169,0.0021032179,0.0018868813,0.0005412981,0.0027212196,0.0021369879,0.0011465477,0.003726673],"category_scores_gemma":[0.008835317,0.00084608793,0.0021703648,0.0019686439,0.0015101841,0.0031519155,0.0016659129,0.002707147,0.0008036949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100075595,0.000069184876,0.000365659,0.00020633842,0.00015823398,0.00020726911,0.00012588159,0.74648,0.0038023936,0.16966893,0.0021953522,0.07662076],"study_design_scores_gemma":[0.0000017999946,0.000011836222,0.00007000325,0.0000066301736,0.000013287697,0.000017167244,0.000009679792,0.9833846,0.0005131903,0.015362255,0.0006028805,0.000006604067],"about_ca_topic_score_codex":0.004539923,"about_ca_topic_score_gemma":0.0019120432,"teacher_disagreement_score":0.004539923,"about_ca_system_score_codex":0.0012514652,"about_ca_system_score_gemma":0.00087842566,"threshold_uncertainty_score":0.01680386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827618,0.0002255196,0.01407674,0.0005271385,0.000051084775,0.00005562997,0.0005861402,0.0002775108,0.0014384671],"genre_scores_gemma":[0.98717916,0.00012830769,0.01040807,0.00003256743,0.000031715947,0.00001463304,0.0009334513,0.00004770163,0.0012243849],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985172,0.00045156025,0.0001503583,0.00023928976,0.00048478204,0.00015683161],"domain_scores_gemma":[0.9694113,0.024604619,0.0016283651,0.0013886789,0.0025016684,0.00046525165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031703762,0.0005014916,0.0005067639,0.0021388228,0.00065555633,0.0011708841,0.0006854333,0.0010636557,0.00164188],"category_scores_gemma":[0.018236345,0.0003147766,0.00049992587,0.0021391811,0.0005508801,0.0010182239,0.00048643898,0.0007025763,0.0002629614],"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.0063520186,0.0014543098,0.3864293,0.00066882424,0.0009458971,0.0234308,0.004003987,0.3262716,0.023318695,0.026508603,0.01400146,0.18661456],"study_design_scores_gemma":[0.00012221071,0.0005359565,0.092378005,0.00004427179,0.00035792112,0.002634009,0.0020617475,0.879084,0.012615102,0.0047001895,0.0053854804,0.00008111593],"about_ca_topic_score_codex":0.007914106,"about_ca_topic_score_gemma":0.0046190666,"teacher_disagreement_score":0.007914106,"about_ca_system_score_codex":0.0009404743,"about_ca_system_score_gemma":0.00059590465,"threshold_uncertainty_score":0.016766727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033947352,0.00035392845,0.9609382,0.00039450775,0.0001131914,0.00006740429,0.000038796312,0.00038989913,0.003756651],"genre_scores_gemma":[0.51013684,0.00032742028,0.48300222,0.00018794814,0.00010523247,0.0001499747,0.00013634792,0.00025148166,0.0057025915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.00026647616,0.000034962868,0.00008586429,0.00015171428,0.000110384906],"domain_scores_gemma":[0.9970319,0.0019840184,0.00013911098,0.00023503126,0.0003395484,0.00027034475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979256,0.0007375916,0.0020878213,0.0012541058,0.0009601474,0.0019663058,0.0017944947,0.0025999523,0.0061115995],"category_scores_gemma":[0.0075100833,0.00097494863,0.0009709441,0.0017440636,0.0011258245,0.0019010467,0.0015772884,0.0023398197,0.00061588816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035687353,0.0002534266,0.00051596033,0.00012939188,0.00006495599,0.00012641452,0.00012535421,0.8413992,0.0020403408,0.054201696,0.0031209236,0.09766543],"study_design_scores_gemma":[0.000023094972,0.000028418846,0.00003854365,0.000007606108,0.000008503501,0.000013527076,0.000010027689,0.98765635,0.00014791903,0.011667278,0.00039112882,0.0000075614907],"about_ca_topic_score_codex":0.0041524107,"about_ca_topic_score_gemma":0.0043360265,"teacher_disagreement_score":0.0061115995,"about_ca_system_score_codex":0.001142289,"about_ca_system_score_gemma":0.0018307021,"threshold_uncertainty_score":0.020445287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39794448,0.0012033647,0.5743501,0.006585417,0.0010898495,0.00024008699,0.00082185934,0.00058476336,0.017180108],"genre_scores_gemma":[0.9613719,0.0005559481,0.017816471,0.0006038814,0.00049301836,0.000092671544,0.00024043773,0.000059465423,0.018766196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973584,0.0005750212,0.00012135851,0.0005034941,0.0006406978,0.000800954],"domain_scores_gemma":[0.98251534,0.010889955,0.0011154604,0.0005264702,0.0028649652,0.0020877582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005230092,0.0011567341,0.0023581514,0.0015986025,0.0025153058,0.004777698,0.0046723443,0.004336156,0.00792065],"category_scores_gemma":[0.017591858,0.0013260999,0.0011881759,0.0023413463,0.0029854989,0.0051126257,0.00288037,0.0030842682,0.0008589002],"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.0015357239,0.00057544437,0.0040575354,0.00026244615,0.00012921903,0.0017884792,0.000598305,0.3402941,0.0073271897,0.62618566,0.0073054065,0.009940459],"study_design_scores_gemma":[0.0002668559,0.00014298216,0.00043463957,0.000015439613,0.000056729303,0.00028429242,0.000085576714,0.9469066,0.0004881083,0.05036834,0.00088598,0.00006448442],"about_ca_topic_score_codex":0.013275593,"about_ca_topic_score_gemma":0.008260336,"teacher_disagreement_score":0.013275593,"about_ca_system_score_codex":0.005284316,"about_ca_system_score_gemma":0.004180243,"threshold_uncertainty_score":0.03834051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03359064,0.00035630047,0.95578253,0.001475523,0.000081567436,0.00009536535,0.000043454987,0.00013133262,0.008443345],"genre_scores_gemma":[0.8127115,0.0007768373,0.16848846,0.00053743046,0.00028871762,0.00030129557,0.000099381556,0.000083389146,0.016713064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982431,0.0009507431,0.000066714165,0.0002776705,0.00029977734,0.00016199204],"domain_scores_gemma":[0.99581736,0.002831685,0.00037103123,0.0002460235,0.0005086553,0.0002251223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039112773,0.0010702779,0.0018332753,0.0009135633,0.00060796645,0.002590716,0.0020181148,0.0029738292,0.0034902887],"category_scores_gemma":[0.01376784,0.00064607675,0.0011650198,0.0011333709,0.0015255888,0.0026300452,0.001978532,0.0015874312,0.0006738446],"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.00042966809,0.00021415133,0.0017011716,0.00017840549,0.0003095576,0.0003277645,0.00027533656,0.32234085,0.004262573,0.5930577,0.004706372,0.07219641],"study_design_scores_gemma":[0.00010517166,0.00015685649,0.00028861823,0.000033875487,0.00007983942,0.00014929302,0.000048527265,0.7971382,0.0008502481,0.19962978,0.0014876452,0.00003201302],"about_ca_topic_score_codex":0.00091375655,"about_ca_topic_score_gemma":0.00070180447,"teacher_disagreement_score":0.0039112773,"about_ca_system_score_codex":0.0013392766,"about_ca_system_score_gemma":0.0021396433,"threshold_uncertainty_score":0.020685017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017760696,0.0003385761,0.9799469,0.00023413774,0.00010914386,0.000052167514,0.000046211684,0.00061163,0.0009004425],"genre_scores_gemma":[0.3594109,0.00042202135,0.63536406,0.0002126544,0.00029660194,0.0004952556,0.00022751726,0.0003502862,0.003220648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877614,0.00046724448,0.00006410553,0.00019871235,0.00028353662,0.00021038546],"domain_scores_gemma":[0.987866,0.009306716,0.00064960914,0.0008785275,0.0009743379,0.00032483987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041725957,0.001669696,0.0020186047,0.0010009801,0.0011326148,0.0012906226,0.0029307003,0.0018735318,0.003099878],"category_scores_gemma":[0.014790813,0.0014834054,0.00094858103,0.0018672574,0.0013493313,0.0032116887,0.0020565845,0.0033880249,0.00050289655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002491536,0.00007734032,0.0002284939,0.000069760565,0.000030747433,0.00002233276,0.00004982231,0.93386215,0.0007610418,0.012502021,0.0013309614,0.050816298],"study_design_scores_gemma":[0.000028284203,0.000016165912,0.00003316732,0.000002141822,0.0000041256203,0.0000033151618,0.000002404801,0.9927408,0.00019649387,0.0068539977,0.00011606235,0.00000294281],"about_ca_topic_score_codex":0.0065090745,"about_ca_topic_score_gemma":0.007766013,"teacher_disagreement_score":0.0065090745,"about_ca_system_score_codex":0.002066183,"about_ca_system_score_gemma":0.004256391,"threshold_uncertainty_score":0.02206707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05115039,0.0012861419,0.9328056,0.0006897608,0.00020560183,0.00023915393,0.00037922538,0.00072107505,0.012523149],"genre_scores_gemma":[0.40678126,0.0011361494,0.5812555,0.0003063864,0.0001534051,0.00032823882,0.0007762502,0.00035511798,0.008907667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924135,0.00032939206,0.000030815285,0.000105600906,0.00013699569,0.00015584046],"domain_scores_gemma":[0.99785465,0.0015585165,0.0001612751,0.0001300615,0.0001496806,0.00014577688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001322858,0.0010355883,0.001149115,0.0012471367,0.00067639764,0.0012087655,0.0016069845,0.0012993452,0.0053880904],"category_scores_gemma":[0.0041640447,0.0008707345,0.0008809247,0.0018059209,0.0010104352,0.0015347712,0.001247953,0.0015690521,0.00054813037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011173023,0.00007485306,0.00027143265,0.0000974547,0.000036431025,0.000044787517,0.000054617,0.9290968,0.00043233158,0.033757545,0.004138593,0.031883396],"study_design_scores_gemma":[0.000054573302,0.000031513595,0.00010255061,0.000014959289,0.000012429097,0.000016361735,0.000022361452,0.97757494,0.0001515256,0.02031929,0.0016910189,0.000008488713],"about_ca_topic_score_codex":0.0124201225,"about_ca_topic_score_gemma":0.018573968,"teacher_disagreement_score":0.0124201225,"about_ca_system_score_codex":0.002063306,"about_ca_system_score_gemma":0.0029983732,"threshold_uncertainty_score":0.024695635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056126226,0.0011069451,0.9361356,0.00040504851,0.00014774576,0.000062576786,0.00007086053,0.00013108487,0.005813983],"genre_scores_gemma":[0.84205943,0.0016882198,0.1386451,0.000104467275,0.00055093435,0.00010399859,0.00026523735,0.00026695742,0.016315723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926277,0.0033277723,0.0005556015,0.0010230138,0.0016878152,0.00077807193],"domain_scores_gemma":[0.9737985,0.019610878,0.001266351,0.0030929146,0.0017249552,0.00050640997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009925728,0.001525835,0.0042347293,0.0012412759,0.00092814205,0.0045985826,0.003636151,0.0020977387,0.005113358],"category_scores_gemma":[0.028385852,0.0030497685,0.004215196,0.0039075413,0.0031617847,0.012673736,0.0028346812,0.002504292,0.0009970327],"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.0007536218,0.00034920673,0.0016149188,0.0004353548,0.00024433303,0.0005683601,0.00023232408,0.72450376,0.008623824,0.21062203,0.0020010856,0.050051134],"study_design_scores_gemma":[0.000018204613,0.00010584912,0.00033699934,0.000008056521,0.00004875697,0.00014771485,0.000026851434,0.932179,0.002249297,0.06426749,0.00056595576,0.000045808614],"about_ca_topic_score_codex":0.0022083868,"about_ca_topic_score_gemma":0.0013446297,"teacher_disagreement_score":0.009925728,"about_ca_system_score_codex":0.0012887967,"about_ca_system_score_gemma":0.0014281669,"threshold_uncertainty_score":0.052492857},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41651765,0.00024017986,0.5759504,0.00053778884,0.000021935202,0.00013719639,0.0001467406,0.00009285677,0.0063552447],"genre_scores_gemma":[0.9509783,0.00014459009,0.04461957,0.000036671863,0.000020752252,0.000120451754,0.000108112596,0.000022452963,0.003949143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732924,0.0014914245,0.00011973838,0.00044870158,0.00033445054,0.0002764439],"domain_scores_gemma":[0.97722685,0.01925037,0.0013093615,0.0009508989,0.0009662815,0.00029618182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071391077,0.0011166251,0.0018422367,0.0019083858,0.0008383968,0.0035191702,0.0020854631,0.0019589448,0.0028559815],"category_scores_gemma":[0.01730363,0.00085486105,0.0016327492,0.002307987,0.0016561925,0.004063415,0.0019605611,0.0017834548,0.00043925026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038260935,0.0005065991,0.00986508,0.0000978514,0.00034316574,0.00022361419,0.00043805302,0.8228772,0.0011680332,0.117002465,0.00061120273,0.0464841],"study_design_scores_gemma":[0.000012835157,0.000030568895,0.0013281094,0.000005919194,0.000029769692,0.000024988134,0.00005585481,0.97702825,0.00025359247,0.02107863,0.00013767113,0.000013733509],"about_ca_topic_score_codex":0.006541728,"about_ca_topic_score_gemma":0.0050310055,"teacher_disagreement_score":0.0071391077,"about_ca_system_score_codex":0.0019453502,"about_ca_system_score_gemma":0.0014780387,"threshold_uncertainty_score":0.03775561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2736018,0.0010163496,0.7063887,0.0037038086,0.00023343158,0.00010664603,0.00031790807,0.0003641804,0.014267217],"genre_scores_gemma":[0.96385074,0.00039096936,0.019275261,0.00023444151,0.0001852849,0.00007879107,0.00017332805,0.000061167404,0.015750073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998787,0.000548817,0.000055116492,0.00028157316,0.00017090821,0.00015668888],"domain_scores_gemma":[0.99426913,0.0038128677,0.0008187538,0.00035818797,0.00040159974,0.00033950093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028112237,0.0007177712,0.0021113176,0.0006487101,0.0003870342,0.002587215,0.0016865524,0.0020124842,0.0053232876],"category_scores_gemma":[0.014299089,0.0010835857,0.0007448302,0.0013771424,0.0008877017,0.0022746138,0.0013560312,0.001374038,0.00067640794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038884682,0.0001609791,0.0048473417,0.00011768289,0.00033757556,0.001025578,0.000078098055,0.7495506,0.0026899234,0.19688019,0.004605187,0.039318044],"study_design_scores_gemma":[0.000111166555,0.000060299044,0.0012228311,0.000008861007,0.00005021227,0.00019105733,0.000012531035,0.9324029,0.00032439752,0.064960904,0.0006318987,0.00002287681],"about_ca_topic_score_codex":0.0012592389,"about_ca_topic_score_gemma":0.00083708676,"teacher_disagreement_score":0.0053232876,"about_ca_system_score_codex":0.0008326596,"about_ca_system_score_gemma":0.0008231288,"threshold_uncertainty_score":0.017808199},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053099087,0.000049086153,0.9942105,0.000018646235,0.000011211212,0.000056788707,0.000022468541,0.00012369077,0.00019774138],"genre_scores_gemma":[0.21695511,0.00016667931,0.7807687,0.00009228867,0.00002405185,0.00063024927,0.00012265994,0.00008575556,0.001154485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975508,0.0011605868,0.00013846581,0.00032630036,0.0006484215,0.00017549215],"domain_scores_gemma":[0.9973539,0.0018315134,0.00024212514,0.00010581326,0.00038905613,0.00007764458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045682797,0.0018996728,0.0030711403,0.0013910182,0.00088079134,0.0017310212,0.0020837144,0.002117344,0.0015173416],"category_scores_gemma":[0.0042595007,0.0015103323,0.0032575408,0.0015497399,0.0007151609,0.0013147033,0.0012105458,0.0018450754,0.00032552646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001760185,0.00028081844,0.0008134434,0.00029358373,0.0001811313,0.00007416993,0.00007339481,0.9050467,0.023059355,0.005775515,0.00027659134,0.063949324],"study_design_scores_gemma":[0.000011486695,0.00015262199,0.00013932232,0.000005641515,0.000030106581,0.00001428907,0.0000043292926,0.99638534,0.002352208,0.00075083965,0.00013510796,0.000018719378],"about_ca_topic_score_codex":0.0045341966,"about_ca_topic_score_gemma":0.007175642,"teacher_disagreement_score":0.0045682797,"about_ca_system_score_codex":0.0012783586,"about_ca_system_score_gemma":0.0032127104,"threshold_uncertainty_score":0.02415967},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30713055,0.0014182075,0.6836364,0.0010167619,0.0003218002,0.0003159104,0.0009862926,0.0007798007,0.004394349],"genre_scores_gemma":[0.9126911,0.00039449742,0.081849165,0.00013259605,0.0001860535,0.0002503545,0.00048729338,0.00012703329,0.0038819562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973749,0.0013410454,0.00013654199,0.00041999892,0.00026407055,0.0004634896],"domain_scores_gemma":[0.98057234,0.015173877,0.0013513074,0.0010042198,0.0006706685,0.001227731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042845714,0.0017732093,0.0047121905,0.0011423717,0.001427774,0.0022986084,0.0036632249,0.0032914148,0.0048336834],"category_scores_gemma":[0.011930246,0.0022882759,0.0017071009,0.002020095,0.0017408984,0.0035857707,0.0025711798,0.0019472741,0.00048974436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013922956,0.00025593585,0.00096088194,0.0004365248,0.00013755815,0.0008132081,0.00010929149,0.95999587,0.003018461,0.019910257,0.0015927947,0.011376967],"study_design_scores_gemma":[0.00020082157,0.00014187393,0.0003331295,0.0000104424935,0.00002218562,0.000104531995,0.000024230878,0.97853786,0.0003834957,0.019876167,0.0003449288,0.000020254889],"about_ca_topic_score_codex":0.0015865465,"about_ca_topic_score_gemma":0.0015097801,"teacher_disagreement_score":0.0048336834,"about_ca_system_score_codex":0.0010808819,"about_ca_system_score_gemma":0.0012004685,"threshold_uncertainty_score":0.022659302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16031183,0.00087816454,0.8313174,0.00016598833,0.0000918776,0.00002348423,0.00007907393,0.0004955797,0.006636603],"genre_scores_gemma":[0.9286928,0.00029856508,0.06827943,0.00003373946,0.00008753437,0.000017478296,0.00009944906,0.00006993526,0.0024210599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991536,0.00032604107,0.000034748904,0.00011098142,0.00021709471,0.00015745775],"domain_scores_gemma":[0.9987412,0.00045501973,0.00006935232,0.0004405425,0.00024421632,0.000049637514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005751235,0.00041588332,0.00077136455,0.00033487857,0.0004363841,0.0010427252,0.0005750171,0.00045594503,0.0016127771],"category_scores_gemma":[0.0025347073,0.00040799045,0.00036018615,0.000866196,0.0004477203,0.0011448419,0.0011337121,0.00039607816,0.00058532425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005559307,0.00008657434,0.0045164935,0.00011620557,0.00012530189,0.00011508429,0.00015069848,0.48085815,0.06846455,0.025246045,0.0006637721,0.41910115],"study_design_scores_gemma":[0.000013863722,0.000213414,0.003882694,0.000016611672,0.00009691328,0.00022124956,0.000056886325,0.94885147,0.025327569,0.017360754,0.003932945,0.00002555036],"about_ca_topic_score_codex":0.0014081113,"about_ca_topic_score_gemma":0.0023749683,"teacher_disagreement_score":0.0016127771,"about_ca_system_score_codex":0.0003368767,"about_ca_system_score_gemma":0.0006018457,"threshold_uncertainty_score":0.0053952932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07445407,0.0004731016,0.9155105,0.00044219327,0.00013073298,0.00012904068,0.000091579226,0.00020821553,0.008560585],"genre_scores_gemma":[0.6649551,0.00037376388,0.32524484,0.00011838276,0.00008641299,0.00022889469,0.00015106308,0.00012013045,0.0087214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997725,0.00009907109,0.0000110054625,0.000027014878,0.00005892073,0.000031534262],"domain_scores_gemma":[0.99929297,0.0003515277,0.000078118195,0.000057133475,0.00014049186,0.00007979907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074810744,0.00080277177,0.0009844778,0.00055991346,0.0004003652,0.0007378261,0.000969516,0.0013418025,0.0020862215],"category_scores_gemma":[0.002232932,0.0005010451,0.00047474384,0.00084949215,0.000552471,0.0007394743,0.0008263454,0.0010030622,0.00026453906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037809685,0.000038529277,0.00013080622,0.0000310551,0.0000127336525,0.000034835364,0.00001478405,0.98204803,0.0007458148,0.0036052251,0.0006791119,0.012621353],"study_design_scores_gemma":[0.000012187691,0.000013297756,0.000026387926,0.0000018321916,0.000002485209,0.00000557965,0.0000021887179,0.99867296,0.00008120824,0.0010280273,0.00015224151,0.000001645147],"about_ca_topic_score_codex":0.0045832857,"about_ca_topic_score_gemma":0.004217652,"teacher_disagreement_score":0.0045832857,"about_ca_system_score_codex":0.00056001486,"about_ca_system_score_gemma":0.0011490859,"threshold_uncertainty_score":0.009113252},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019762672,0.000101257545,0.9974687,0.00009287397,0.000021722308,0.00001696281,0.00002825433,0.000054701923,0.00023920997],"genre_scores_gemma":[0.06419094,0.00044185505,0.9336475,0.00008145832,0.00013757733,0.0002693967,0.00015120926,0.00013460172,0.0009454257],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99144804,0.0048434422,0.00054150965,0.00046725702,0.0024160037,0.00028374093],"domain_scores_gemma":[0.97717005,0.016366873,0.0011505752,0.002735557,0.0023076027,0.0002694165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009094912,0.0014355738,0.0024162082,0.002614834,0.0012707368,0.0018214459,0.0018934347,0.0009635712,0.0029853343],"category_scores_gemma":[0.037655108,0.0009835318,0.0028517926,0.005176704,0.0017493266,0.0031270743,0.0031545907,0.004296262,0.00048815555],"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.00022624302,0.00028300678,0.0016235634,0.00036648414,0.0003542857,0.00009968235,0.00019170502,0.3033845,0.0068782857,0.29938224,0.0027315933,0.3844784],"study_design_scores_gemma":[0.000031583004,0.000110770445,0.0012656652,0.000048682716,0.00009842689,0.000063980144,0.000044543,0.8304985,0.0037876593,0.15902875,0.004951179,0.00007029464],"about_ca_topic_score_codex":0.0033898929,"about_ca_topic_score_gemma":0.00448198,"teacher_disagreement_score":0.009094912,"about_ca_system_score_codex":0.0011338574,"about_ca_system_score_gemma":0.0036438243,"threshold_uncertainty_score":0.04809904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06330386,0.0010280093,0.9273366,0.00040653264,0.000098472985,0.00006428521,0.00020864871,0.00021698618,0.0073366887],"genre_scores_gemma":[0.84738976,0.0024279437,0.13574652,0.00017026337,0.00038510177,0.00026112466,0.0009166928,0.00020028018,0.012502288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980736,0.0005498321,0.00012294813,0.00025838945,0.00078510167,0.00021016432],"domain_scores_gemma":[0.9745156,0.02048696,0.0016712819,0.0013029214,0.0011820742,0.0008412525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061295317,0.0021294076,0.0015496868,0.0022006144,0.000533526,0.003986876,0.0025411425,0.002081137,0.0070607625],"category_scores_gemma":[0.033488404,0.0010988949,0.0011964559,0.001618475,0.0021375716,0.0058698556,0.0032179125,0.0041430355,0.00049611396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003777666,0.00006276153,0.0008067014,0.00016881271,0.00006602515,0.00035753674,0.00021089762,0.49145165,0.003109844,0.47316265,0.00090438983,0.029320814],"study_design_scores_gemma":[0.000016681475,0.000048292473,0.00023097129,0.00004650021,0.000019752657,0.000079918354,0.000010250613,0.8556909,0.0010103133,0.14202744,0.0007958143,0.000023299835],"about_ca_topic_score_codex":0.0014316448,"about_ca_topic_score_gemma":0.0014312733,"teacher_disagreement_score":0.0070607625,"about_ca_system_score_codex":0.001341264,"about_ca_system_score_gemma":0.0015192393,"threshold_uncertainty_score":0.032416463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13340214,0.009654688,0.7097845,0.009751381,0.00068060553,0.00028730222,0.0031338022,0.00062083174,0.1326847],"genre_scores_gemma":[0.7871769,0.0065181185,0.14431983,0.0011007092,0.0011176361,0.00041621874,0.0032482287,0.0004634474,0.05563888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997905,0.0010748078,0.00006260304,0.00039420443,0.00026447658,0.0002989365],"domain_scores_gemma":[0.9959871,0.0028444973,0.0003032577,0.00029836452,0.00021688768,0.00034980304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014501902,0.0013229531,0.0026261366,0.000940209,0.001187614,0.004209359,0.0023525334,0.0030961358,0.014957488],"category_scores_gemma":[0.009086519,0.001095428,0.0011630284,0.002256739,0.001810561,0.0038928622,0.0023138092,0.0025609317,0.0015335673],"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.0003728962,0.00016754048,0.00080594677,0.00052466616,0.0002016675,0.00032883737,0.00022684099,0.33055487,0.0011406357,0.56862545,0.04841406,0.04863669],"study_design_scores_gemma":[0.000113607646,0.000089233334,0.00049817085,0.000075353775,0.00005859308,0.000289828,0.00014002848,0.41909012,0.00045451595,0.55958354,0.019576954,0.00003013244],"about_ca_topic_score_codex":0.0030873017,"about_ca_topic_score_gemma":0.0015487442,"teacher_disagreement_score":0.014957488,"about_ca_system_score_codex":0.0018804112,"about_ca_system_score_gemma":0.0011821515,"threshold_uncertainty_score":0.0500378},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19044603,0.005691886,0.66812545,0.01330405,0.000921463,0.00047016089,0.002080834,0.00049292884,0.11846724],"genre_scores_gemma":[0.83592635,0.005070942,0.113078274,0.0011629623,0.0013992676,0.00040496196,0.0015643518,0.00037365095,0.041019194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878436,0.0005793259,0.000032547003,0.0002426739,0.00012899762,0.00023217422],"domain_scores_gemma":[0.9930373,0.0056891157,0.00033024393,0.00022468166,0.0003081296,0.00041049032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022936328,0.0014509457,0.0028637866,0.0011725543,0.00166837,0.0033835147,0.0031602762,0.0037685009,0.019486805],"category_scores_gemma":[0.012061465,0.0008416694,0.00096285995,0.0032394254,0.002409424,0.0057333717,0.0025936498,0.0028466173,0.0011401952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007706261,0.00034398597,0.0009874278,0.0006380197,0.00014642857,0.00033455942,0.00018779635,0.5992621,0.0006134968,0.3125309,0.042864233,0.041320518],"study_design_scores_gemma":[0.00021083314,0.00009564629,0.0004347675,0.0000641301,0.000044989465,0.000093794086,0.00017568088,0.5885045,0.00020310111,0.40609398,0.0040475563,0.00003110459],"about_ca_topic_score_codex":0.0066565415,"about_ca_topic_score_gemma":0.0049165254,"teacher_disagreement_score":0.019486805,"about_ca_system_score_codex":0.0022179415,"about_ca_system_score_gemma":0.0022198872,"threshold_uncertainty_score":0.0651899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9943041,0.00029859444,0.0023456367,0.00023597392,0.00003111387,0.000007123662,0.0004247697,0.000029595207,0.0023230973],"genre_scores_gemma":[0.99863833,0.00008715794,0.00020262392,0.000012548462,0.000007922598,0.0000030703243,0.00010248289,0.00000997937,0.00093585864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892235,0.00022646888,0.000060756065,0.0001369807,0.00013605242,0.0005173602],"domain_scores_gemma":[0.9635372,0.030499358,0.0029042976,0.00062074116,0.0013580187,0.0010803912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033077786,0.0005122645,0.0005288011,0.0008379526,0.00051726605,0.002387183,0.0010259941,0.0009615197,0.009204015],"category_scores_gemma":[0.017206237,0.00063030294,0.0008837256,0.0012548513,0.00090506097,0.0027035794,0.00070718967,0.0010983543,0.0004910607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005878284,0.00070806,0.12527084,0.00017483254,0.00041771893,0.0012087295,0.0003130924,0.8166247,0.011144161,0.012253143,0.0017761827,0.024230223],"study_design_scores_gemma":[0.00019303798,0.0015047891,0.25215214,0.00005075802,0.0011400278,0.00055255933,0.002309339,0.7076957,0.0110601345,0.021842968,0.0012939314,0.00020457394],"about_ca_topic_score_codex":0.020603152,"about_ca_topic_score_gemma":0.014869892,"teacher_disagreement_score":0.020603152,"about_ca_system_score_codex":0.0021827747,"about_ca_system_score_gemma":0.001786716,"threshold_uncertainty_score":0.04096645},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085911825,0.0004996505,0.9098897,0.00014051043,0.00006289279,0.00011324503,0.00032257522,0.0016919925,0.0013675867],"genre_scores_gemma":[0.6453639,0.00025679404,0.35244292,0.00005323894,0.00010049172,0.00014667407,0.0005812893,0.00013447946,0.00092026975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972805,0.0007403737,0.00015233213,0.0007696569,0.00082781306,0.00022939622],"domain_scores_gemma":[0.9904343,0.004933939,0.0008734134,0.00081624126,0.0024760712,0.0004661442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031535146,0.0008130164,0.0018057232,0.0015710689,0.00069125387,0.001668007,0.0012728063,0.001118175,0.0021437928],"category_scores_gemma":[0.016050821,0.00036966644,0.00060154777,0.00086978456,0.00066471554,0.0017734019,0.0006866202,0.0011539926,0.00042050466],"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.0044737402,0.0004242458,0.013956431,0.0005154164,0.00011783274,0.00032314126,0.00022847243,0.4320282,0.0537931,0.015132283,0.0045197806,0.47448736],"study_design_scores_gemma":[0.000025890015,0.00014265795,0.0018396206,0.000011803319,0.00001703371,0.0000631643,0.000013358443,0.9892512,0.0065923063,0.0016755457,0.00034529108,0.000022041282],"about_ca_topic_score_codex":0.00396844,"about_ca_topic_score_gemma":0.0027283863,"teacher_disagreement_score":0.00396844,"about_ca_system_score_codex":0.0010839305,"about_ca_system_score_gemma":0.002303791,"threshold_uncertainty_score":0.016677618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020813137,0.00024802302,0.97352296,0.00023040349,0.0000596605,0.000063124295,0.00007842104,0.00018136825,0.004802836],"genre_scores_gemma":[0.39034617,0.00027170178,0.599603,0.00016864587,0.0000890161,0.00043626447,0.00030851492,0.00016328035,0.008613482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971884,0.00012241416,0.000007752389,0.00005762469,0.000057672907,0.000035685724],"domain_scores_gemma":[0.99959344,0.0002769111,0.000027525355,0.000022280576,0.000055895696,0.000023971506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008015652,0.00051456236,0.0012960833,0.00058419316,0.00045117922,0.00066978374,0.0014150228,0.0012308641,0.0048398348],"category_scores_gemma":[0.0019961863,0.00045253712,0.000680071,0.00085170806,0.00047354927,0.0009271491,0.0010761971,0.000853754,0.00038181336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010372644,0.000060237395,0.0003129237,0.00005486289,0.000028274435,0.000033719327,0.000029205228,0.9431621,0.0005754609,0.016513448,0.002323933,0.036802083],"study_design_scores_gemma":[0.0000122174315,0.000016900638,0.000031993295,0.000002769955,0.000002670504,0.000005337599,0.0000053641547,0.9961385,0.0000576608,0.0034301972,0.00029467072,0.0000017639544],"about_ca_topic_score_codex":0.0045538545,"about_ca_topic_score_gemma":0.005584544,"teacher_disagreement_score":0.0048398348,"about_ca_system_score_codex":0.000576792,"about_ca_system_score_gemma":0.0010776345,"threshold_uncertainty_score":0.016190886},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019916076,0.00022372649,0.9640803,0.0005444843,0.000120004115,0.00021114595,0.0027954187,0.0017603242,0.010348611],"genre_scores_gemma":[0.288725,0.0005384389,0.69191384,0.00021284005,0.000105927065,0.000528356,0.0068572955,0.00027422214,0.0108440155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994,0.00015782316,0.00007654908,0.00011029607,0.00015131802,0.00010391896],"domain_scores_gemma":[0.9990965,0.00039844264,0.000096240714,0.00015946114,0.00019073971,0.00005866599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078794966,0.0006908298,0.0007813668,0.0012523268,0.000561452,0.0022846665,0.0015347688,0.0010840802,0.008837342],"category_scores_gemma":[0.0021388095,0.00025699174,0.0014171394,0.0023211131,0.00038536222,0.0024056379,0.00090697355,0.0013732918,0.0014335199],"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.0004993712,0.0004904552,0.001351011,0.0005670234,0.00007943551,0.0005975531,0.00041605654,0.397304,0.005491216,0.34553865,0.020561004,0.22710428],"study_design_scores_gemma":[0.00006505165,0.000055506796,0.00021907937,0.00004764921,0.000047567984,0.00011671057,0.000080077036,0.84091955,0.0014566204,0.1412375,0.015727645,0.000027071284],"about_ca_topic_score_codex":0.0086349845,"about_ca_topic_score_gemma":0.01247665,"teacher_disagreement_score":0.008837342,"about_ca_system_score_codex":0.0009035097,"about_ca_system_score_gemma":0.0017425101,"threshold_uncertainty_score":0.029563844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98752207,0.00019102741,0.00080281094,0.0011149743,0.000027767339,0.000017157874,0.000089002715,0.000023204286,0.010211907],"genre_scores_gemma":[0.99814713,0.00006312584,0.000111012036,0.000032223605,0.000020926029,0.000003406142,0.000033994456,0.000004104471,0.0015841324],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978746,0.001176563,0.0000744427,0.0002714636,0.00010652874,0.00049627025],"domain_scores_gemma":[0.99029887,0.0053099785,0.0011801586,0.00042251975,0.0004004963,0.002387879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002200941,0.00038951734,0.0008596559,0.0008282962,0.0018767482,0.008255935,0.0007905712,0.0024468494,0.01376518],"category_scores_gemma":[0.0084503405,0.00037123004,0.00024396142,0.0010184664,0.0018547986,0.004338957,0.0018825515,0.0023148519,0.00082050264],"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.01573269,0.011403248,0.41442972,0.00037000573,0.00050170673,0.055067275,0.020439243,0.0759434,0.004639821,0.29936552,0.02661098,0.07549644],"study_design_scores_gemma":[0.002385427,0.0067083403,0.2142333,0.00029616026,0.00081223284,0.014820414,0.15837248,0.34337935,0.004482262,0.22512828,0.028612256,0.00076949626],"about_ca_topic_score_codex":0.004454681,"about_ca_topic_score_gemma":0.00525936,"teacher_disagreement_score":0.01376518,"about_ca_system_score_codex":0.0011314696,"about_ca_system_score_gemma":0.0007041553,"threshold_uncertainty_score":0.046049118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003371159,0.99534374,0.0027258203,0.00052477664,0.00013325636,0.0000046127698,0.000014211449,0.0000071400245,0.00090926944],"genre_scores_gemma":[0.003298367,0.99421763,0.0018127288,0.000117763404,0.00029765698,0.000007949224,0.000020134534,0.000002117026,0.00022573762],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944204,0.00013922415,0.0000657738,0.00009363635,0.00022196246,0.000037321704],"domain_scores_gemma":[0.9965385,0.0025134613,0.00036811436,0.00006331666,0.0004548602,0.00006169628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021688826,0.0010190086,0.002563736,0.002073807,0.00034758318,0.0022830877,0.0023224507,0.0020449336,0.0024301591],"category_scores_gemma":[0.0029406168,0.00058999466,0.0007780794,0.006696786,0.00073744473,0.0027021347,0.00068770564,0.0011316754,0.00062956923],"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.00008311633,0.0001092407,0.0005470871,0.014604678,0.00018846986,0.00026986585,0.00008894929,0.019864256,0.00046363517,0.014964513,0.0105365245,0.93827957],"study_design_scores_gemma":[0.000071272436,0.0005560815,0.0032830576,0.0138452705,0.0007048627,0.002356301,0.0006831226,0.01811242,0.0012707509,0.06164176,0.8973093,0.00016586088],"about_ca_topic_score_codex":0.0035615866,"about_ca_topic_score_gemma":0.0049855565,"teacher_disagreement_score":0.0035615866,"about_ca_system_score_codex":0.0012556089,"about_ca_system_score_gemma":0.0023159469,"threshold_uncertainty_score":0.011470258},"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":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11673408,0.006288303,0.81957865,0.012141006,0.0015534767,0.00021251559,0.0019009168,0.00063862966,0.04095241],"genre_scores_gemma":[0.8648449,0.0046695783,0.041561916,0.0014217871,0.0006946741,0.00030408963,0.0014337045,0.0004734317,0.084596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942005,0.00025333802,0.000026275604,0.00011239029,0.0000634895,0.00012447081],"domain_scores_gemma":[0.99764615,0.0015667456,0.00014245497,0.00008446072,0.00039745218,0.00016271725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002823014,0.0015874042,0.0028958253,0.000863821,0.0011450186,0.0035748954,0.004446066,0.005380922,0.012272657],"category_scores_gemma":[0.0065356446,0.0017928854,0.0026419433,0.0013597673,0.001986771,0.0056567052,0.0019944021,0.003629637,0.0012278453],"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.00006663282,0.000055662767,0.00042511796,0.000118783464,0.000039607876,0.00020470501,0.00009036803,0.8986006,0.00037181607,0.09311962,0.0037649646,0.0031421012],"study_design_scores_gemma":[0.000018833154,0.000014011184,0.00008499741,0.000012094256,0.000014935366,0.000012396327,0.000019821993,0.98063,0.00004385229,0.018135132,0.0009994257,0.000014554869],"about_ca_topic_score_codex":0.03618407,"about_ca_topic_score_gemma":0.014137225,"teacher_disagreement_score":0.03618407,"about_ca_system_score_codex":0.0028074714,"about_ca_system_score_gemma":0.0023343363,"threshold_uncertainty_score":0.07194692},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22587143,0.003579618,0.7176015,0.010721954,0.0009342939,0.00069143163,0.0061939233,0.00069995504,0.03370585],"genre_scores_gemma":[0.9048945,0.0016686298,0.054625142,0.00046486975,0.0004797217,0.00050446164,0.0015474828,0.00031467475,0.03550046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994414,0.0029784713,0.00022000179,0.0008978897,0.00045459528,0.0010349723],"domain_scores_gemma":[0.9796259,0.015887283,0.001612694,0.000655769,0.0009185424,0.0012997662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057027405,0.0030332895,0.006973342,0.0022911287,0.0013535499,0.006119068,0.009248776,0.007471544,0.015589845],"category_scores_gemma":[0.021162696,0.004775066,0.0022741,0.006181124,0.00389515,0.008139293,0.0034239485,0.004938803,0.0012404332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048115166,0.000201168,0.00071329775,0.00027621168,0.00015091595,0.00038658324,0.00008610353,0.9464791,0.00025147534,0.040174164,0.004812524,0.005987373],"study_design_scores_gemma":[0.0001200347,0.00006304709,0.00035345633,0.000025698202,0.000050253544,0.000105172185,0.0000754116,0.96061677,0.00012217418,0.037555642,0.0008632084,0.000049187693],"about_ca_topic_score_codex":0.017981553,"about_ca_topic_score_gemma":0.013028398,"teacher_disagreement_score":0.017981553,"about_ca_system_score_codex":0.005892219,"about_ca_system_score_gemma":0.0035143828,"threshold_uncertainty_score":0.05215317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22029604,0.005675351,0.7068884,0.0056326133,0.00081099063,0.00014506729,0.0016410546,0.0030523161,0.05585825],"genre_scores_gemma":[0.7756687,0.001487329,0.20890759,0.000897313,0.00098137,0.0002733378,0.0022888433,0.0013464696,0.008148986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905518,0.003117816,0.00033834486,0.0013670127,0.0029182578,0.0017066872],"domain_scores_gemma":[0.94891554,0.040067732,0.0016868609,0.0046802917,0.003510743,0.0011388054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00934755,0.0022344869,0.0025866788,0.0039283256,0.0016294018,0.006539268,0.003987073,0.0029493158,0.01222232],"category_scores_gemma":[0.09698435,0.0015398982,0.001299794,0.004755396,0.0028827854,0.008466248,0.003927124,0.004957905,0.002769572],"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.001791443,0.0005195307,0.005289837,0.0005838966,0.00021717916,0.00021935081,0.00028544845,0.7785326,0.0042093494,0.094298236,0.019775884,0.09427724],"study_design_scores_gemma":[0.000030862633,0.00005249495,0.0005084856,0.00004754007,0.00002747732,0.00008157193,0.000063282605,0.9268726,0.001155615,0.07020383,0.00094258157,0.000013645109],"about_ca_topic_score_codex":0.0032343457,"about_ca_topic_score_gemma":0.0051030978,"teacher_disagreement_score":0.01222232,"about_ca_system_score_codex":0.0038688693,"about_ca_system_score_gemma":0.003079681,"threshold_uncertainty_score":0.04943514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5310836,0.0060214377,0.43921548,0.0011378648,0.00029599643,0.0011390211,0.0006533279,0.00020700546,0.020246347],"genre_scores_gemma":[0.92549497,0.0015825167,0.070699014,0.000091272916,0.00006387969,0.00062682276,0.00024964064,0.000065916065,0.0011259469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9389798,0.050682303,0.0015330528,0.0012203368,0.0063659786,0.0012185057],"domain_scores_gemma":[0.83892757,0.1471513,0.0026815368,0.0036686114,0.00692867,0.0006423073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.049270514,0.0019928575,0.0034065149,0.005715825,0.0011462518,0.0048059695,0.0032826131,0.0027968718,0.0040160567],"category_scores_gemma":[0.091597274,0.00082023407,0.0029705116,0.0057231793,0.0021661227,0.0068237735,0.0022592056,0.0030447054,0.00022021422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027907148,0.0007818271,0.00264006,0.0008441695,0.0007612249,0.000047499758,0.00024385705,0.83837235,0.00064489455,0.082051076,0.0004883219,0.070333965],"study_design_scores_gemma":[0.0005991947,0.0022385404,0.0030547506,0.00017915342,0.0004624856,0.000030673604,0.00039392037,0.9608609,0.0012140366,0.02939917,0.0014724067,0.000094724586],"about_ca_topic_score_codex":0.008457147,"about_ca_topic_score_gemma":0.0072048064,"teacher_disagreement_score":0.049270514,"about_ca_system_score_codex":0.0067161215,"about_ca_system_score_gemma":0.0033669453,"threshold_uncertainty_score":0.26057047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6350676,0.0012592259,0.33444262,0.0015899021,0.00017135999,0.00051634683,0.00043236176,0.0009026555,0.025618006],"genre_scores_gemma":[0.98066944,0.00011842313,0.01723137,0.00003456823,0.000026104073,0.000059452468,0.000056505432,0.000051045772,0.0017531321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985153,0.00065589434,0.000051161864,0.00015342524,0.00018788985,0.0004363165],"domain_scores_gemma":[0.99632937,0.0027691522,0.0002507374,0.00017368684,0.0002220781,0.00025500552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026006794,0.0012503084,0.0019531697,0.0011408781,0.00063469354,0.0021021634,0.0015418782,0.0018113374,0.0061030556],"category_scores_gemma":[0.008541027,0.0017152833,0.0007495754,0.0011792082,0.001024936,0.0030575912,0.0010801557,0.0014270316,0.00037049185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009040556,0.00019674779,0.00067688944,0.00018909777,0.000050953397,0.00007795814,0.000053132622,0.95828,0.0022437787,0.0061445157,0.0007560208,0.030426826],"study_design_scores_gemma":[0.00010314429,0.00036517292,0.0013667154,0.000025564135,0.00008427517,0.00003274184,0.000051201045,0.99012774,0.0016387171,0.005854678,0.00032918688,0.000020813803],"about_ca_topic_score_codex":0.004860311,"about_ca_topic_score_gemma":0.004815999,"teacher_disagreement_score":0.0061030556,"about_ca_system_score_codex":0.002860311,"about_ca_system_score_gemma":0.0024356514,"threshold_uncertainty_score":0.020753086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6402551,0.0004256862,0.25556165,0.009734014,0.00034091726,0.00034974611,0.00022962046,0.00026328964,0.09284004],"genre_scores_gemma":[0.98809487,0.00007457634,0.008036024,0.0001352229,0.00006437827,0.000052991996,0.000024306013,0.000023117393,0.003494463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997572,0.0013259561,0.00010216756,0.0003622692,0.00017522229,0.00046247634],"domain_scores_gemma":[0.9835134,0.012526264,0.0011118883,0.0009294668,0.0006989991,0.0012198751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004893352,0.00083468965,0.0016756296,0.0006995532,0.0013000588,0.0033561797,0.0014438508,0.0039972244,0.014520908],"category_scores_gemma":[0.040549282,0.00084972923,0.00061877974,0.00060993154,0.0017650125,0.004332629,0.0017936092,0.0025560693,0.0011637489],"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.003590465,0.000672873,0.004747555,0.0004637737,0.0001765872,0.00075671735,0.0016680821,0.048937038,0.004928916,0.8473314,0.007868052,0.07885854],"study_design_scores_gemma":[0.0006015803,0.00032509246,0.00096683577,0.000038588914,0.00007358333,0.00024951936,0.0009600614,0.1031338,0.0010895223,0.89022356,0.0023087743,0.00002911836],"about_ca_topic_score_codex":0.0004940044,"about_ca_topic_score_gemma":0.0006910843,"teacher_disagreement_score":0.014520908,"about_ca_system_score_codex":0.0008484647,"about_ca_system_score_gemma":0.0012116521,"threshold_uncertainty_score":0.04857731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27900738,0.00011151967,0.686931,0.0006306263,0.00021400783,0.0012575719,0.00028649185,0.0151562495,0.01640514],"genre_scores_gemma":[0.5941833,0.00007199278,0.4004497,0.00010021197,0.000018629027,0.00034555214,0.0003039531,0.00024268453,0.0042839167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994235,0.00020038673,0.000041733063,0.00009503516,0.00016042622,0.00007893839],"domain_scores_gemma":[0.9989503,0.0005143469,0.000047607162,0.00015029046,0.0002273356,0.000110177694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014245884,0.00066508783,0.0005299844,0.0003677513,0.00063490437,0.0017128909,0.0017359374,0.0013199879,0.009033216],"category_scores_gemma":[0.0030800707,0.00046819306,0.00035374908,0.00030030354,0.00043695956,0.0016096353,0.0009359167,0.00082036934,0.001230537],"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.0029950642,0.0016779924,0.005834737,0.00075154647,0.00019096637,0.0015075331,0.0024634541,0.3551087,0.2091611,0.019841792,0.0114972815,0.38896987],"study_design_scores_gemma":[0.00032903004,0.0004667753,0.0008842908,0.00003098691,0.000088460074,0.00012394293,0.00024716055,0.9367552,0.04540118,0.0031225898,0.0125014,0.000048931186],"about_ca_topic_score_codex":0.0021863896,"about_ca_topic_score_gemma":0.0018060851,"teacher_disagreement_score":0.009033216,"about_ca_system_score_codex":0.00056617265,"about_ca_system_score_gemma":0.00085406925,"threshold_uncertainty_score":0.030219078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5245607,0.001030251,0.4258708,0.0031777425,0.00018903129,0.00045891144,0.000659223,0.00064516335,0.043408256],"genre_scores_gemma":[0.9625664,0.00048696928,0.027907072,0.00010493724,0.00007622691,0.00005653025,0.00012828995,0.000056468827,0.008617151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814546,0.000933816,0.000095025025,0.0001894958,0.00019744928,0.00043872386],"domain_scores_gemma":[0.98709065,0.009892962,0.0009492634,0.0007024098,0.0006925587,0.00067216856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044176923,0.0010240385,0.0018398138,0.0012024168,0.0006798847,0.0029146424,0.0017274101,0.002353355,0.0064337817],"category_scores_gemma":[0.015958995,0.0013468971,0.00052838644,0.0014887112,0.0013409237,0.0041923462,0.0011086055,0.0020121846,0.0007482864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002595091,0.0004690334,0.0010862506,0.00026314153,0.000078612495,0.00034156244,0.00028297948,0.7963496,0.004348443,0.1539062,0.005060481,0.03521851],"study_design_scores_gemma":[0.00035198752,0.00023279713,0.0006873026,0.000031821946,0.00005736686,0.00007722854,0.00011859164,0.91933167,0.0012781126,0.076412626,0.0013764778,0.000044020246],"about_ca_topic_score_codex":0.004064683,"about_ca_topic_score_gemma":0.0037893632,"teacher_disagreement_score":0.0064337817,"about_ca_system_score_codex":0.0024657922,"about_ca_system_score_gemma":0.0030001125,"threshold_uncertainty_score":0.023363233},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004602488,0.00011380495,0.99437743,0.00006086105,0.000046383204,0.000030891653,0.000040576237,0.00019223652,0.0005353612],"genre_scores_gemma":[0.22697845,0.0003044148,0.767309,0.00018231485,0.00014225286,0.00032661122,0.00032086478,0.00030941868,0.0041266824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972832,0.0010035011,0.0001611669,0.00033991734,0.00093439396,0.0002776642],"domain_scores_gemma":[0.9921462,0.003960755,0.00034398006,0.0017798423,0.0013499961,0.00041926396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006124424,0.0011683918,0.0022123125,0.0012947231,0.0007840269,0.0021042149,0.0046252683,0.0018814165,0.006021027],"category_scores_gemma":[0.015968576,0.000922671,0.0012440747,0.002287997,0.0013109534,0.0039061513,0.0030977908,0.0033994173,0.0011324513],"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.00052794337,0.0002353389,0.00069839094,0.00016953978,0.00008241107,0.00007273542,0.00019937671,0.7146383,0.0044548456,0.09818983,0.0047374777,0.17599373],"study_design_scores_gemma":[0.000008092562,0.000022383076,0.000030440808,0.0000038404214,0.000005732228,0.000008511804,0.000004254094,0.9913784,0.00037903187,0.007818954,0.00033557537,0.0000047319154],"about_ca_topic_score_codex":0.0049205464,"about_ca_topic_score_gemma":0.0038770682,"teacher_disagreement_score":0.006124424,"about_ca_system_score_codex":0.0019616932,"about_ca_system_score_gemma":0.002643939,"threshold_uncertainty_score":0.032389402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98573154,0.000066811815,0.012662662,0.000091253794,0.000004528439,0.00007670012,0.000097094795,0.00003852309,0.0012307432],"genre_scores_gemma":[0.98356116,0.00007884254,0.015553344,0.000015423164,0.000004296038,0.00006117917,0.00011373494,0.000026619371,0.0005852672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791497,0.0015383135,0.00006024774,0.00017113527,0.00020103678,0.00011429273],"domain_scores_gemma":[0.9586126,0.0374615,0.0010188929,0.0014586424,0.0012010476,0.0002473783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046931924,0.0006943065,0.0007632701,0.0012065679,0.000735047,0.0016680118,0.0016591824,0.0017118165,0.0020524324],"category_scores_gemma":[0.021442724,0.0004891635,0.0008733739,0.0015192985,0.0006601347,0.0020397555,0.0007089174,0.0014201961,0.0004490551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015210804,0.0069872276,0.29150575,0.00050777127,0.0007358481,0.0070253,0.014298661,0.5450104,0.007660865,0.02365274,0.0025764308,0.09851799],"study_design_scores_gemma":[0.00004168815,0.0005184848,0.02313011,0.000027318176,0.000076765726,0.0004867974,0.0021835647,0.9682643,0.0011268964,0.0034457683,0.0006419956,0.000056386958],"about_ca_topic_score_codex":0.01425212,"about_ca_topic_score_gemma":0.011809319,"teacher_disagreement_score":0.01425212,"about_ca_system_score_codex":0.0012861982,"about_ca_system_score_gemma":0.00077889353,"threshold_uncertainty_score":0.028338313},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65999025,0.000981436,0.3135132,0.00061636674,0.00021677319,0.00013564066,0.00014027064,0.00030175355,0.024104312],"genre_scores_gemma":[0.94113064,0.0002057126,0.056070864,0.000033345594,0.000025615864,0.00009289266,0.0000587362,0.000048418962,0.0023338085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940825,0.0002897747,0.000027580503,0.00007359621,0.00011081413,0.00009008807],"domain_scores_gemma":[0.99921525,0.00035364946,0.00012404316,0.00008661252,0.00008794929,0.00013259142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006778525,0.0006887672,0.0009874254,0.0011069593,0.00136732,0.0019013735,0.001289241,0.001767474,0.0058791847],"category_scores_gemma":[0.0020210634,0.00092896394,0.00079404307,0.00090332935,0.0016350081,0.0015219295,0.0014255118,0.00084997347,0.000777532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023671146,0.00021340103,0.0019869804,0.0002175513,0.000048082802,0.0010992674,0.00029783667,0.78548485,0.014734928,0.14113776,0.001990682,0.050421495],"study_design_scores_gemma":[0.00015169417,0.000513516,0.0011168573,0.00007301538,0.00004517732,0.00037109843,0.0002888544,0.88624156,0.0034170877,0.105014384,0.0026779252,0.00008869178],"about_ca_topic_score_codex":0.0003550957,"about_ca_topic_score_gemma":0.0006581352,"teacher_disagreement_score":0.0058791847,"about_ca_system_score_codex":0.00074754906,"about_ca_system_score_gemma":0.0003648063,"threshold_uncertainty_score":0.019667864},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13372429,0.00077210774,0.8554361,0.0014247852,0.00026022788,0.00024246098,0.0012686456,0.00044164088,0.0064297444],"genre_scores_gemma":[0.88226694,0.0009717429,0.09960506,0.00036035382,0.00035058675,0.00034352325,0.00061996153,0.000084295345,0.015397649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981665,0.0004949068,0.00012340517,0.0003233837,0.00043253176,0.00045926688],"domain_scores_gemma":[0.99232,0.0041643553,0.0010423157,0.0007507548,0.0010743994,0.00064825226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047109425,0.0006976979,0.0015402846,0.0014778981,0.0017754914,0.0028445025,0.0037366764,0.0019140354,0.006082259],"category_scores_gemma":[0.009885165,0.0009666843,0.0012195812,0.0023084602,0.0022764292,0.0033387186,0.0017143901,0.0024254494,0.0008785893],"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.00046632515,0.0001451119,0.0021450415,0.00011634432,0.00007128275,0.00041268874,0.00025894662,0.24372856,0.0022685144,0.7351867,0.0030489045,0.012151508],"study_design_scores_gemma":[0.000064326785,0.000055305387,0.0005245568,0.0000111740455,0.000028969373,0.00013066108,0.00003167724,0.89497864,0.000306699,0.102907315,0.00093010464,0.000030585965],"about_ca_topic_score_codex":0.011277765,"about_ca_topic_score_gemma":0.009106066,"teacher_disagreement_score":0.011277765,"about_ca_system_score_codex":0.0026956738,"about_ca_system_score_gemma":0.0034149091,"threshold_uncertainty_score":0.024914145},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011500928,0.00046795254,0.9693084,0.00027132756,0.00020262085,0.00004725067,0.00019458504,0.00031876066,0.01768825],"genre_scores_gemma":[0.48316115,0.00060279964,0.4934263,0.00029576296,0.00045179456,0.00020184481,0.0006403146,0.00032449685,0.020895557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990864,0.000374295,0.000031650383,0.00013290015,0.0002785039,0.00009631751],"domain_scores_gemma":[0.99860543,0.00074217044,0.000087354536,0.00022036789,0.000282352,0.00006229785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012825888,0.0006890344,0.0008334927,0.0003784863,0.00021151335,0.0010701225,0.0014599353,0.0008122064,0.009421374],"category_scores_gemma":[0.0039809593,0.00036106666,0.00082471594,0.0005998396,0.00034641902,0.001348305,0.001530369,0.0020140938,0.0013057969],"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.00031656187,0.00027793756,0.00062473456,0.00030886385,0.00007802385,0.00017362247,0.00006113373,0.63669205,0.003862653,0.15114902,0.012502892,0.19395249],"study_design_scores_gemma":[0.000017416678,0.000046691082,0.00010902077,0.000014232889,0.000008939059,0.000036206056,0.0000043743094,0.96447533,0.0006564916,0.031757563,0.0028676866,0.000006172049],"about_ca_topic_score_codex":0.0007901746,"about_ca_topic_score_gemma":0.00081801467,"teacher_disagreement_score":0.009421374,"about_ca_system_score_codex":0.00046960768,"about_ca_system_score_gemma":0.0006972871,"threshold_uncertainty_score":0.031517625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4794231,0.002634409,0.5040451,0.0016801958,0.00034776717,0.00047468,0.0009516856,0.00068450265,0.009758554],"genre_scores_gemma":[0.92444134,0.0011448485,0.06322055,0.00013922974,0.0002237313,0.00028500435,0.0005048216,0.0002381219,0.009802321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862635,0.0005872846,0.00011118319,0.0002427246,0.00019611273,0.00023636589],"domain_scores_gemma":[0.97452015,0.022497512,0.0010943279,0.00054338004,0.0006454404,0.0006991342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004493755,0.0026328145,0.0056477725,0.0016347256,0.001275449,0.0035970137,0.0039045082,0.0043293657,0.0072890394],"category_scores_gemma":[0.014448986,0.0036549394,0.0026346983,0.0034536254,0.0023647342,0.0058782343,0.0015866152,0.002519343,0.0004975081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049496983,0.00009688503,0.00050976296,0.0003280971,0.00009746655,0.00031766377,0.000084927895,0.9805627,0.0014900242,0.007227602,0.0011080034,0.00768181],"study_design_scores_gemma":[0.000098834666,0.0001824016,0.00049490324,0.000025400497,0.00007583057,0.00009138909,0.0000624027,0.9829683,0.0009863172,0.01474538,0.00022979465,0.000038990926],"about_ca_topic_score_codex":0.0045222,"about_ca_topic_score_gemma":0.002718405,"teacher_disagreement_score":0.0072890394,"about_ca_system_score_codex":0.0017663009,"about_ca_system_score_gemma":0.001499777,"threshold_uncertainty_score":0.02438432},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07330516,0.0013822169,0.90904397,0.00097537745,0.0003094455,0.00025200142,0.0009318707,0.0004484783,0.013351417],"genre_scores_gemma":[0.77753806,0.0007216848,0.20460825,0.00032246788,0.00017332405,0.00075347757,0.0009894915,0.00023475781,0.014658418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894685,0.00045551616,0.0000386077,0.0002039949,0.00015183415,0.0002031971],"domain_scores_gemma":[0.9979802,0.0014562578,0.00016585804,0.000043358603,0.00022574641,0.0001286025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002194572,0.0018348283,0.0028839468,0.0011062988,0.0006842323,0.0027599116,0.0028748892,0.0041414187,0.0071507203],"category_scores_gemma":[0.0034470113,0.0021428873,0.0016663673,0.001957234,0.0010727793,0.001993528,0.0014321425,0.0024960332,0.00076023943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023403685,0.000029496712,0.000115581366,0.00003290414,0.00001337107,0.000021393109,0.000007962347,0.99633396,0.00008073976,0.0010003616,0.00026668436,0.0020740966],"study_design_scores_gemma":[0.000006734078,0.000015620957,0.00003551472,0.0000042491474,0.000005204436,0.000002154575,0.000005836363,0.9994312,0.000026864096,0.00037151412,0.00009298555,0.0000021971478],"about_ca_topic_score_codex":0.021680856,"about_ca_topic_score_gemma":0.017425641,"teacher_disagreement_score":0.021680856,"about_ca_system_score_codex":0.0017167822,"about_ca_system_score_gemma":0.00264664,"threshold_uncertainty_score":0.043109357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15816261,0.0035920467,0.82091033,0.00075997086,0.00031428513,0.0006152172,0.0005726733,0.000781488,0.014291363],"genre_scores_gemma":[0.6649878,0.0017156556,0.3266063,0.00019258652,0.00013492373,0.00032803148,0.00034398655,0.00014057236,0.0055502253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993641,0.00025535034,0.000031276257,0.00008173748,0.00009069128,0.00017685378],"domain_scores_gemma":[0.9981445,0.0014448254,0.00013873729,0.00006394712,0.00007302928,0.00013488441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013712595,0.0011882087,0.0016701921,0.0011867507,0.0006788595,0.0017502727,0.0020203209,0.001608749,0.003574775],"category_scores_gemma":[0.0027362707,0.0011255885,0.0010383951,0.0016999067,0.00064554985,0.0016849138,0.0010670552,0.0016383951,0.00028825967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023380118,0.00016757514,0.00026736248,0.00016426735,0.000058495407,0.0000877104,0.00006582099,0.9536706,0.0007938475,0.011689864,0.0018503399,0.030950297],"study_design_scores_gemma":[0.000089375775,0.0000935668,0.00014360015,0.000017541894,0.000030019557,0.000024349001,0.000036867124,0.991268,0.00035574206,0.0069060693,0.0010224234,0.000012580412],"about_ca_topic_score_codex":0.010851534,"about_ca_topic_score_gemma":0.013520518,"teacher_disagreement_score":0.010851534,"about_ca_system_score_codex":0.0017290399,"about_ca_system_score_gemma":0.0023046285,"threshold_uncertainty_score":0.021576762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018146667,0.000026756252,0.99727196,0.0000367188,0.000008028813,0.000031067648,0.0000125798,0.000031782838,0.00076632295],"genre_scores_gemma":[0.11626163,0.00010649708,0.88129365,0.000060393166,0.000025055664,0.00042873385,0.0000677567,0.000050178493,0.0017061046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752015,0.0014476347,0.00009527592,0.00027483268,0.0005231276,0.00013904164],"domain_scores_gemma":[0.99746954,0.0018533563,0.00011763355,0.000077554556,0.00039112644,0.000090907444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041413736,0.0012386782,0.0016324556,0.0011979013,0.0006612448,0.0017966246,0.0022699048,0.0014538947,0.0035431231],"category_scores_gemma":[0.005365367,0.0007533051,0.0017658813,0.0012860163,0.00075557875,0.0017565566,0.0021014323,0.002083855,0.0005047219],"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.00009461612,0.0002073484,0.00023101934,0.0002368481,0.00011462568,0.00010427316,0.00023407668,0.86526746,0.0017604908,0.06589037,0.0008832517,0.06497569],"study_design_scores_gemma":[0.0000097139055,0.00006870952,0.000036045993,0.000013943618,0.00001733072,0.000013700553,0.00001788795,0.9852385,0.00033313545,0.013870681,0.0003695435,0.000010863818],"about_ca_topic_score_codex":0.0034084497,"about_ca_topic_score_gemma":0.003848892,"teacher_disagreement_score":0.0041413736,"about_ca_system_score_codex":0.001057216,"about_ca_system_score_gemma":0.002022702,"threshold_uncertainty_score":0.021901965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70562744,0.0045461743,0.01566832,0.075489886,0.00066480733,0.00023328634,0.00028022553,0.00014164571,0.19734825],"genre_scores_gemma":[0.99552804,0.0004013845,0.00031857134,0.0013240125,0.00015508909,0.000029253033,0.000012230116,0.000007389838,0.0022241138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99221355,0.0042018048,0.00015172461,0.0005512273,0.0015125264,0.001369035],"domain_scores_gemma":[0.9604088,0.030286526,0.005460889,0.0016867523,0.0010684608,0.0010886297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010361138,0.0002830793,0.0006933576,0.0009428338,0.0016340549,0.006482776,0.0011794334,0.004428765,0.009227906],"category_scores_gemma":[0.024430413,0.0002493333,0.0006318474,0.0012099544,0.005402596,0.0067118155,0.0024015412,0.003817318,0.00028228373],"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.0024338604,0.0016528775,0.012217306,0.00034161925,0.00031285026,0.00016195011,0.0016719496,0.011314084,0.0007362601,0.88295466,0.011298255,0.0749043],"study_design_scores_gemma":[0.0020760011,0.0024546525,0.06003954,0.00080252596,0.0017812987,0.00015433088,0.008777965,0.044475056,0.0051607084,0.8316656,0.042417567,0.00019467359],"about_ca_topic_score_codex":0.004397555,"about_ca_topic_score_gemma":0.008011698,"teacher_disagreement_score":0.010361138,"about_ca_system_score_codex":0.003964486,"about_ca_system_score_gemma":0.0059073297,"threshold_uncertainty_score":0.054795563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022548068,0.0012403928,0.95648205,0.0015840866,0.00025937808,0.00008699378,0.00015442245,0.00012575426,0.017518917],"genre_scores_gemma":[0.61168283,0.0019100052,0.36204493,0.00056701706,0.0005764002,0.00048736954,0.00040028058,0.00031601297,0.022015208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996805,0.00015784623,0.000010468883,0.000034580924,0.0000703426,0.000046215642],"domain_scores_gemma":[0.9987124,0.00089818804,0.00012047619,0.000053123924,0.00011593322,0.000099835226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012913075,0.0008659839,0.0013849133,0.0007764639,0.0006546573,0.0012674816,0.0016756593,0.0016408329,0.0036510832],"category_scores_gemma":[0.0037915583,0.0007754221,0.0010754869,0.0009388734,0.001483885,0.0013111482,0.0022398236,0.0024792466,0.0003102796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033559576,0.000046842983,0.00014961476,0.00007107633,0.000029074097,0.00007587423,0.0000458482,0.9297895,0.00044480976,0.06131674,0.0014593006,0.0065377406],"study_design_scores_gemma":[0.000021377964,0.000010032348,0.000043033382,0.000008387379,0.000005240055,0.000006357784,0.000012462001,0.98174864,0.000049631366,0.017440278,0.00064912013,0.000005490378],"about_ca_topic_score_codex":0.008464776,"about_ca_topic_score_gemma":0.00639378,"teacher_disagreement_score":0.008464776,"about_ca_system_score_codex":0.0008219402,"about_ca_system_score_gemma":0.0014882336,"threshold_uncertainty_score":0.01683104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019020189,0.0005560958,0.9737269,0.00030601546,0.00027995594,0.00017536429,0.00009930776,0.00057315064,0.0052630035],"genre_scores_gemma":[0.1738993,0.0005443501,0.8192276,0.00026326065,0.00018888027,0.00040113446,0.00018085098,0.00022374859,0.0050709066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996377,0.0001183054,0.000018437693,0.000043091484,0.00013106059,0.00005135481],"domain_scores_gemma":[0.99955803,0.0002363068,0.000048642043,0.000051575742,0.00006873406,0.00003672503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065284764,0.0011166655,0.00093225803,0.00096442166,0.00051174086,0.0009100877,0.0015775446,0.0019108506,0.0025067802],"category_scores_gemma":[0.001996021,0.00042233375,0.0010095417,0.0012137174,0.00047101697,0.0010210337,0.0010885592,0.0014766762,0.00052500976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012360074,0.0002103131,0.00032828786,0.0001636607,0.00008946707,0.00009872116,0.000050250266,0.79516476,0.006953934,0.017516619,0.003534596,0.17576584],"study_design_scores_gemma":[0.00007943794,0.00009303023,0.00008627093,0.000012935106,0.000029999797,0.000042373726,0.000017111619,0.98776746,0.00080190995,0.00853884,0.0025179023,0.000012758562],"about_ca_topic_score_codex":0.0020880618,"about_ca_topic_score_gemma":0.0030232554,"teacher_disagreement_score":0.0025067802,"about_ca_system_score_codex":0.0006018262,"about_ca_system_score_gemma":0.0014763612,"threshold_uncertainty_score":0.0083860755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99225944,0.00008783873,0.00040836868,0.00013107018,0.000014674454,0.000018029208,0.00009653741,0.000005044431,0.0069790166],"genre_scores_gemma":[0.9948902,0.000104250845,0.00021965861,0.000031103657,0.000014099187,0.000009554583,0.00014972103,0.000010605057,0.004570876],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997472,0.00007829754,0.000007687915,0.000053323703,0.000049609247,0.000063840205],"domain_scores_gemma":[0.99818593,0.0009718539,0.00013569383,0.000058653903,0.00017298729,0.00047487536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039112606,0.00032925094,0.00038421334,0.0008359628,0.0013000068,0.0020373934,0.0008604242,0.0008066729,0.009345086],"category_scores_gemma":[0.0037230153,0.00017738434,0.00021188192,0.0013014829,0.0008281245,0.0011788607,0.00072619505,0.000933276,0.0007095984],"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.0048876326,0.00963851,0.56048614,0.0008978319,0.00064590503,0.009565159,0.086244985,0.02722282,0.015369845,0.11763027,0.023636635,0.14377426],"study_design_scores_gemma":[0.000094525225,0.001238828,0.7827268,0.00020459355,0.00008799727,0.00092475006,0.13305195,0.044909127,0.0015822789,0.013586731,0.021473248,0.00011906417],"about_ca_topic_score_codex":0.046382505,"about_ca_topic_score_gemma":0.049103916,"teacher_disagreement_score":0.046382505,"about_ca_system_score_codex":0.00096709654,"about_ca_system_score_gemma":0.00061253796,"threshold_uncertainty_score":0.092225075},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016187048,0.0008094072,0.96897817,0.00055553374,0.00015570867,0.000104722756,0.00025343982,0.00014160693,0.012814294],"genre_scores_gemma":[0.34947607,0.0048627853,0.58714074,0.00042586794,0.0005128744,0.00063243293,0.0012899626,0.00033703228,0.055322226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999514,0.00014406539,0.000023064467,0.000101662576,0.00012853388,0.000088565015],"domain_scores_gemma":[0.9992446,0.00039975834,0.00010407932,0.0000676636,0.0001310268,0.00005283465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012070133,0.0016457441,0.0012324114,0.0013200577,0.0005632406,0.0013682897,0.002641663,0.0023267914,0.009179891],"category_scores_gemma":[0.004888856,0.0008538553,0.00196253,0.0017618698,0.00086610357,0.0019813548,0.0016591027,0.0016288179,0.0010199599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053528533,0.00005739067,0.0001485954,0.00017808659,0.00003923319,0.00008235476,0.000066608445,0.8280439,0.000803154,0.14247593,0.0034917209,0.024559498],"study_design_scores_gemma":[0.000037237634,0.000031141142,0.000100578436,0.000021928612,0.000017653101,0.000053602358,0.000039204206,0.8670637,0.00022917138,0.1286883,0.0037031278,0.000014300007],"about_ca_topic_score_codex":0.002783971,"about_ca_topic_score_gemma":0.00404027,"teacher_disagreement_score":0.009179891,"about_ca_system_score_codex":0.0010905125,"about_ca_system_score_gemma":0.0018082045,"threshold_uncertainty_score":0.030709803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036517456,0.00040736454,0.9534393,0.00014653492,0.000056982582,0.000117308,0.00012444063,0.000095355186,0.009095264],"genre_scores_gemma":[0.7943534,0.00044724473,0.19940782,0.00007296517,0.000049395854,0.0003411966,0.00019713244,0.00011654277,0.005014393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963831,0.0020248229,0.00015299601,0.00033566213,0.0008029111,0.00030046178],"domain_scores_gemma":[0.9943282,0.004239299,0.00026444503,0.00042786874,0.00067246275,0.00006778233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006259898,0.0013431144,0.002217841,0.0020271789,0.00073954515,0.0035102789,0.0017794889,0.001302155,0.004689499],"category_scores_gemma":[0.013846521,0.00082593295,0.0017906518,0.0041908417,0.0009879383,0.0029011364,0.0010807476,0.0016772674,0.00036879544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000661158,0.00004361094,0.00028834245,0.00004994177,0.00007392947,0.000023195327,0.000018371655,0.94986475,0.0003871177,0.032175425,0.0002650965,0.016744176],"study_design_scores_gemma":[0.000008260832,0.000018960192,0.00026016106,0.000008578224,0.000030046607,0.000014807685,0.000009759692,0.9887683,0.00032917975,0.010234263,0.00030989468,0.000007797798],"about_ca_topic_score_codex":0.0063379304,"about_ca_topic_score_gemma":0.0044142124,"teacher_disagreement_score":0.0063379304,"about_ca_system_score_codex":0.0038111198,"about_ca_system_score_gemma":0.0021176836,"threshold_uncertainty_score":0.03310591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88121015,0.00025790615,0.115000434,0.00011559869,0.000030475241,0.00004460915,0.00009358147,0.00042341423,0.002823852],"genre_scores_gemma":[0.9844545,0.000048357906,0.014812966,0.000011114991,0.0000040778705,0.000014857552,0.000056385517,0.000028763796,0.0005688998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927956,0.00020799636,0.000034515702,0.00011895675,0.00017646026,0.00018257099],"domain_scores_gemma":[0.9976901,0.0012086194,0.00045687787,0.00020222816,0.00028207863,0.00016020784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071414374,0.0005127227,0.00041121882,0.0005224073,0.00045427997,0.0012754877,0.0009778282,0.00060439075,0.002237472],"category_scores_gemma":[0.0030318564,0.00040335426,0.00030045476,0.0010261984,0.00027748305,0.0011732604,0.00060587126,0.0005394614,0.00028291202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019959812,0.000853559,0.0058817635,0.00020973034,0.00005437742,0.00022824664,0.00019653811,0.79983026,0.05235489,0.0028709678,0.0005737091,0.13494988],"study_design_scores_gemma":[0.00008210332,0.0012444643,0.009896952,0.000017500253,0.00006759762,0.00012234408,0.0002354758,0.95039195,0.03274522,0.0041741915,0.0009735297,0.00004867472],"about_ca_topic_score_codex":0.001636733,"about_ca_topic_score_gemma":0.0035308294,"teacher_disagreement_score":0.002237472,"about_ca_system_score_codex":0.0006487209,"about_ca_system_score_gemma":0.0010748621,"threshold_uncertainty_score":0.0074850917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57289904,0.0022747829,0.36861804,0.0053416807,0.00025760324,0.00040867287,0.001224913,0.00030912668,0.048666198],"genre_scores_gemma":[0.9565295,0.0021585405,0.0206653,0.0003237536,0.00032046976,0.00023399985,0.00051953126,0.00012509842,0.019123727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716115,0.0013066964,0.0001127303,0.00055519503,0.00028080854,0.00058356626],"domain_scores_gemma":[0.9459891,0.041165195,0.005578036,0.0011950292,0.0032213537,0.0028512597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00330061,0.0020349575,0.0051623457,0.003428931,0.0024252452,0.0046926294,0.0056445147,0.0045077507,0.02003742],"category_scores_gemma":[0.026819954,0.0019590736,0.0019147415,0.0055818018,0.006246641,0.008783143,0.003601847,0.0024978004,0.0013502686],"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.0009054728,0.00026107254,0.0037160993,0.00041337806,0.00014257387,0.0006461222,0.00051168556,0.64680326,0.0015102242,0.3290003,0.0057122437,0.010377516],"study_design_scores_gemma":[0.0001490989,0.00019707013,0.00091743923,0.00005057165,0.00009418107,0.00018283735,0.00031736502,0.8656764,0.00027061504,0.13091642,0.0011434153,0.00008458833],"about_ca_topic_score_codex":0.024310987,"about_ca_topic_score_gemma":0.01928213,"teacher_disagreement_score":0.024310987,"about_ca_system_score_codex":0.005469145,"about_ca_system_score_gemma":0.0024033457,"threshold_uncertainty_score":0.0670318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86396754,0.0012511885,0.12412913,0.0013502213,0.00019268427,0.00004641858,0.00073081785,0.000978106,0.0073538846],"genre_scores_gemma":[0.99507743,0.00013702526,0.0037972734,0.00006194788,0.00005659261,0.000012878576,0.0001886854,0.000117234435,0.0005510153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396133,0.0028265312,0.0003690549,0.00064000423,0.0014738796,0.00072913116],"domain_scores_gemma":[0.82563525,0.15394296,0.0065132603,0.006231829,0.006819098,0.00085764326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014339423,0.00070334243,0.00097333186,0.0007991323,0.00035013136,0.0015539016,0.00059131114,0.0015694646,0.0025118673],"category_scores_gemma":[0.11360429,0.00077091437,0.0006317466,0.0014844121,0.0007631359,0.0020708032,0.0008255863,0.0015407482,0.0008246786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005424418,0.00030650754,0.060583025,0.0004288887,0.0004321118,0.0008538272,0.00040188656,0.8049169,0.01815083,0.0109613575,0.0030109573,0.09452922],"study_design_scores_gemma":[0.00020715485,0.0009942095,0.10792906,0.000059742237,0.00051200564,0.0009575528,0.000116668496,0.8580892,0.019214923,0.010702949,0.001055906,0.00016071658],"about_ca_topic_score_codex":0.0015407548,"about_ca_topic_score_gemma":0.00074340205,"teacher_disagreement_score":0.014339423,"about_ca_system_score_codex":0.0009518915,"about_ca_system_score_gemma":0.00081944896,"threshold_uncertainty_score":0.07583499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9164808,0.00041931838,0.0688369,0.0007530985,0.00003498503,0.000044232052,0.0003302966,0.00018008724,0.012920376],"genre_scores_gemma":[0.9942855,0.000091247624,0.0031455373,0.000017187962,0.000024574872,0.000017200882,0.00021461718,0.000040756386,0.0021633727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997741,0.00073674077,0.0002037508,0.00024933708,0.0006769313,0.00039229373],"domain_scores_gemma":[0.95302665,0.035666015,0.004620646,0.0019149937,0.003120809,0.0016509434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004144775,0.00046194126,0.000988152,0.0010684177,0.0006761649,0.0034610953,0.0015861931,0.001514278,0.0062784734],"category_scores_gemma":[0.056101255,0.0007675363,0.00050406466,0.0007385697,0.0011774494,0.006052101,0.0010083412,0.0014560333,0.0004851746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021850339,0.00034482527,0.0097272135,0.00017646418,0.000056958797,0.0013878989,0.0007683507,0.5604174,0.026975347,0.3563085,0.0032615021,0.038390502],"study_design_scores_gemma":[0.00009056818,0.00018418662,0.004452123,0.000027202004,0.000024010908,0.000378545,0.0001683573,0.81796116,0.007440102,0.1677593,0.0014687326,0.000045687226],"about_ca_topic_score_codex":0.0013560958,"about_ca_topic_score_gemma":0.0009163735,"teacher_disagreement_score":0.0062784734,"about_ca_system_score_codex":0.0011013373,"about_ca_system_score_gemma":0.00093790283,"threshold_uncertainty_score":0.021919906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0829218,0.01356122,0.77951306,0.031856436,0.004521903,0.00034654848,0.001163093,0.0009302624,0.08518579],"genre_scores_gemma":[0.8684632,0.0098836385,0.0574695,0.0039980267,0.0035582387,0.000271025,0.00036598614,0.0005275053,0.05546282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.00040235117,0.0000642393,0.000158735,0.00016668318,0.00012727766],"domain_scores_gemma":[0.9958568,0.0030408227,0.00022434955,0.0002641891,0.00039968095,0.0002140195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039552213,0.0012659855,0.002341529,0.0007398461,0.00091882725,0.0024331422,0.0023511695,0.0034300063,0.008263196],"category_scores_gemma":[0.011167153,0.0005980292,0.0016522912,0.0008730245,0.001855451,0.0033586302,0.002110713,0.0038548766,0.0007127275],"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.0007185556,0.000103841965,0.0009152991,0.00098978,0.0002519646,0.0013726979,0.00037850454,0.3577811,0.010661771,0.5652989,0.030652475,0.030875089],"study_design_scores_gemma":[0.00013284071,0.00015786527,0.0012380086,0.00014691582,0.00017937267,0.00022694301,0.00010441166,0.7019194,0.0012287333,0.284399,0.010195057,0.00007150142],"about_ca_topic_score_codex":0.007920615,"about_ca_topic_score_gemma":0.003951954,"teacher_disagreement_score":0.008263196,"about_ca_system_score_codex":0.0020280848,"about_ca_system_score_gemma":0.001991515,"threshold_uncertainty_score":0.027643144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021857996,0.00067957316,0.972674,0.00014731193,0.000033345612,0.00009802484,0.000071112474,0.00019395429,0.0042447895],"genre_scores_gemma":[0.39228186,0.00091825845,0.6027646,0.0001460375,0.00006646769,0.0004614441,0.00028117656,0.00013091516,0.002949337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996119,0.00018302645,0.000011803475,0.000041207644,0.00011171081,0.00004046986],"domain_scores_gemma":[0.99967885,0.00017786154,0.000038108017,0.000024908186,0.000057978254,0.000022165908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077717565,0.00073098874,0.0009314505,0.0010339298,0.0005101531,0.0007711051,0.0013378023,0.0010917953,0.0019511433],"category_scores_gemma":[0.0013561783,0.000441985,0.00090254296,0.0013059145,0.00052682945,0.0007199023,0.0007318273,0.0008616101,0.00030858335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003083932,0.000029804276,0.00018191306,0.00005329121,0.000036236237,0.000051467414,0.000046269433,0.9482554,0.0010283798,0.008679517,0.0006415469,0.04096528],"study_design_scores_gemma":[0.000014014585,0.0000406997,0.000066718385,0.000012068039,0.000010114727,0.000029914723,0.000014319087,0.993686,0.00031845956,0.0047838157,0.0010177192,0.0000060318243],"about_ca_topic_score_codex":0.0020264788,"about_ca_topic_score_gemma":0.0023164714,"teacher_disagreement_score":0.0020264788,"about_ca_system_score_codex":0.0006690128,"about_ca_system_score_gemma":0.0009608105,"threshold_uncertainty_score":0.006527245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969952,0.00014389597,0.00008834621,0.0000442378,0.000014720508,0.000015794772,0.00004442259,0.000016127215,0.0026371703],"genre_scores_gemma":[0.9984049,0.00005779486,0.00008263658,0.000013986943,0.00001551511,0.0000068622458,0.00006328502,0.000004361031,0.0013507353],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998483,0.00045985694,0.00009238508,0.00020041248,0.00022269296,0.0005416693],"domain_scores_gemma":[0.9781108,0.01451105,0.0016669281,0.00089852005,0.0010870218,0.0037256782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029807747,0.00036615052,0.0008457771,0.00072321435,0.0006759936,0.0020184596,0.00058968214,0.0011456672,0.01364859],"category_scores_gemma":[0.01002708,0.0003182009,0.00060307793,0.0005156563,0.0007631108,0.001817559,0.0010615855,0.00090781297,0.0011608491],"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.26811707,0.042858295,0.23572527,0.0015148075,0.0007988258,0.0005103043,0.0032612863,0.026861822,0.044113252,0.004797535,0.003069333,0.36837238],"study_design_scores_gemma":[0.004158713,0.09099704,0.8240302,0.00023492124,0.0023639137,0.000476432,0.009288077,0.028112296,0.030883556,0.004536306,0.004661463,0.00025706124],"about_ca_topic_score_codex":0.0026018547,"about_ca_topic_score_gemma":0.0030364317,"teacher_disagreement_score":0.01364859,"about_ca_system_score_codex":0.0006535274,"about_ca_system_score_gemma":0.0015317817,"threshold_uncertainty_score":0.045659125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6400203,0.0013511104,0.32969576,0.0014480031,0.0003201954,0.0002786155,0.0005731851,0.00032526368,0.0259875],"genre_scores_gemma":[0.97756153,0.00014376006,0.01794314,0.00006193708,0.00002760322,0.00013089228,0.00009671495,0.0000323344,0.0040019816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964285,0.00015233444,0.0000123970685,0.00006362277,0.000057382043,0.00007131823],"domain_scores_gemma":[0.9990681,0.00060192606,0.00010707665,0.00003492499,0.00012401024,0.00006399744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013155043,0.0013512663,0.0019202991,0.0007477197,0.00065448764,0.0018965075,0.0009770334,0.002457473,0.003010442],"category_scores_gemma":[0.0025288058,0.0010225163,0.0012771314,0.00080975855,0.0010343982,0.0010728462,0.0010371394,0.0011388714,0.00029404546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067384826,0.000024059338,0.00009935212,0.00001861175,0.000019974712,0.000031363255,0.00000830276,0.99722445,0.00041379113,0.0007061547,0.000113652226,0.0012730395],"study_design_scores_gemma":[0.000018952042,0.00004616007,0.00008419849,0.0000024078965,0.000008359183,0.000003957167,0.00000817306,0.99901843,0.00036034366,0.00037091435,0.00007411467,0.0000039957604],"about_ca_topic_score_codex":0.011344368,"about_ca_topic_score_gemma":0.007115605,"teacher_disagreement_score":0.011344368,"about_ca_system_score_codex":0.0014713794,"about_ca_system_score_gemma":0.0017762114,"threshold_uncertainty_score":0.022556663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6266039,0.0035284958,0.32903913,0.00041403325,0.00022584718,0.0013166917,0.0005127536,0.0004759026,0.037883297],"genre_scores_gemma":[0.8438489,0.0006451131,0.15172875,0.00006840189,0.0000579716,0.0005848384,0.00025871463,0.00009755732,0.0027096826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696475,0.0019718525,0.0001433541,0.00020668641,0.00047310715,0.00024021999],"domain_scores_gemma":[0.98698425,0.010833507,0.0006605908,0.00037280214,0.0009338938,0.00021495509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039980025,0.0010475502,0.0012121807,0.0021570032,0.0007763263,0.001707783,0.0011887068,0.0008359437,0.0049773385],"category_scores_gemma":[0.014145914,0.0006827859,0.000936907,0.0021051713,0.00059799047,0.001424665,0.00071193324,0.0010289145,0.0003350657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001554863,0.000604027,0.0030139089,0.00056706654,0.00030859362,0.00014853424,0.00016612391,0.8248151,0.0037215492,0.011259985,0.0010602091,0.15278004],"study_design_scores_gemma":[0.00008520934,0.0010705948,0.0008400242,0.000042786294,0.00018048282,0.0000624738,0.000104310406,0.99021214,0.0017862332,0.004279027,0.0013170537,0.000019667892],"about_ca_topic_score_codex":0.0015654498,"about_ca_topic_score_gemma":0.0015987791,"teacher_disagreement_score":0.0049773385,"about_ca_system_score_codex":0.0014364087,"about_ca_system_score_gemma":0.0015566687,"threshold_uncertainty_score":0.021143675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09140543,0.00050448935,0.9003447,0.00041866416,0.000025848496,0.000384208,0.00016113764,0.00012158749,0.0066339746],"genre_scores_gemma":[0.61078787,0.00031996518,0.386672,0.000073813826,0.00002797081,0.00047992467,0.000218279,0.000042783642,0.0013774169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9746943,0.01803097,0.00096637465,0.0012422218,0.003962703,0.0011034409],"domain_scores_gemma":[0.9822645,0.011885145,0.0014808513,0.0012872512,0.0023693484,0.0007128938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01862031,0.0011082059,0.0029900982,0.00841355,0.0018318065,0.004980972,0.0015870059,0.0018373819,0.0020041934],"category_scores_gemma":[0.027168948,0.00079017045,0.0019420709,0.008561212,0.0016753761,0.004880894,0.0048213727,0.00113346,0.00023163584],"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.0004623451,0.00037219535,0.017301176,0.0007482174,0.000976756,0.00041349736,0.002272005,0.63344675,0.0030730304,0.109832115,0.0015131107,0.2295888],"study_design_scores_gemma":[0.000036600002,0.0001646382,0.0041092485,0.000100827114,0.00021372497,0.000115226394,0.0006835323,0.8998146,0.0007429957,0.09207536,0.0018990656,0.00004423261],"about_ca_topic_score_codex":0.006826043,"about_ca_topic_score_gemma":0.0073534064,"teacher_disagreement_score":0.01862031,"about_ca_system_score_codex":0.0028802676,"about_ca_system_score_gemma":0.004149141,"threshold_uncertainty_score":0.0984748},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009460258,0.0002856512,0.9856397,0.0001988297,0.00012073048,0.000108065244,0.00010196374,0.0005628989,0.0035217989],"genre_scores_gemma":[0.1395732,0.00031112455,0.8550409,0.00014357497,0.000099207085,0.00035882843,0.00024075672,0.00015251763,0.0040798658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911135,0.00016768799,0.00004631195,0.0002125901,0.00028321907,0.00017875848],"domain_scores_gemma":[0.99856913,0.000911638,0.00009627333,0.00014310729,0.00020474635,0.00007501143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014878843,0.001258173,0.0020361266,0.0010348398,0.0009845992,0.0016667752,0.0026062229,0.0023078178,0.0070298663],"category_scores_gemma":[0.0043154745,0.0011471059,0.0012219383,0.0018004536,0.00097365037,0.0025429586,0.0019320484,0.0015971183,0.0008752876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001563863,0.00011570264,0.0002842391,0.0001227311,0.00004515421,0.00007079786,0.00007073577,0.8553041,0.0010145543,0.01712256,0.002945725,0.122747295],"study_design_scores_gemma":[0.000058345664,0.000027383694,0.00006027841,0.0000074118648,0.000012175638,0.000024944316,0.000014741786,0.98953617,0.00017796365,0.009289299,0.00078440004,0.000006894368],"about_ca_topic_score_codex":0.014196717,"about_ca_topic_score_gemma":0.013867751,"teacher_disagreement_score":0.014196717,"about_ca_system_score_codex":0.001955867,"about_ca_system_score_gemma":0.004140304,"threshold_uncertainty_score":0.028228164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022934642,0.00055525557,0.9698696,0.0004978057,0.00015775418,0.0001609586,0.00030056055,0.00029090687,0.005232517],"genre_scores_gemma":[0.5619608,0.0011621992,0.4219353,0.0003247141,0.0003844227,0.0005866552,0.0007192476,0.00041026363,0.012516411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992379,0.00041500892,0.000024531735,0.00007869059,0.00013175994,0.00011211527],"domain_scores_gemma":[0.99657947,0.0026843091,0.00019993218,0.000097788725,0.00030185864,0.0001366735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002227426,0.0017774192,0.0030328424,0.0016856694,0.0008603832,0.0023594473,0.002135268,0.0023271756,0.0078089773],"category_scores_gemma":[0.0048266836,0.0021392056,0.0016093288,0.0031611174,0.001068289,0.002124749,0.001035353,0.0023712441,0.0006829102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036966107,0.000042413103,0.000104780505,0.00003489635,0.000022873324,0.00002126586,0.0000104742085,0.98663205,0.00010085362,0.0050919536,0.00084380433,0.0070576863],"study_design_scores_gemma":[0.0000050657036,0.0000052793166,0.000017127919,0.0000020574594,0.0000045734755,0.0000015848268,0.0000023323169,0.9981806,0.00002572265,0.0016937758,0.000059918333,0.0000020191874],"about_ca_topic_score_codex":0.026026621,"about_ca_topic_score_gemma":0.020335931,"teacher_disagreement_score":0.026026621,"about_ca_system_score_codex":0.001675913,"about_ca_system_score_gemma":0.0026325814,"threshold_uncertainty_score":0.051750243},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3737137,0.0020436477,0.5870176,0.007568225,0.00035532346,0.00034929696,0.0010428947,0.00026003906,0.027649352],"genre_scores_gemma":[0.976602,0.0007198659,0.015577541,0.00024955053,0.00032276136,0.00013107718,0.0002885826,0.000068578054,0.006040155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960133,0.002504963,0.0001431684,0.0005296512,0.00035153877,0.000457402],"domain_scores_gemma":[0.9800831,0.015906118,0.0017819824,0.0008837342,0.00078480283,0.00056024565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0120770885,0.0013252781,0.0034246675,0.0027719475,0.0009373915,0.004673637,0.0034606005,0.003504757,0.006281384],"category_scores_gemma":[0.025075091,0.0015059909,0.0029771607,0.0019950762,0.0025935154,0.006506793,0.0026656676,0.003537217,0.00024234879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001453866,0.00013111168,0.0032466552,0.00006789884,0.00027545044,0.0005073736,0.00015485652,0.58673984,0.00032897378,0.39525172,0.0021047809,0.011046019],"study_design_scores_gemma":[0.000036674206,0.000051389707,0.0010125885,0.000022159149,0.00008232227,0.000056510835,0.000081913866,0.8292429,0.00017226196,0.16858758,0.00062754896,0.000026059757],"about_ca_topic_score_codex":0.009196187,"about_ca_topic_score_gemma":0.0071239574,"teacher_disagreement_score":0.0120770885,"about_ca_system_score_codex":0.0036193426,"about_ca_system_score_gemma":0.0018349803,"threshold_uncertainty_score":0.06387055},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005124043,0.00014370622,0.99347717,0.000034936806,0.000015158852,0.000027603937,0.000032628748,0.000031925934,0.0011128299],"genre_scores_gemma":[0.3483987,0.0006208992,0.6440487,0.00008210448,0.0000722822,0.0004969015,0.00036541832,0.00012941545,0.005785643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99415094,0.0035425115,0.0003195842,0.00048192005,0.0010868562,0.00041812958],"domain_scores_gemma":[0.99168444,0.0062853163,0.0002822428,0.0005924089,0.0010394516,0.00011617705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008856982,0.0017272606,0.0026570356,0.00123203,0.0005292393,0.0032645124,0.0018260543,0.0012986276,0.0033526535],"category_scores_gemma":[0.01192776,0.0010917594,0.0025246656,0.0017742849,0.0008975155,0.0022716604,0.0017230946,0.0022150541,0.0005691899],"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.00014595002,0.00015686055,0.00051847304,0.00024382427,0.00026298276,0.00008647557,0.000102368336,0.84920675,0.0018139218,0.085480765,0.00065375457,0.061327923],"study_design_scores_gemma":[0.000016554424,0.000051537747,0.00024502128,0.00001853716,0.00004951485,0.000019332372,0.000013711606,0.97208965,0.000826993,0.025928315,0.00072555465,0.000015201961],"about_ca_topic_score_codex":0.002612803,"about_ca_topic_score_gemma":0.0029090578,"teacher_disagreement_score":0.008856982,"about_ca_system_score_codex":0.0011325664,"about_ca_system_score_gemma":0.0018560968,"threshold_uncertainty_score":0.046840787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25823346,0.0031572047,0.56360936,0.01691775,0.0007723277,0.0004944849,0.006832321,0.0012310891,0.14875211],"genre_scores_gemma":[0.8131522,0.001965522,0.02156331,0.00088733254,0.0003354788,0.0004032443,0.0018708849,0.00019866058,0.15962338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987509,0.0003854975,0.000047938225,0.00030765857,0.00018940853,0.0003184605],"domain_scores_gemma":[0.9969975,0.0020743716,0.00023372228,0.00010347771,0.00034349185,0.00024738547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021643878,0.0016192456,0.0033657297,0.0015847213,0.001462839,0.00567919,0.0050471257,0.00845606,0.03652972],"category_scores_gemma":[0.0066465978,0.001979099,0.0021864031,0.0024954705,0.0022554798,0.0059715603,0.0020185653,0.0040946854,0.0039923824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000194632,0.0002658591,0.0010377754,0.00013378775,0.000107051834,0.0003928361,0.00014806143,0.7529626,0.00075478386,0.2318043,0.0050721494,0.007126224],"study_design_scores_gemma":[0.00012884043,0.000045629073,0.00036530997,0.000012601228,0.000051439027,0.000082354374,0.00005599256,0.9588939,0.00006895352,0.038408305,0.0018509575,0.00003568542],"about_ca_topic_score_codex":0.039915215,"about_ca_topic_score_gemma":0.022573236,"teacher_disagreement_score":0.039915215,"about_ca_system_score_codex":0.0044581676,"about_ca_system_score_gemma":0.0031380558,"threshold_uncertainty_score":0.122204065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027993182,0.00018281756,0.96896195,0.00014149601,0.00005419451,0.00005363622,0.00021356829,0.0011378848,0.0012612594],"genre_scores_gemma":[0.61396,0.00025601947,0.3834572,0.00004069335,0.00004309588,0.00007848818,0.0003449389,0.00019304769,0.0016264262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975425,0.000065563465,0.000021172576,0.000058672038,0.00007458733,0.000025723994],"domain_scores_gemma":[0.99936074,0.00028185153,0.000030413734,0.00012439057,0.0001845581,0.000018098557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006886294,0.0004999766,0.00072619785,0.0007164966,0.0006594729,0.00083658885,0.00068610965,0.0006186668,0.0018445677],"category_scores_gemma":[0.003288042,0.00039564175,0.00043077406,0.0008529026,0.00031419884,0.00076701783,0.00063762226,0.00082439807,0.00038522485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019119107,0.00007642739,0.0022393072,0.000117722455,0.000080813305,0.00020806307,0.00007219051,0.68710417,0.017025722,0.014615826,0.0017910673,0.27647752],"study_design_scores_gemma":[0.0000031285317,0.0000057549473,0.00009740432,0.0000013178541,0.0000028940783,0.000008275388,0.000003082232,0.9971289,0.0012264063,0.0010456268,0.00047422523,0.000002977856],"about_ca_topic_score_codex":0.026093516,"about_ca_topic_score_gemma":0.01221645,"teacher_disagreement_score":0.026093516,"about_ca_system_score_codex":0.0004903738,"about_ca_system_score_gemma":0.0011870284,"threshold_uncertainty_score":0.05188328},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007990728,0.00047629615,0.98913574,0.00028690507,0.00008276147,0.000025666977,0.00004414989,0.00017830249,0.0017795027],"genre_scores_gemma":[0.38623774,0.00073511666,0.60421985,0.00021499109,0.00023118898,0.00032389906,0.00028791407,0.00029928307,0.0074500437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864656,0.0007700613,0.00006809203,0.00015915038,0.00026652368,0.00008959717],"domain_scores_gemma":[0.9875143,0.0105114225,0.0005152575,0.00052708545,0.00064829586,0.00028370472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003879699,0.001215624,0.0020866264,0.00086278905,0.0006977774,0.0017724322,0.0016015468,0.0023170444,0.003159929],"category_scores_gemma":[0.013988728,0.0015703682,0.0009972369,0.0010940754,0.0017475663,0.002668119,0.002400889,0.003658306,0.00039690596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053516786,0.00003074676,0.0001705605,0.000071573835,0.000030213896,0.000039121165,0.000027518618,0.9625906,0.00020632707,0.018400773,0.0006838699,0.017695088],"study_design_scores_gemma":[0.0000052265127,0.0000073014985,0.000016781221,0.000005148315,0.0000027030726,0.0000042434144,0.0000026211746,0.9895812,0.00008871774,0.01007028,0.00021338636,0.0000022676675],"about_ca_topic_score_codex":0.004982478,"about_ca_topic_score_gemma":0.0051261364,"teacher_disagreement_score":0.004982478,"about_ca_system_score_codex":0.0011049175,"about_ca_system_score_gemma":0.001418414,"threshold_uncertainty_score":0.020518064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16684915,0.0002990253,0.8294509,0.0007074443,0.00008338351,0.00010148251,0.000484031,0.0001568336,0.0018677948],"genre_scores_gemma":[0.8976125,0.000080131555,0.10046907,0.00010643999,0.000070498485,0.000287294,0.0004771684,0.00006129819,0.00083558186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96015143,0.02038156,0.0035566315,0.008168162,0.006246784,0.0014954432],"domain_scores_gemma":[0.87434393,0.09027244,0.009419011,0.017917356,0.0071267323,0.0009205282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.041120913,0.0014021217,0.0054379464,0.0018869748,0.0015950501,0.004147116,0.004339348,0.002523261,0.002114693],"category_scores_gemma":[0.15055397,0.0011981769,0.0020477197,0.0036261983,0.002613479,0.0067269136,0.0035257982,0.0032919277,0.0003159766],"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.002814796,0.0010176653,0.07459764,0.0016423776,0.0019359689,0.00086297235,0.0028037434,0.3701699,0.008221103,0.21021073,0.0030171943,0.32270592],"study_design_scores_gemma":[0.00011690972,0.000507563,0.022473842,0.0002783275,0.00034180627,0.00052136264,0.00078481995,0.7028101,0.013496336,0.25577995,0.0027570245,0.00013197017],"about_ca_topic_score_codex":0.0020658192,"about_ca_topic_score_gemma":0.0010917214,"teacher_disagreement_score":0.041120913,"about_ca_system_score_codex":0.0017567398,"about_ca_system_score_gemma":0.0023998532,"threshold_uncertainty_score":0.21747077},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07875371,0.0014327756,0.91382116,0.0012976965,0.00022297302,0.0003150778,0.0009813937,0.0005216601,0.002653487],"genre_scores_gemma":[0.3683444,0.0010672393,0.62396646,0.0005583554,0.00028068808,0.00043817295,0.0038312331,0.000036435362,0.001477079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9899649,0.0030454712,0.0015760494,0.0016473392,0.003428389,0.00033782577],"domain_scores_gemma":[0.9728617,0.018908389,0.0018934165,0.002175002,0.0038346914,0.00032679224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006653761,0.0010616983,0.0015417124,0.004599558,0.0013430511,0.0032653857,0.0029110736,0.0018872243,0.0021011722],"category_scores_gemma":[0.0375576,0.0007486067,0.0022516276,0.003471997,0.0015209733,0.004336502,0.0019849506,0.0032193854,0.0007904578],"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.0009005882,0.0014185547,0.04187623,0.0020416854,0.0017091638,0.0038178847,0.001313922,0.078177616,0.009569101,0.17135441,0.0120586585,0.6757622],"study_design_scores_gemma":[0.00020676028,0.00036221847,0.005359607,0.00037057666,0.00066430063,0.002908393,0.00052758795,0.56740594,0.007700972,0.40732518,0.0070579452,0.00011047851],"about_ca_topic_score_codex":0.00085933245,"about_ca_topic_score_gemma":0.0019770167,"teacher_disagreement_score":0.006653761,"about_ca_system_score_codex":0.0006831058,"about_ca_system_score_gemma":0.0022846882,"threshold_uncertainty_score":0.035188854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026610782,0.00041447076,0.96362257,0.00097204244,0.000058156802,0.00009550544,0.0005691044,0.00029137087,0.007366054],"genre_scores_gemma":[0.61321634,0.00064721884,0.3696972,0.00040560216,0.00020827638,0.0004773126,0.00071294943,0.00032907992,0.014306037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979717,0.0010940558,0.000052717704,0.00036864905,0.00025159013,0.00026120772],"domain_scores_gemma":[0.9969319,0.0021705315,0.0002467168,0.00018583582,0.0002083459,0.0002566815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029274612,0.0012283623,0.0029067737,0.0011290971,0.00056018407,0.0031181255,0.0037101055,0.0031937973,0.0076881424],"category_scores_gemma":[0.00724272,0.0012556434,0.0015597296,0.0026384098,0.0015625808,0.0040231547,0.002762343,0.00244499,0.00097560324],"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.00021630572,0.00012643475,0.0005052878,0.0003682124,0.000107056636,0.00014513274,0.000112859736,0.82518166,0.0020655957,0.14644635,0.0062062535,0.018518748],"study_design_scores_gemma":[0.000025315216,0.00004098256,0.00011556679,0.000018309018,0.000017918386,0.000039411112,0.000024085994,0.95349956,0.00030368657,0.045074213,0.00082814804,0.00001270364],"about_ca_topic_score_codex":0.0025746636,"about_ca_topic_score_gemma":0.0032463525,"teacher_disagreement_score":0.0076881424,"about_ca_system_score_codex":0.0034043398,"about_ca_system_score_gemma":0.0017998487,"threshold_uncertainty_score":0.025719345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94517195,0.0026702518,0.029533,0.008605896,0.00009519473,0.00022050447,0.0014939274,0.00016832468,0.012040906],"genre_scores_gemma":[0.9858385,0.0009815076,0.010217415,0.00019898193,0.0000216688,0.000064509964,0.00035522346,0.0000671184,0.002255066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801,0.000893446,0.00012206085,0.00023777047,0.00033572895,0.00040103245],"domain_scores_gemma":[0.99061275,0.00624457,0.00041241644,0.0002553502,0.002099406,0.00037553094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005846318,0.0007135974,0.0013785851,0.0013915071,0.0025460687,0.0047333264,0.0030429023,0.0020726712,0.0019157259],"category_scores_gemma":[0.019862339,0.0008884608,0.0014822622,0.0027650413,0.0018971232,0.0017148235,0.0012715916,0.002335246,0.00008817847],"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.00017030674,0.00010296815,0.0066499664,0.00007419651,0.000089196365,0.000036147536,0.00018142168,0.96262985,0.0001805974,0.02428776,0.00089502655,0.004702538],"study_design_scores_gemma":[0.00009782475,0.00002579649,0.0062430725,0.000034412198,0.000116727686,0.0000078536905,0.00048964546,0.9827041,0.000449864,0.008155966,0.0016102677,0.00006449795],"about_ca_topic_score_codex":0.9878934,"about_ca_topic_score_gemma":0.9823445,"teacher_disagreement_score":0.065397754,"about_ca_system_score_codex":0.065397754,"about_ca_system_score_gemma":0.059751693,"threshold_uncertainty_score":0.47449613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030807449,0.00088165584,0.96192575,0.0002346743,0.000102173064,0.00016222474,0.0001724839,0.0018267793,0.0038868126],"genre_scores_gemma":[0.1875549,0.00023280439,0.8081719,0.00015583386,0.00004433419,0.000355229,0.0003072693,0.00023203416,0.002945653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994849,0.00024498903,0.000024287318,0.00007891523,0.00010732911,0.000059556245],"domain_scores_gemma":[0.9985139,0.0010282291,0.00008156193,0.00009841982,0.00023152505,0.000046413636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001509129,0.0007778628,0.0012502184,0.0016907542,0.00083971594,0.00084342,0.0017849758,0.0015699121,0.006994834],"category_scores_gemma":[0.003570711,0.00064600346,0.00055116747,0.001688203,0.00068184757,0.0011253721,0.0007062134,0.00075668335,0.0008738309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026563686,0.00014311951,0.0005092026,0.00012873136,0.0000620486,0.00003849626,0.000083020546,0.74158293,0.0017216429,0.006755757,0.005690044,0.24301939],"study_design_scores_gemma":[0.000060613173,0.00004589459,0.000053124342,0.000008146066,0.000011184223,0.000012224157,0.000011242386,0.99635434,0.00030364504,0.0026050017,0.0005296964,0.0000048231177],"about_ca_topic_score_codex":0.004948824,"about_ca_topic_score_gemma":0.004536786,"teacher_disagreement_score":0.006994834,"about_ca_system_score_codex":0.0009911201,"about_ca_system_score_gemma":0.001468849,"threshold_uncertainty_score":0.023400068},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22662495,0.0051550376,0.7091008,0.0039066407,0.00070093,0.00020053043,0.0007400564,0.00044340355,0.053127617],"genre_scores_gemma":[0.74438053,0.005887922,0.22299838,0.0012101416,0.0007313471,0.0002297537,0.0014787657,0.00043816032,0.022644987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934393,0.0002616547,0.000027161208,0.00013863813,0.00013169541,0.000096997355],"domain_scores_gemma":[0.9976865,0.0013891004,0.0002306756,0.0002784324,0.00022141477,0.0001937597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041637,0.0012235991,0.0018656648,0.0014230574,0.0012511552,0.0016783806,0.0017599947,0.0013935135,0.0072120237],"category_scores_gemma":[0.0070248623,0.0006574697,0.0010062543,0.0030652655,0.001511597,0.0041263406,0.0031498412,0.0023393387,0.00060877757],"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.00029073688,0.00007914802,0.00064677297,0.00043787694,0.000115510906,0.00021833282,0.0005590181,0.15563907,0.0035819083,0.7403218,0.015709778,0.08239999],"study_design_scores_gemma":[0.00003381975,0.00004002357,0.00035265362,0.000056026387,0.000033152937,0.0001236299,0.0001109203,0.12424807,0.00035945344,0.8693575,0.0052717426,0.000013003025],"about_ca_topic_score_codex":0.0021956426,"about_ca_topic_score_gemma":0.0032086053,"teacher_disagreement_score":0.0072120237,"about_ca_system_score_codex":0.0015103631,"about_ca_system_score_gemma":0.0006840041,"threshold_uncertainty_score":0.02412659},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70128083,0.00044481774,0.27908018,0.00084188965,0.000089644534,0.00019438098,0.00051053986,0.00027573673,0.017281944],"genre_scores_gemma":[0.9742619,0.00014279275,0.019783307,0.000057474917,0.000026108859,0.00008561622,0.00012892956,0.00004999926,0.005463907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945253,0.00021172676,0.000010922821,0.00007556041,0.000045114324,0.00020406897],"domain_scores_gemma":[0.99806875,0.0012075789,0.0002117058,0.00007993241,0.00017474969,0.00025726744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014668104,0.0006652707,0.0011098735,0.0007864217,0.0005107538,0.0012354908,0.0011232813,0.0011426917,0.00691184],"category_scores_gemma":[0.0040749107,0.0008481115,0.0003520395,0.001054274,0.0007001838,0.0011670452,0.0008503319,0.000544725,0.0005381982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034485408,0.00007842752,0.0008250035,0.000058139987,0.000015076086,0.000045809666,0.000050200884,0.9795563,0.0015016809,0.005107826,0.0013320877,0.011084545],"study_design_scores_gemma":[0.00007181354,0.00012018341,0.0013010413,0.000011679037,0.0000133844005,0.000021085032,0.00014253797,0.98663914,0.0006135299,0.010525178,0.00052986614,0.000010651413],"about_ca_topic_score_codex":0.0056447396,"about_ca_topic_score_gemma":0.008105875,"teacher_disagreement_score":0.00691184,"about_ca_system_score_codex":0.0013382967,"about_ca_system_score_gemma":0.001488785,"threshold_uncertainty_score":0.02312243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043838965,0.8596275,0.13060607,0.00064406975,0.000562795,0.00008207488,0.00011907731,0.00045786425,0.0035166205],"genre_scores_gemma":[0.018481152,0.8893847,0.08910875,0.00022412067,0.0007420481,0.00008397051,0.0002827272,0.000105494015,0.0015870038],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886703,0.00021337283,0.00014908132,0.00023265825,0.00046685114,0.00007101437],"domain_scores_gemma":[0.9967361,0.0019416909,0.0003989408,0.00017612631,0.00068559527,0.00006144402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026899523,0.0015690328,0.0031202368,0.0014229484,0.0003169354,0.0018573639,0.0032634158,0.001393842,0.0019464059],"category_scores_gemma":[0.005003673,0.0008271651,0.0009760881,0.0043724175,0.00046860223,0.0028516934,0.00069430546,0.0008845903,0.0016325635],"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.00012654306,0.0001149365,0.0005049134,0.0077520087,0.00014339385,0.00012264449,0.000058770256,0.038725886,0.0025741756,0.0047364673,0.004385877,0.94075435],"study_design_scores_gemma":[0.00032012264,0.0016849785,0.0032084102,0.007171081,0.00090011494,0.0029959797,0.00059713545,0.15406387,0.020037808,0.051344592,0.7573865,0.0002894418],"about_ca_topic_score_codex":0.0026916577,"about_ca_topic_score_gemma":0.0025540458,"teacher_disagreement_score":0.0032634158,"about_ca_system_score_codex":0.0006056383,"about_ca_system_score_gemma":0.002137439,"threshold_uncertainty_score":0.014226019},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10908976,0.0036289184,0.86241794,0.0030915267,0.00024063737,0.00009606699,0.00045460725,0.0001340968,0.020846417],"genre_scores_gemma":[0.8025799,0.004770371,0.15929689,0.00073504273,0.0007488475,0.00026929678,0.00093565194,0.00023385431,0.030430207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879265,0.00066869246,0.00004179651,0.00015537211,0.00024601867,0.00009544488],"domain_scores_gemma":[0.9931605,0.00570457,0.0004835762,0.00016099795,0.00025135762,0.00023908891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002266164,0.0011854559,0.0017245987,0.0016998888,0.0011002735,0.0025982624,0.0019025691,0.003926259,0.0049772607],"category_scores_gemma":[0.013242628,0.0013432943,0.001369784,0.0022118262,0.0020882078,0.0055532153,0.0029835268,0.0032838036,0.0003135755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075983946,0.00009973157,0.0005378727,0.00031682692,0.00010343873,0.0002547646,0.00016030762,0.5555337,0.00068145455,0.4301392,0.0034459739,0.008650794],"study_design_scores_gemma":[0.000025513502,0.000028167444,0.00020506338,0.000044588607,0.00003130138,0.000066304536,0.00007645293,0.65962774,0.00023613028,0.3380764,0.0015652601,0.000017041752],"about_ca_topic_score_codex":0.0015723506,"about_ca_topic_score_gemma":0.0017753476,"teacher_disagreement_score":0.0049772607,"about_ca_system_score_codex":0.0012248778,"about_ca_system_score_gemma":0.0006762594,"threshold_uncertainty_score":0.016650558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096133195,0.0018698765,0.8842361,0.0027706854,0.0005630865,0.00019522113,0.0010159538,0.00058862014,0.012627403],"genre_scores_gemma":[0.95676214,0.0015177529,0.021401547,0.00031283658,0.00033551233,0.00017608187,0.00038811678,0.00012820143,0.01897786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976699,0.0004805545,0.00010577706,0.00053210114,0.0004927421,0.0007189452],"domain_scores_gemma":[0.9950943,0.0029756296,0.0005203032,0.00020154413,0.00084946444,0.00035883547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033254973,0.0014944986,0.0024142324,0.001700967,0.0018409806,0.004401843,0.0051268023,0.0035712048,0.0062207854],"category_scores_gemma":[0.009452407,0.0016466108,0.0014537042,0.0021885224,0.00238514,0.0040146,0.001776197,0.003379669,0.0010640809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011856117,0.00009851617,0.0008081368,0.00007237504,0.000049531136,0.00030727038,0.00021704387,0.84804213,0.0015805593,0.14233574,0.0019902322,0.0043799477],"study_design_scores_gemma":[0.000014130562,0.000015279815,0.00013350998,0.0000075375783,0.00001711477,0.000030419376,0.000022872186,0.9879661,0.00008851171,0.011338055,0.000347905,0.000018490198],"about_ca_topic_score_codex":0.053002123,"about_ca_topic_score_gemma":0.02581704,"teacher_disagreement_score":0.053002123,"about_ca_system_score_codex":0.0068929438,"about_ca_system_score_gemma":0.005653715,"threshold_uncertainty_score":0.10538721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059004776,0.0005849846,0.9313569,0.0007545194,0.0002053166,0.00020381188,0.00029431903,0.0012498441,0.006345444],"genre_scores_gemma":[0.33971423,0.00026389363,0.6553478,0.00016461963,0.00007757859,0.0003481782,0.0005274127,0.00016104779,0.0033952463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910814,0.00028040458,0.000043212658,0.00017966388,0.00017393588,0.00021465193],"domain_scores_gemma":[0.9975932,0.0014544124,0.0001710119,0.00031081878,0.00023841123,0.00023208895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017773946,0.0011659602,0.0021504671,0.00082094263,0.0009900305,0.0016392204,0.0034621237,0.0021905692,0.006572576],"category_scores_gemma":[0.004348922,0.0007782135,0.0009779386,0.0014943812,0.00088719476,0.0027627267,0.0020676414,0.0020259358,0.0008487736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057894643,0.00025124228,0.0006079922,0.00020526988,0.00007208358,0.00009697964,0.00009599021,0.8862748,0.0015233493,0.022723656,0.0045105033,0.08305916],"study_design_scores_gemma":[0.00007762749,0.000042821754,0.000066382796,0.000007889804,0.000009855637,0.000019062642,0.000019252193,0.98992294,0.00019075547,0.009226223,0.0004127411,0.0000045221946],"about_ca_topic_score_codex":0.005417665,"about_ca_topic_score_gemma":0.006239195,"teacher_disagreement_score":0.006572576,"about_ca_system_score_codex":0.0018187991,"about_ca_system_score_gemma":0.0028209547,"threshold_uncertainty_score":0.021987438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042728893,0.0063247387,0.92246026,0.0027803201,0.0007384968,0.00030121458,0.0021258325,0.002011884,0.020528372],"genre_scores_gemma":[0.5665932,0.007265119,0.3949328,0.0013612293,0.0017573542,0.0013419727,0.005414968,0.0032974787,0.018035758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97639287,0.0054414347,0.0013069547,0.002352017,0.009923524,0.0045832093],"domain_scores_gemma":[0.8969759,0.07210405,0.005101367,0.016557213,0.0066298298,0.002631657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017708357,0.006639587,0.0053013344,0.0052146884,0.0024522254,0.011715862,0.011809486,0.0038339093,0.015762849],"category_scores_gemma":[0.08146263,0.0035197136,0.0029846134,0.009810497,0.0036971522,0.023360027,0.010730854,0.009676977,0.004039347],"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.0024774084,0.00063553336,0.0016125316,0.0009572562,0.0002742543,0.00022482287,0.000361604,0.77370936,0.006882399,0.087320134,0.016334346,0.10921033],"study_design_scores_gemma":[0.000046701505,0.00019711388,0.00031147627,0.000111142705,0.000099591685,0.0001591343,0.000095133786,0.89701587,0.003606114,0.09552557,0.0027837718,0.00004844203],"about_ca_topic_score_codex":0.0027875924,"about_ca_topic_score_gemma":0.0033883,"teacher_disagreement_score":0.017708357,"about_ca_system_score_codex":0.00593103,"about_ca_system_score_gemma":0.004238696,"threshold_uncertainty_score":0.09365189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005431766,0.00028442292,0.9934028,0.00008675261,0.00008155034,0.00005681979,0.000040114668,0.0000661258,0.00054954085],"genre_scores_gemma":[0.1024379,0.00028371002,0.8957626,0.00006747926,0.0001294845,0.00028738438,0.0001180356,0.000086617074,0.0008268867],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894481,0.00514752,0.001020739,0.0008303212,0.0033744837,0.00017887255],"domain_scores_gemma":[0.98307747,0.010099771,0.0009786439,0.0013262231,0.004097894,0.00042001368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011998297,0.0011860975,0.0027351948,0.004405903,0.0010606768,0.0030102662,0.0018635455,0.0017636879,0.0018919988],"category_scores_gemma":[0.031030502,0.000515317,0.002267224,0.0048524714,0.0012527914,0.004509463,0.0032025608,0.0027910038,0.00043742658],"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.00037262973,0.00040473032,0.0022693512,0.0010331841,0.0007819564,0.00016802353,0.00055148464,0.08460604,0.012951452,0.14915964,0.003325507,0.74437594],"study_design_scores_gemma":[0.000083594416,0.00088010373,0.0027033333,0.00016474184,0.00029278974,0.00040659794,0.00012920516,0.88049555,0.0051123523,0.10284251,0.0066747437,0.00021445363],"about_ca_topic_score_codex":0.0012572663,"about_ca_topic_score_gemma":0.0012693222,"teacher_disagreement_score":0.011998297,"about_ca_system_score_codex":0.0013462706,"about_ca_system_score_gemma":0.0023705235,"threshold_uncertainty_score":0.06345379},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115436,0.0000924649,0.977957,0.00018526369,0.0001096265,0.00007476847,0.0001308551,0.00022466133,0.009681741],"genre_scores_gemma":[0.3352959,0.0005052867,0.64170325,0.00019310974,0.00017283094,0.00030480183,0.00095887296,0.0006463806,0.020219555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995272,0.00016322643,0.00001540095,0.00008590648,0.00015697093,0.00005142995],"domain_scores_gemma":[0.99973017,0.0001050797,0.00002337485,0.00006757418,0.000054963886,0.000018914769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044259636,0.00067268196,0.0007895409,0.00057104346,0.0004008546,0.0009751372,0.0009720969,0.00060321676,0.006784406],"category_scores_gemma":[0.0014431752,0.0002785555,0.0009456636,0.0008124398,0.0005744863,0.0011144811,0.0017799413,0.0014791143,0.0014547784],"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.0001280366,0.0001607797,0.0003111708,0.00016305094,0.000035955138,0.00022018101,0.0001546044,0.40286133,0.008460804,0.3459192,0.011435161,0.23014987],"study_design_scores_gemma":[0.00002828399,0.000050629773,0.00010260281,0.000010353665,0.000012156314,0.000092247166,0.000045682427,0.8436435,0.0010707688,0.14456986,0.010364706,0.000009145508],"about_ca_topic_score_codex":0.002035799,"about_ca_topic_score_gemma":0.0019068868,"teacher_disagreement_score":0.006784406,"about_ca_system_score_codex":0.0004983805,"about_ca_system_score_gemma":0.0009009123,"threshold_uncertainty_score":0.022696137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056117438,0.00045356477,0.93269694,0.0003656675,0.00004140297,0.00012525648,0.0000646107,0.00015188447,0.00998321],"genre_scores_gemma":[0.9029761,0.0003845915,0.092490725,0.000053591877,0.000028548226,0.000105509396,0.00005564877,0.000044674463,0.0038606233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922144,0.0003021427,0.000032477044,0.00013897603,0.00019598685,0.00010895991],"domain_scores_gemma":[0.99813026,0.0011005771,0.00021427847,0.0001211639,0.00035441093,0.00007929748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018532682,0.00077589584,0.00094341784,0.0009788083,0.0008609466,0.0016150614,0.0010464889,0.0013788161,0.0051334267],"category_scores_gemma":[0.00493036,0.0006486016,0.00065318024,0.00083325576,0.00091261114,0.0023321896,0.0016470687,0.0008366753,0.0003247391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001588316,0.000039688744,0.00037867096,0.00015080729,0.00003488046,0.00007301395,0.000118349686,0.91911113,0.004010415,0.039387483,0.00039003493,0.03614658],"study_design_scores_gemma":[0.000011127429,0.00005889488,0.00006216536,0.000017754624,0.000015645719,0.00001109181,0.000019269872,0.97857326,0.0011105835,0.019507544,0.0006054532,0.0000072170283],"about_ca_topic_score_codex":0.0032564744,"about_ca_topic_score_gemma":0.0028266206,"teacher_disagreement_score":0.0051334267,"about_ca_system_score_codex":0.0016214625,"about_ca_system_score_gemma":0.0018786123,"threshold_uncertainty_score":0.017172992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92236245,0.00011138871,0.06191175,0.00070619106,0.00007854893,0.00035190853,0.00032526933,0.00033514833,0.013817409],"genre_scores_gemma":[0.9832767,0.000061249906,0.01538393,0.00002642685,0.000005397206,0.00005382559,0.000084229556,0.000021477706,0.0010867958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987412,0.00072665745,0.000065937755,0.0001334746,0.0001865579,0.000146155],"domain_scores_gemma":[0.9944371,0.0042273244,0.00018644573,0.00035671075,0.00033549062,0.00045689815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002333207,0.0005691018,0.0005583011,0.0005687583,0.0015147863,0.0022089006,0.0014031302,0.002013678,0.0027427776],"category_scores_gemma":[0.0052170437,0.00033391453,0.0006735277,0.0007556147,0.001051,0.0012136925,0.001115748,0.0010022398,0.00031073845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010391211,0.0012566149,0.014721571,0.00020467634,0.00011094014,0.0034407072,0.0018923088,0.93157643,0.004051952,0.015556211,0.0015000642,0.024649417],"study_design_scores_gemma":[0.0001235796,0.00035489697,0.0030367586,0.000032820146,0.000050196555,0.0002447791,0.0014219584,0.98521847,0.0025688803,0.003732852,0.0031695126,0.00004522382],"about_ca_topic_score_codex":0.0151898395,"about_ca_topic_score_gemma":0.00860562,"teacher_disagreement_score":0.0151898395,"about_ca_system_score_codex":0.0017347743,"about_ca_system_score_gemma":0.0019775773,"threshold_uncertainty_score":0.030202806},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057886407,0.0023965926,0.91101235,0.0019935155,0.00035858288,0.00031507545,0.00090058614,0.0013086156,0.023828303],"genre_scores_gemma":[0.31345513,0.0009713801,0.6762844,0.0003553964,0.00024326796,0.00037860262,0.0009647997,0.0003208896,0.0070261504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885774,0.00041846678,0.00005245239,0.00023175348,0.00021209293,0.00022745895],"domain_scores_gemma":[0.99544734,0.0035621554,0.00022669639,0.00031967822,0.00026038478,0.00018379648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200261,0.0012107856,0.0016629162,0.001657773,0.00125932,0.0025715102,0.002793314,0.0026622317,0.011473561],"category_scores_gemma":[0.007509426,0.0009864616,0.0012550014,0.0028164578,0.0014714496,0.0032561615,0.001841885,0.002330209,0.0009805416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031467178,0.00030862464,0.0005393156,0.00025195887,0.000065642955,0.00006210133,0.00010763766,0.86249036,0.00056738127,0.033716284,0.008776065,0.09280002],"study_design_scores_gemma":[0.00011685564,0.000054751225,0.00018942416,0.000022054548,0.000018544148,0.00003284796,0.000076659846,0.9388372,0.00022712459,0.059202723,0.0012087328,0.000013130071],"about_ca_topic_score_codex":0.011252272,"about_ca_topic_score_gemma":0.016777629,"teacher_disagreement_score":0.011473561,"about_ca_system_score_codex":0.0028709497,"about_ca_system_score_gemma":0.0039788745,"threshold_uncertainty_score":0.038382888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98274153,0.00059318484,0.0066967756,0.0013430759,0.00012502624,0.000059419664,0.00014345569,0.000037695812,0.008259774],"genre_scores_gemma":[0.9985763,0.000057997215,0.00028053686,0.00004965403,0.00006797032,0.000010213353,0.000059388436,0.000011967101,0.0008859144],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98825467,0.007228256,0.00041783976,0.0014913313,0.00074513286,0.001862698],"domain_scores_gemma":[0.6261514,0.32051358,0.028009221,0.01209158,0.005473587,0.00776057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027436303,0.00045449415,0.0018622396,0.0010332346,0.0013962248,0.0046940665,0.0022053185,0.0024303014,0.022872996],"category_scores_gemma":[0.1480687,0.00046026355,0.0013647395,0.0012449507,0.0037165158,0.0058974307,0.0020068781,0.0040998496,0.0011293585],"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.046398,0.0031053515,0.46867508,0.0007826028,0.0021056894,0.0008876226,0.0057357964,0.08090703,0.0023178095,0.2553072,0.013778156,0.11999974],"study_design_scores_gemma":[0.004416922,0.0077994876,0.41184658,0.00019533168,0.0026977195,0.0005318314,0.008860126,0.23782961,0.002716351,0.31768557,0.00510874,0.000311881],"about_ca_topic_score_codex":0.0048528,"about_ca_topic_score_gemma":0.0061603445,"teacher_disagreement_score":0.027436303,"about_ca_system_score_codex":0.0012557822,"about_ca_system_score_gemma":0.0017144277,"threshold_uncertainty_score":0.14509875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17000459,0.00045112788,0.8260629,0.0004357535,0.00024177137,0.00013890926,0.00016580074,0.00046495622,0.0020341687],"genre_scores_gemma":[0.91272044,0.00032969782,0.08009989,0.00012043588,0.0002805746,0.000110435576,0.00016941653,0.00006664841,0.0061023957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961837,0.00095029257,0.00043980492,0.000797916,0.00079999387,0.0008282562],"domain_scores_gemma":[0.9828189,0.008916494,0.0017582242,0.0019194077,0.0030730576,0.0015139432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0078771245,0.0012876336,0.002864383,0.0018192199,0.002591852,0.0052621323,0.0059613404,0.0020493162,0.003559949],"category_scores_gemma":[0.017929036,0.0013473526,0.0012996335,0.0035236815,0.0014727308,0.0064472836,0.0029488814,0.0023010296,0.00067185576],"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.0018516144,0.0006471166,0.0076251957,0.00023024515,0.00022899454,0.0012099275,0.0004431407,0.7811765,0.012785933,0.14951444,0.0021163179,0.042170573],"study_design_scores_gemma":[0.000031538104,0.000065224136,0.000295311,0.000005745806,0.000046075842,0.000060048278,0.000025240905,0.9876836,0.0009904259,0.01062544,0.00015110725,0.000020268546],"about_ca_topic_score_codex":0.004743862,"about_ca_topic_score_gemma":0.0048075253,"teacher_disagreement_score":0.0078771245,"about_ca_system_score_codex":0.0031634849,"about_ca_system_score_gemma":0.0030405007,"threshold_uncertainty_score":0.0416587},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05332885,0.005086954,0.91625285,0.0018988989,0.000122435,0.00006797774,0.00033432545,0.00011605574,0.022791592],"genre_scores_gemma":[0.812474,0.0071351933,0.16373257,0.00033830456,0.00029340986,0.0002564138,0.00041105767,0.00028087734,0.015078167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980584,0.0010973894,0.000116450035,0.00020725558,0.00037208933,0.00014845519],"domain_scores_gemma":[0.9741145,0.021946745,0.0012521242,0.0011582812,0.001217737,0.0003105771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069064447,0.0015298306,0.0013449565,0.002030816,0.0006074095,0.004437983,0.0015332272,0.0014964574,0.0066996478],"category_scores_gemma":[0.037595544,0.0009941425,0.001390558,0.003049664,0.0031404677,0.007998093,0.0019406611,0.0041958774,0.0005278121],"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.0000342439,0.000040799267,0.0006824052,0.00021036394,0.000050763698,0.00008750878,0.0002330138,0.16557124,0.0007051402,0.81234133,0.0013680741,0.01867506],"study_design_scores_gemma":[0.00000967382,0.000024190493,0.00078000675,0.00008557018,0.000029051631,0.000085860294,0.000084179526,0.21405351,0.00059945264,0.78132874,0.0028913228,0.000028442513],"about_ca_topic_score_codex":0.0030290643,"about_ca_topic_score_gemma":0.0024156016,"teacher_disagreement_score":0.0069064447,"about_ca_system_score_codex":0.00252058,"about_ca_system_score_gemma":0.002313642,"threshold_uncertainty_score":0.03652525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8398658,0.0001463259,0.14423877,0.0012917164,0.00020146368,0.00050182414,0.00031627005,0.0006451937,0.012792647],"genre_scores_gemma":[0.9431502,0.000048265105,0.055926308,0.00007482492,0.000011156917,0.00013078142,0.00011885616,0.00003747215,0.00050223223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982339,0.0011411227,0.000065036766,0.00013138991,0.0002204063,0.00020803846],"domain_scores_gemma":[0.98009366,0.017049443,0.00050220377,0.00069226604,0.0012191314,0.0004433114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003204816,0.001150763,0.00054853334,0.0006655336,0.00053467805,0.0013881418,0.0014660095,0.0016552734,0.0035253793],"category_scores_gemma":[0.017193316,0.00047826013,0.0006917251,0.0005731977,0.00088640396,0.0014573865,0.0008232418,0.0014775574,0.00016722342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003790393,0.0006242701,0.001635286,0.0000594371,0.000032643413,0.000024636922,0.00008341115,0.98661774,0.0007119211,0.0034572484,0.00032228712,0.0060520736],"study_design_scores_gemma":[0.000102065875,0.00022376244,0.00015935389,0.000006682236,0.000013912002,0.0000033610104,0.00006349441,0.99651164,0.0007862524,0.0019500925,0.00017257579,0.00000669774],"about_ca_topic_score_codex":0.012198533,"about_ca_topic_score_gemma":0.006559627,"teacher_disagreement_score":0.012198533,"about_ca_system_score_codex":0.0020533702,"about_ca_system_score_gemma":0.002349139,"threshold_uncertainty_score":0.024255097},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003466491,0.084532924,0.89494246,0.0053857546,0.0005368594,0.000050835682,0.00015468644,0.00014946483,0.010780461],"genre_scores_gemma":[0.1281424,0.20937023,0.64289623,0.0024388696,0.0056376285,0.0003109839,0.0007797542,0.00036958774,0.010054339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997186,0.001419946,0.00014291058,0.00042110684,0.00066392415,0.00016618836],"domain_scores_gemma":[0.98818785,0.009400312,0.00067880267,0.00047337,0.0010116918,0.00024799054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052631856,0.0027311032,0.0034019544,0.002420002,0.0006374625,0.005892264,0.0054516816,0.0031052995,0.008499015],"category_scores_gemma":[0.010939365,0.0013808663,0.002853264,0.0048900344,0.002438995,0.007037889,0.002474787,0.0049675764,0.0025340808],"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.00008269979,0.00035861338,0.0011753031,0.0034687137,0.00038978673,0.00008497473,0.00019925139,0.35617465,0.00065777806,0.36153793,0.014983502,0.2608868],"study_design_scores_gemma":[0.000028334234,0.000067836125,0.0003903444,0.0005440207,0.0000622257,0.00010284322,0.00016545437,0.65798527,0.00026578273,0.3039378,0.03639374,0.00005641522],"about_ca_topic_score_codex":0.003532991,"about_ca_topic_score_gemma":0.0031248173,"teacher_disagreement_score":0.008499015,"about_ca_system_score_codex":0.0019235014,"about_ca_system_score_gemma":0.0022297078,"threshold_uncertainty_score":0.028432071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045850232,0.0006483452,0.94769347,0.00053807447,0.00011939236,0.00009318136,0.00009830478,0.00012354016,0.0048355437],"genre_scores_gemma":[0.73301566,0.000500758,0.25819936,0.00019073031,0.00011087462,0.00037639088,0.00027590102,0.000100038575,0.007230172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963474,0.00017965096,0.000013339128,0.000071058246,0.000062153245,0.000038956834],"domain_scores_gemma":[0.99841666,0.0012044344,0.00012534286,0.00004367632,0.0001250717,0.000084775405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012707115,0.0006153531,0.0015861153,0.00072242523,0.00047773955,0.0008293975,0.0018302822,0.0016635339,0.002531434],"category_scores_gemma":[0.0040223883,0.0005950771,0.00062164693,0.000804402,0.0007424799,0.0013890404,0.0014980199,0.0009332791,0.00021199005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007383151,0.0000328002,0.00022999004,0.00003670752,0.000022267974,0.000031574345,0.000023433111,0.98371685,0.00024659347,0.005921503,0.00078853144,0.008875942],"study_design_scores_gemma":[0.000008346438,0.000012538405,0.000021117989,0.0000017537046,0.0000018534953,0.0000028979955,0.0000043618147,0.99900144,0.00001861384,0.0008315084,0.00009424696,0.0000013528826],"about_ca_topic_score_codex":0.008650142,"about_ca_topic_score_gemma":0.0062388433,"teacher_disagreement_score":0.008650142,"about_ca_system_score_codex":0.0008120207,"about_ca_system_score_gemma":0.0011875384,"threshold_uncertainty_score":0.017199636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16481759,0.00082084053,0.8114378,0.0027911798,0.00048402284,0.00034408685,0.0008022224,0.00027086225,0.018231433],"genre_scores_gemma":[0.8974142,0.0004920841,0.084456414,0.00026750448,0.0001844777,0.000249213,0.0005230655,0.00010488681,0.016308265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913484,0.0003076574,0.000029026716,0.00026017556,0.000100767706,0.00016753594],"domain_scores_gemma":[0.99844295,0.001086691,0.00015176016,0.00007297368,0.00011846357,0.00012719641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017755487,0.0013464944,0.0017612306,0.0005893622,0.0008197407,0.0019520434,0.002195137,0.0034710665,0.008254534],"category_scores_gemma":[0.004440733,0.0012098149,0.0011325193,0.0012469485,0.0010615886,0.0017778219,0.0017279948,0.0016417666,0.0004125009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010367928,0.00003828415,0.00015503944,0.00007793783,0.000019136973,0.00016526683,0.000028465452,0.9865035,0.00036173908,0.007604997,0.0010753631,0.0038666707],"study_design_scores_gemma":[0.0000375876,0.000056247787,0.00009072804,0.000005417301,0.000012173442,0.000030161385,0.000041275216,0.9941397,0.00011392573,0.004891677,0.00057355943,0.0000076013916],"about_ca_topic_score_codex":0.008052316,"about_ca_topic_score_gemma":0.005228395,"teacher_disagreement_score":0.008254534,"about_ca_system_score_codex":0.0016383872,"about_ca_system_score_gemma":0.0017109736,"threshold_uncertainty_score":0.027614176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9306479,0.0004698979,0.022205211,0.0042269384,0.0002722498,0.00014900044,0.0018009387,0.00027335627,0.039954524],"genre_scores_gemma":[0.98626745,0.00016960138,0.0025242914,0.00017357501,0.00003734719,0.00007046747,0.00045769362,0.000046423866,0.010253176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953806,0.00016164764,0.00001761206,0.000062540894,0.000036058595,0.00018407789],"domain_scores_gemma":[0.99800164,0.0011336509,0.00023015661,0.00005140104,0.00022431403,0.00035879787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009396793,0.0012149584,0.00118135,0.0008957812,0.0010852256,0.0024442063,0.0019701687,0.004617898,0.0090135895],"category_scores_gemma":[0.0033771326,0.000958863,0.0013079036,0.00071943185,0.0012952171,0.0015207067,0.0014869063,0.00233743,0.0006429857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044662786,0.00002504772,0.0005864573,0.000008739292,0.000012699888,0.000043334465,0.000011247958,0.9979602,0.00007051932,0.00076495967,0.00019685294,0.0002752252],"study_design_scores_gemma":[0.000026923148,0.000033176413,0.0002707882,0.0000045010343,0.0000112035195,0.000005565807,0.00006893976,0.99879324,0.00004339434,0.00053270994,0.00020330385,0.00000634315],"about_ca_topic_score_codex":0.16734922,"about_ca_topic_score_gemma":0.061515328,"teacher_disagreement_score":0.16734922,"about_ca_system_score_codex":0.0033562293,"about_ca_system_score_gemma":0.0042524883,"threshold_uncertainty_score":0.33275026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22816117,0.00069400895,0.76186705,0.0008162371,0.0001103468,0.00018807984,0.00012816247,0.0002190218,0.007815987],"genre_scores_gemma":[0.91703343,0.00027651023,0.078465246,0.00009015581,0.000056317433,0.0001609772,0.000063802254,0.00004563744,0.003808016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981811,0.001040889,0.00009074026,0.00022226245,0.00028317617,0.00018172791],"domain_scores_gemma":[0.98848873,0.009898168,0.0005854571,0.00022716152,0.00048985233,0.00031063694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006213017,0.0013717801,0.0023809026,0.0019125039,0.001138115,0.0029998957,0.0020420863,0.003267373,0.0032208043],"category_scores_gemma":[0.011031633,0.0016439462,0.0021353564,0.0029473845,0.0016095702,0.0029208406,0.0021876404,0.0019253653,0.00027544188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005369954,0.000061476174,0.00029411886,0.00001912473,0.00004117675,0.000029787021,0.000019115378,0.99369,0.00013051061,0.0030457594,0.000056293327,0.0025590342],"study_design_scores_gemma":[0.000004982539,0.000013179802,0.000045879395,0.0000014462713,0.000006401411,0.0000024816718,0.000003468161,0.9989839,0.000024258896,0.0008864824,0.000025295774,0.0000022585712],"about_ca_topic_score_codex":0.012377994,"about_ca_topic_score_gemma":0.011560519,"teacher_disagreement_score":0.012377994,"about_ca_system_score_codex":0.0020425199,"about_ca_system_score_gemma":0.0027674143,"threshold_uncertainty_score":0.032858014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26056758,0.0009305904,0.7285269,0.0026654361,0.00018808682,0.000087471824,0.00011741662,0.00016774956,0.0067488286],"genre_scores_gemma":[0.9877666,0.00022821047,0.00987726,0.00007289128,0.00013605773,0.000027808406,0.00002839552,0.000030430616,0.0018323066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99251103,0.002997096,0.00044508747,0.0011560004,0.0010762964,0.0018144792],"domain_scores_gemma":[0.94744307,0.03965486,0.005611503,0.003092123,0.0023492938,0.001849103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017846908,0.0012280529,0.003373411,0.0013339225,0.00142403,0.0070058457,0.0033096075,0.0030437314,0.0041209185],"category_scores_gemma":[0.055046596,0.0011755292,0.0014415208,0.0017378548,0.0040110494,0.012592139,0.004434323,0.002552874,0.00034729714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008042724,0.00018065823,0.008298677,0.00017201791,0.0003079152,0.0007202363,0.00053133257,0.7036434,0.0027294622,0.24973755,0.0014985767,0.03137589],"study_design_scores_gemma":[0.000023108862,0.0001104647,0.0010923914,0.000022019192,0.00009836709,0.00011570772,0.00022208736,0.8536842,0.0006472054,0.1435686,0.00037563872,0.000040235594],"about_ca_topic_score_codex":0.0046964483,"about_ca_topic_score_gemma":0.0018496959,"teacher_disagreement_score":0.017846908,"about_ca_system_score_codex":0.0026752949,"about_ca_system_score_gemma":0.003101085,"threshold_uncertainty_score":0.09438461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9016629,0.0002121177,0.0788281,0.0030853776,0.00008593492,0.00012641268,0.0019014463,0.00016415621,0.01393361],"genre_scores_gemma":[0.9838499,0.00010585953,0.010111988,0.00011595125,0.000027816228,0.00005704325,0.0005534078,0.000045418597,0.0051327324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988462,0.00062466913,0.000035285528,0.00021497232,0.00005379477,0.00022509428],"domain_scores_gemma":[0.9947806,0.0033641935,0.00057304866,0.00028243414,0.00041527685,0.00058449176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003011646,0.00047414415,0.00079920347,0.0008407363,0.0007037082,0.0024678162,0.0014692995,0.0014832803,0.00836113],"category_scores_gemma":[0.013810034,0.0010300566,0.0007222198,0.0009918696,0.00091801205,0.0022782353,0.0014417452,0.0013278851,0.00070084806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013487875,0.00008622448,0.011734462,0.000010349272,0.000032833726,0.00009031708,0.00004500542,0.97234905,0.00014365069,0.012212812,0.0006931428,0.0024672474],"study_design_scores_gemma":[0.000038524187,0.000027113087,0.0013371347,0.0000071360514,0.000020693027,0.000022865697,0.000119273245,0.9922619,0.000113382,0.0056265197,0.00041716677,0.000008369115],"about_ca_topic_score_codex":0.03404538,"about_ca_topic_score_gemma":0.024174433,"teacher_disagreement_score":0.03404538,"about_ca_system_score_codex":0.0024464733,"about_ca_system_score_gemma":0.0030804279,"threshold_uncertainty_score":0.067694426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122662,0.0016436495,0.8552761,0.0013166877,0.00025248743,0.0001287714,0.0008113293,0.00039166442,0.017517237],"genre_scores_gemma":[0.9654844,0.00058926066,0.015764669,0.000095155156,0.00006624162,0.00016791983,0.00039477783,0.00011050788,0.0173271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888057,0.00035484444,0.000055695888,0.00021693089,0.00017955172,0.0003123635],"domain_scores_gemma":[0.9972344,0.0017072726,0.00032697304,0.00010308148,0.00046087374,0.0001674092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023481504,0.0018705584,0.0036652093,0.0010629912,0.0007537216,0.004174072,0.0025428303,0.0036174103,0.0066463645],"category_scores_gemma":[0.0046134028,0.0022213282,0.00195549,0.0020497444,0.0017697269,0.0025338794,0.0022257671,0.002475339,0.00064508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002232423,0.000011572108,0.00009838825,0.00001320683,0.000014704522,0.000016646125,0.000011169243,0.9968503,0.00008971638,0.0020389836,0.00012716233,0.0007057369],"study_design_scores_gemma":[0.0000040890336,0.000008246041,0.00006348563,0.0000015237633,0.000006040065,0.000001784524,0.0000056039366,0.999201,0.000029759658,0.0006183499,0.00005615768,0.0000040297446],"about_ca_topic_score_codex":0.038429216,"about_ca_topic_score_gemma":0.019780232,"teacher_disagreement_score":0.038429216,"about_ca_system_score_codex":0.0027028867,"about_ca_system_score_gemma":0.00267095,"threshold_uncertainty_score":0.07641101},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073586092,0.0014926674,0.98749524,0.0007604737,0.0001624357,0.00005942147,0.00009069069,0.00024147908,0.002339091],"genre_scores_gemma":[0.26447383,0.0032086966,0.7235218,0.00061622274,0.0006700342,0.00056062255,0.00078109425,0.00047240974,0.005695299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978982,0.0010038796,0.00009558521,0.00026705366,0.00043791052,0.0002972473],"domain_scores_gemma":[0.9858839,0.011514015,0.0007226736,0.0007790965,0.00066371745,0.00043669832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058023036,0.0022933292,0.0025055276,0.0017581041,0.0011663517,0.002949912,0.004050962,0.002767218,0.004923057],"category_scores_gemma":[0.02562742,0.0012729367,0.0017606977,0.0037674496,0.002144496,0.0046396805,0.00262523,0.005973927,0.00080627995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003524392,0.00019550437,0.0007257775,0.00021108464,0.000097296965,0.000043843007,0.00016512381,0.8467081,0.0006176809,0.08265713,0.005971068,0.062254976],"study_design_scores_gemma":[0.000034949957,0.000017313498,0.0000562202,0.000015907197,0.0000129428345,0.000013861542,0.000019398669,0.9585989,0.000083344006,0.040547207,0.00059436314,0.000005611443],"about_ca_topic_score_codex":0.007882582,"about_ca_topic_score_gemma":0.008980823,"teacher_disagreement_score":0.007882582,"about_ca_system_score_codex":0.0037255224,"about_ca_system_score_gemma":0.0034864133,"threshold_uncertainty_score":0.030685902},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17153935,0.0060324045,0.010706743,0.65278405,0.005794094,0.00018104549,0.0007343753,0.00042730934,0.15180063],"genre_scores_gemma":[0.93117815,0.003030868,0.0069040083,0.030119114,0.0035397364,0.00010694942,0.00017776681,0.00019162918,0.024751725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981273,0.0007791758,0.00008724745,0.0002200904,0.0003615344,0.00042480518],"domain_scores_gemma":[0.97745377,0.0127361985,0.0022783976,0.0006853367,0.0022935162,0.0045528137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040637273,0.0001967555,0.0003387701,0.00054293376,0.0011585718,0.00467768,0.00089147454,0.0050369785,0.052066132],"category_scores_gemma":[0.033782907,0.0002704263,0.00043198015,0.0004816263,0.0018933682,0.011740539,0.0009103488,0.004130993,0.005859455],"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.0022288098,0.0033570293,0.046147384,0.000516838,0.00012966312,0.00083421497,0.0011613194,0.0017314603,0.0011563618,0.10939571,0.28550115,0.54784006],"study_design_scores_gemma":[0.0011435606,0.0009315582,0.08028774,0.0019655875,0.00049377914,0.0027757415,0.028086802,0.023994898,0.00472848,0.48151103,0.373572,0.00050892844],"about_ca_topic_score_codex":0.0038223115,"about_ca_topic_score_gemma":0.0069184056,"teacher_disagreement_score":0.052066132,"about_ca_system_score_codex":0.0011644524,"about_ca_system_score_gemma":0.0038532782,"threshold_uncertainty_score":0.17417854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074028177,0.0001742922,0.97667694,0.0005421854,0.0006785276,0.00007607788,0.00014262223,0.0004873962,0.013819144],"genre_scores_gemma":[0.26648134,0.0006278646,0.6845508,0.000773805,0.0011105163,0.0003337018,0.00038772082,0.0006279895,0.045106266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884856,0.0002274803,0.00007618131,0.00024159168,0.0004639841,0.00014206831],"domain_scores_gemma":[0.99908316,0.00023630584,0.00007114227,0.00020263958,0.00020041937,0.00020633382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012861021,0.0009739562,0.0009675854,0.00095500605,0.0009944442,0.001685188,0.0017101152,0.0017953406,0.016163303],"category_scores_gemma":[0.0028294122,0.00030530526,0.0009534222,0.0010432622,0.0015900182,0.0033673085,0.0042646653,0.0022813897,0.0025386335],"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.00035192104,0.0002219934,0.000417275,0.00020164768,0.00003713797,0.00039156913,0.00017173422,0.023400275,0.02161558,0.6823167,0.018603576,0.2522706],"study_design_scores_gemma":[0.00017767448,0.0003643014,0.00026836694,0.000045132547,0.000045864792,0.000998502,0.0001057774,0.4302814,0.008402037,0.5067648,0.052446812,0.00009943446],"about_ca_topic_score_codex":0.00047748093,"about_ca_topic_score_gemma":0.0005460815,"teacher_disagreement_score":0.016163303,"about_ca_system_score_codex":0.0004746382,"about_ca_system_score_gemma":0.0013082138,"threshold_uncertainty_score":0.054071605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2591369,0.0019618848,0.7056918,0.00072889903,0.0010686605,0.00023779874,0.00050662126,0.0035199334,0.027147533],"genre_scores_gemma":[0.9343152,0.0001599859,0.059706815,0.00008610679,0.00012542715,0.000085676096,0.00029300398,0.0001269221,0.005100893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989685,0.00023103281,0.0000663373,0.00019106899,0.00024389016,0.00029922542],"domain_scores_gemma":[0.9974037,0.00053501915,0.00014979654,0.0011128798,0.0005319706,0.00026662997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009546485,0.0007010284,0.0010505579,0.0007247615,0.0014678807,0.0016022568,0.002008597,0.0005266899,0.006480986],"category_scores_gemma":[0.0031230233,0.00039544757,0.0006193358,0.0013351433,0.0006123658,0.0017402661,0.0025032917,0.00095998,0.00083114713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027619463,0.0004744577,0.0036735807,0.00041092467,0.00034187242,0.00059575116,0.0002651763,0.5341248,0.02566172,0.059007112,0.021336168,0.35134652],"study_design_scores_gemma":[0.00015606766,0.00029379822,0.0008211413,0.000017789022,0.00009767704,0.00019971012,0.00009590112,0.93838495,0.008389296,0.04428242,0.0072369617,0.000024223034],"about_ca_topic_score_codex":0.0016559298,"about_ca_topic_score_gemma":0.0041170437,"teacher_disagreement_score":0.006480986,"about_ca_system_score_codex":0.000951111,"about_ca_system_score_gemma":0.0026042922,"threshold_uncertainty_score":0.02168107},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050770063,0.00007251104,0.99304813,0.00011717055,0.000036244575,0.000043786313,0.00006033287,0.00017656526,0.0013682279],"genre_scores_gemma":[0.24662948,0.00026867253,0.7467524,0.00022177801,0.00009752758,0.0001989519,0.00044945677,0.00027926266,0.0051025343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981495,0.0007197059,0.000107115615,0.00025242762,0.0004701393,0.00030120983],"domain_scores_gemma":[0.99698764,0.0018395092,0.00021672783,0.0002970987,0.00049809646,0.0001608319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003683365,0.0013430286,0.0013685282,0.0013483467,0.0010116585,0.0021248974,0.0024351869,0.0012727354,0.006406449],"category_scores_gemma":[0.0058911717,0.0011749007,0.0021561463,0.0013523136,0.0010413427,0.0024949922,0.0023543448,0.0025167586,0.0007524631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001580451,0.0001118604,0.0002459588,0.000090354704,0.00006472723,0.00004610674,0.000114402304,0.9123184,0.0018035965,0.03853657,0.0016004356,0.044909585],"study_design_scores_gemma":[0.000013926923,0.00001829265,0.000028160806,0.000007308576,0.000012150639,0.000004973181,0.000016434326,0.9810734,0.00030085957,0.01815731,0.000362337,0.0000048692204],"about_ca_topic_score_codex":0.0067415973,"about_ca_topic_score_gemma":0.009332403,"teacher_disagreement_score":0.0067415973,"about_ca_system_score_codex":0.0017691719,"about_ca_system_score_gemma":0.0024677378,"threshold_uncertainty_score":0.021431744},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04152572,0.00046716523,0.9420872,0.0012169923,0.00010223615,0.0002908709,0.0011078225,0.00033038383,0.012871653],"genre_scores_gemma":[0.7140869,0.00139573,0.25674704,0.00037903112,0.00015637853,0.00070262013,0.001801399,0.00019204975,0.02453877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986052,0.0007326726,0.00005586259,0.00028351837,0.00015490463,0.00016795249],"domain_scores_gemma":[0.99661297,0.0024117604,0.00026572665,0.00016200088,0.00035228836,0.00019524437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023677747,0.0010419084,0.0017920688,0.0020357324,0.0013946347,0.002439436,0.004394176,0.0030411396,0.011485129],"category_scores_gemma":[0.0071142986,0.00079120917,0.0017237879,0.003708123,0.0014796413,0.004446332,0.0017730598,0.0019092271,0.0011136188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006163132,0.00007958756,0.00078702776,0.00013986033,0.0000614127,0.00024766225,0.00025035947,0.7883744,0.00040084435,0.19283442,0.003393816,0.013368916],"study_design_scores_gemma":[0.000016929864,0.0000135504015,0.00012944164,0.000007463728,0.000018252309,0.000024667459,0.000054234646,0.95098597,0.000028560635,0.0478461,0.0008628979,0.000011930553],"about_ca_topic_score_codex":0.043196507,"about_ca_topic_score_gemma":0.035972573,"teacher_disagreement_score":0.043196507,"about_ca_system_score_codex":0.0031299356,"about_ca_system_score_gemma":0.0035563258,"threshold_uncertainty_score":0.085890114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21720627,0.00089473603,0.7567788,0.0024265638,0.0005335483,0.00047438956,0.0069449088,0.011021371,0.003719413],"genre_scores_gemma":[0.8888928,0.0001979545,0.10567738,0.00021530363,0.00011212388,0.00016513492,0.0038607134,0.00018494445,0.0006935367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892765,0.00023390293,0.00011644169,0.00024445838,0.0003575501,0.00011991108],"domain_scores_gemma":[0.9944652,0.0032675534,0.000510072,0.00038539723,0.0008877642,0.00048399012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002111778,0.0014509473,0.0011065577,0.0011325888,0.00047133386,0.0020029491,0.0016915696,0.0006176122,0.0021844972],"category_scores_gemma":[0.0094625745,0.0006840807,0.0006998655,0.0012013145,0.00030638298,0.0013031872,0.0010358632,0.00147721,0.0004889719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012331797,0.0006839708,0.016515099,0.00032472765,0.00021090939,0.0003892206,0.00034721685,0.86198235,0.006874514,0.007305857,0.01297584,0.09115717],"study_design_scores_gemma":[0.000017708973,0.000026786794,0.00047580223,0.0000063869998,0.000007187311,0.000015919793,0.00003007022,0.9952892,0.00074128946,0.00291456,0.0004704606,0.000004687075],"about_ca_topic_score_codex":0.008513581,"about_ca_topic_score_gemma":0.010003838,"teacher_disagreement_score":0.008513581,"about_ca_system_score_codex":0.0009968551,"about_ca_system_score_gemma":0.0021361643,"threshold_uncertainty_score":0.016928017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010194637,0.00044607781,0.9851598,0.00023045573,0.00012342443,0.00009588719,0.0003044706,0.00023027447,0.0032149751],"genre_scores_gemma":[0.4570352,0.0012714055,0.5263392,0.00038884275,0.0003299274,0.00066578056,0.0018784691,0.0004911757,0.0115999775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994635,0.0002596533,0.000017719574,0.00007680901,0.0001036156,0.00007863453],"domain_scores_gemma":[0.9974553,0.0018973926,0.00018204018,0.0001270163,0.00024010635,0.00009816127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095464435,0.0013266823,0.0013058137,0.00085952855,0.0005280763,0.0012250696,0.0011632838,0.0010314048,0.006847198],"category_scores_gemma":[0.0033092285,0.00085937296,0.0011201798,0.0016814276,0.00069812924,0.001093447,0.0011461753,0.0017253221,0.0007888799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116732605,0.00008960858,0.00028647765,0.0002464618,0.00005663406,0.00009413611,0.000051195413,0.92713284,0.0014434775,0.018872255,0.0050535584,0.046556592],"study_design_scores_gemma":[0.00001618915,0.000027600669,0.000049459675,0.000009666946,0.000009812345,0.000010581633,0.000012285509,0.98939145,0.00034416153,0.00947711,0.0006450817,0.0000066036105],"about_ca_topic_score_codex":0.005832903,"about_ca_topic_score_gemma":0.0060812356,"teacher_disagreement_score":0.006847198,"about_ca_system_score_codex":0.0006986021,"about_ca_system_score_gemma":0.0010761331,"threshold_uncertainty_score":0.022906184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7960734,0.00048270536,0.18754396,0.00029893868,0.00004756309,0.00007501602,0.00012014674,0.0004533525,0.014905005],"genre_scores_gemma":[0.97936076,0.00010364767,0.01732524,0.000028678678,0.000028837969,0.000020808126,0.00009555449,0.00005363685,0.0029827652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973084,0.00095506164,0.00010843615,0.00052718545,0.00066576834,0.00043518297],"domain_scores_gemma":[0.98512244,0.0064573437,0.0015603882,0.0046739317,0.0016315609,0.0005543842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036781614,0.00050037354,0.0007664608,0.002073852,0.0008047927,0.0020472305,0.001337287,0.0013336665,0.0066901194],"category_scores_gemma":[0.014520731,0.00032080497,0.00077380845,0.0015768756,0.0009920236,0.0026880405,0.001945529,0.00060961046,0.001978402],"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.0019080479,0.0015297078,0.03767116,0.00038248347,0.00036734928,0.00034534404,0.0011295278,0.2629148,0.12708859,0.102034636,0.0027738435,0.46185452],"study_design_scores_gemma":[0.00034649298,0.0029971171,0.06983755,0.00008022456,0.00047317127,0.0008010283,0.001016548,0.6196592,0.15090756,0.1428953,0.0108988825,0.000086884276],"about_ca_topic_score_codex":0.0003708751,"about_ca_topic_score_gemma":0.0003047969,"teacher_disagreement_score":0.0066901194,"about_ca_system_score_codex":0.0007179234,"about_ca_system_score_gemma":0.0008975856,"threshold_uncertainty_score":0.02238065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32897976,0.0022080962,0.6420583,0.0020248413,0.00020352249,0.00031151398,0.0003272803,0.00031081872,0.023575792],"genre_scores_gemma":[0.9625382,0.00039727855,0.03317961,0.0000865274,0.000055192577,0.00013400117,0.00011733691,0.000050203787,0.003441635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981816,0.0009535911,0.000068053174,0.00018055228,0.00030270228,0.00031355614],"domain_scores_gemma":[0.99581134,0.0034489832,0.00027046655,0.00007522844,0.00023893257,0.00015510836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033499824,0.0011787759,0.002413042,0.0011868615,0.00068174617,0.0031623137,0.001268814,0.0025159626,0.003902085],"category_scores_gemma":[0.0081494395,0.001612414,0.0010004925,0.0017031782,0.0015103985,0.0027038094,0.0017333152,0.0016937096,0.0002742054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004428456,0.000040745876,0.00019999515,0.000015366388,0.000026417882,0.000011430847,0.000013889737,0.9933563,0.000061480154,0.0017268577,0.00009167009,0.004411572],"study_design_scores_gemma":[0.000014914455,0.00004072976,0.00018270218,0.0000049626433,0.000014883196,0.000003241404,0.000014295705,0.9963917,0.000079433805,0.0031189423,0.00012887036,0.000005236],"about_ca_topic_score_codex":0.029156601,"about_ca_topic_score_gemma":0.024664665,"teacher_disagreement_score":0.029156601,"about_ca_system_score_codex":0.0028979173,"about_ca_system_score_gemma":0.004578719,"threshold_uncertainty_score":0.057973742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004968254,0.00014099982,0.9878001,0.0001471095,0.000062308914,0.00009345605,0.00005771872,0.00025992992,0.006470099],"genre_scores_gemma":[0.12774909,0.00024467477,0.8657421,0.00021452733,0.000073933275,0.0005486366,0.00025016337,0.00024005424,0.004936856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984433,0.0005931994,0.000052099465,0.00014372452,0.00056065223,0.0002070016],"domain_scores_gemma":[0.9972573,0.0018344901,0.00010945667,0.00023793263,0.00044277776,0.00011797878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015588803,0.001319034,0.0017009338,0.0014483236,0.00097277237,0.0016684581,0.0027203076,0.0020205758,0.008937135],"category_scores_gemma":[0.006851013,0.0008138942,0.0014715819,0.0019887753,0.0009436026,0.0023427054,0.0031335708,0.0024038488,0.0016168769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021883941,0.0002673183,0.00055468606,0.000347372,0.00005672666,0.00017563575,0.00021087789,0.72242165,0.0029186702,0.088302575,0.006606135,0.17791954],"study_design_scores_gemma":[0.00001704981,0.000034051314,0.0000541219,0.000018295106,0.000007023033,0.000037377762,0.000024192901,0.9798997,0.00041122836,0.018304665,0.0011836855,0.0000085722995],"about_ca_topic_score_codex":0.0031687357,"about_ca_topic_score_gemma":0.0046883416,"teacher_disagreement_score":0.008937135,"about_ca_system_score_codex":0.0007906443,"about_ca_system_score_gemma":0.0023730465,"threshold_uncertainty_score":0.02989775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09023424,0.001288594,0.89594036,0.00105758,0.00009873329,0.00007656793,0.00022411102,0.00022466439,0.010855206],"genre_scores_gemma":[0.9038664,0.00062483636,0.09009459,0.00019537349,0.00007526452,0.00011639656,0.00030231886,0.000059804668,0.0046650525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988702,0.0005154367,0.000060124064,0.00011696431,0.00028230864,0.0001549187],"domain_scores_gemma":[0.9907713,0.0077494658,0.00037624946,0.00024061794,0.00067053473,0.00019182966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035925321,0.000643443,0.0016755029,0.00067691196,0.00034419188,0.0020937119,0.0014517826,0.0019293296,0.0032901824],"category_scores_gemma":[0.013099801,0.00060968456,0.0007174586,0.00076487777,0.00077597675,0.0013234958,0.0009634188,0.0023637884,0.0004029705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044189626,0.000025702017,0.0002089933,0.000026884976,0.000013340771,0.000034547174,0.000022571254,0.9838104,0.00008105532,0.008857734,0.00028541486,0.006589047],"study_design_scores_gemma":[0.000005124014,0.000006241663,0.000022126149,0.0000053862723,0.0000025974446,0.0000032727078,0.0000026792654,0.9963575,0.000028570572,0.0034910783,0.00007411145,0.0000013753427],"about_ca_topic_score_codex":0.011498042,"about_ca_topic_score_gemma":0.0065509914,"teacher_disagreement_score":0.011498042,"about_ca_system_score_codex":0.0013153282,"about_ca_system_score_gemma":0.0014911303,"threshold_uncertainty_score":0.022862196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038370527,0.00032187675,0.95451164,0.00060888624,0.00020307853,0.00032034866,0.00027425238,0.0002839239,0.0051055327],"genre_scores_gemma":[0.53386116,0.0007494802,0.44955045,0.00020727597,0.00034222886,0.00043374152,0.00047442052,0.00030238915,0.0140788695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878067,0.00041864844,0.00006121268,0.00028555116,0.00022215556,0.00023172652],"domain_scores_gemma":[0.99820995,0.0011116522,0.00019820576,0.00007344686,0.00023211373,0.00017459216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021388005,0.0016052404,0.0026941807,0.002246297,0.0015955771,0.0030742208,0.0036843014,0.0025722343,0.007031671],"category_scores_gemma":[0.0037606854,0.0022384792,0.0024376833,0.0031412707,0.0014822785,0.002182108,0.0015765647,0.001897552,0.0006237966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004497558,0.000049282426,0.00016117223,0.000038801558,0.000034660796,0.000068698246,0.00003569263,0.98456687,0.00053827465,0.0071242987,0.00048540375,0.006851861],"study_design_scores_gemma":[0.000013238661,0.000025094574,0.000059411228,0.000002748885,0.000014178109,0.000010332959,0.000015836311,0.9956535,0.00008444731,0.003846545,0.00026763332,0.0000069664384],"about_ca_topic_score_codex":0.03970893,"about_ca_topic_score_gemma":0.026372055,"teacher_disagreement_score":0.03970893,"about_ca_system_score_codex":0.0039147884,"about_ca_system_score_gemma":0.0040116953,"threshold_uncertainty_score":0.07895565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031110886,0.0010041678,0.9421935,0.0015762759,0.00008999582,0.00005574352,0.00022254538,0.0001499599,0.023596931],"genre_scores_gemma":[0.78506273,0.0019808596,0.18671453,0.0003396301,0.00025133984,0.00018172624,0.000336909,0.0003215271,0.02481083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996474,0.0001481596,0.000007833247,0.00007107995,0.000056099303,0.00006933532],"domain_scores_gemma":[0.9989786,0.00071722944,0.00007927131,0.000057298595,0.00008582659,0.000081729486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010286581,0.00097227935,0.0011308732,0.0004789184,0.00056253426,0.0015239661,0.0011863065,0.0017561512,0.0058146045],"category_scores_gemma":[0.0052353367,0.00040211724,0.00086745305,0.0009519174,0.0012099296,0.002300235,0.0016368319,0.002748615,0.0005708598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012250195,0.00009003306,0.00020687105,0.00021068605,0.000030018446,0.000075295706,0.00009929352,0.6898423,0.0013035485,0.27081695,0.007828634,0.029373797],"study_design_scores_gemma":[0.000041769938,0.000042686166,0.000082911465,0.000016562946,0.000012714242,0.000029119736,0.000046144756,0.8408457,0.0003380722,0.15616141,0.0023725452,0.000010376479],"about_ca_topic_score_codex":0.0029906414,"about_ca_topic_score_gemma":0.0036294044,"teacher_disagreement_score":0.0058146045,"about_ca_system_score_codex":0.0009609162,"about_ca_system_score_gemma":0.0012459375,"threshold_uncertainty_score":0.019451797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051913563,0.0004357955,0.938652,0.00037943793,0.00016377514,0.00028991007,0.00022442029,0.0006976369,0.0072434954],"genre_scores_gemma":[0.28824976,0.00038146813,0.704699,0.00024435177,0.00007137662,0.0003368188,0.00047298637,0.00024782887,0.0052963826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994191,0.00021817452,0.000028162174,0.00009170658,0.00010258002,0.00014031061],"domain_scores_gemma":[0.9991474,0.00048378104,0.000089460016,0.000049445902,0.000105294326,0.00012459171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015027527,0.0013987895,0.0018595789,0.0014948829,0.0008439135,0.0013641651,0.0013783218,0.0019626925,0.00535402],"category_scores_gemma":[0.0019278465,0.0014148504,0.0015823548,0.001443688,0.0006492711,0.0013248407,0.0011772162,0.0016071688,0.0006429838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022018532,0.00015135181,0.00021572567,0.000102638835,0.000045898287,0.00006783508,0.000055083772,0.94570047,0.0026881094,0.0047873817,0.0016919055,0.044273417],"study_design_scores_gemma":[0.000045624314,0.00007220594,0.00008692016,0.000013330695,0.000020797335,0.0000132646355,0.000022817345,0.9960109,0.0005330608,0.0025914873,0.00057971926,0.000009839455],"about_ca_topic_score_codex":0.0076360437,"about_ca_topic_score_gemma":0.008305588,"teacher_disagreement_score":0.0076360437,"about_ca_system_score_codex":0.001621912,"about_ca_system_score_gemma":0.0023893893,"threshold_uncertainty_score":0.017910957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7169677,0.0014579241,0.21680002,0.0063777026,0.00016034557,0.00018645167,0.0003866059,0.00015557522,0.057507686],"genre_scores_gemma":[0.99384946,0.00026301743,0.00412996,0.00004087245,0.000019425424,0.000018118597,0.000040799005,0.000014991777,0.0016235086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933845,0.00035025648,0.00002293912,0.000056155284,0.0001026014,0.00012960202],"domain_scores_gemma":[0.99748623,0.0016538048,0.00032584887,0.00008846394,0.00026812262,0.0001775334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021274255,0.00061767345,0.00088028243,0.00071576366,0.00052617834,0.002629911,0.00079500536,0.0014429099,0.003631724],"category_scores_gemma":[0.006393674,0.00040247812,0.00035373963,0.0010500391,0.0009626096,0.0024807185,0.0009940767,0.0010336239,0.00018924531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009766457,0.000060155107,0.0011726171,0.00006285897,0.00004941,0.00010696771,0.000032503805,0.9534107,0.0002926808,0.035301637,0.00067924993,0.00873354],"study_design_scores_gemma":[0.00003974895,0.00007973787,0.0011519836,0.000031316606,0.00004411471,0.00003437374,0.00020044835,0.9158836,0.000321557,0.08167192,0.00052647706,0.000014774461],"about_ca_topic_score_codex":0.00526407,"about_ca_topic_score_gemma":0.010232469,"teacher_disagreement_score":0.00526407,"about_ca_system_score_codex":0.0014192362,"about_ca_system_score_gemma":0.0020553342,"threshold_uncertainty_score":0.012149274},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012677195,0.0020285116,0.9790435,0.0013126942,0.00012400108,0.000041179752,0.0001138964,0.0001081897,0.0045507867],"genre_scores_gemma":[0.41719422,0.005422139,0.5622953,0.00040889025,0.0011100511,0.0003930505,0.0008430146,0.00038452115,0.011948876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980646,0.00078895775,0.000077702796,0.0003156669,0.0005932272,0.00015990724],"domain_scores_gemma":[0.9844774,0.013485865,0.00048921374,0.0005232013,0.00081856543,0.00020573032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038162991,0.0013078488,0.0016656583,0.0013883606,0.0006464103,0.0025260253,0.0024197982,0.002194545,0.0047085444],"category_scores_gemma":[0.023073765,0.00079752255,0.0014836943,0.0018115143,0.0019370385,0.0059938435,0.0025258954,0.005464494,0.00046034253],"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.00022303646,0.00019887471,0.0011070993,0.00046679864,0.000078270175,0.00008463936,0.0002102496,0.70969164,0.000921105,0.2089502,0.0077825817,0.070285484],"study_design_scores_gemma":[0.000013773757,0.000017795759,0.00009640998,0.000020165297,0.000011039706,0.00002766057,0.000028373666,0.8963659,0.00014015549,0.102144375,0.0011266483,0.000007672695],"about_ca_topic_score_codex":0.005267399,"about_ca_topic_score_gemma":0.0032556155,"teacher_disagreement_score":0.005267399,"about_ca_system_score_codex":0.0017430666,"about_ca_system_score_gemma":0.0017205718,"threshold_uncertainty_score":0.020182729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88901854,0.0002571557,0.07716264,0.00070318824,0.00007242392,0.00010703981,0.0007290558,0.00028776133,0.031662237],"genre_scores_gemma":[0.99195015,0.0001152048,0.0044457708,0.000058334754,0.00004221971,0.00006202771,0.00044346353,0.00004753422,0.0028352274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981968,0.00070680847,0.0001295236,0.00026521194,0.00030654654,0.00039523307],"domain_scores_gemma":[0.9697094,0.016791383,0.0055872644,0.0022001015,0.0017977892,0.003914073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032585026,0.00052171934,0.0012796614,0.002016239,0.0015457011,0.0051221517,0.0014026981,0.0014486477,0.013256785],"category_scores_gemma":[0.028983556,0.00063460943,0.000866101,0.0019397663,0.0015997719,0.0032905592,0.0013884276,0.0014024095,0.0008448082],"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.0011715521,0.00050994795,0.024958408,0.000291338,0.00020628817,0.00043596403,0.0006658889,0.043539815,0.006144632,0.8840613,0.007710951,0.030303946],"study_design_scores_gemma":[0.00025328,0.00031428173,0.009262703,0.00006579844,0.000066702814,0.00050435564,0.00033489795,0.13703515,0.0008933841,0.8487583,0.0024598814,0.000051298302],"about_ca_topic_score_codex":0.000999596,"about_ca_topic_score_gemma":0.0009314775,"teacher_disagreement_score":0.013256785,"about_ca_system_score_codex":0.0010905494,"about_ca_system_score_gemma":0.0009597812,"threshold_uncertainty_score":0.04434836},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042867984,0.9922356,0.0051000165,0.000785459,0.00035562098,0.000008217087,0.000017145394,0.000011836296,0.001057432],"genre_scores_gemma":[0.004498071,0.9895443,0.0041588005,0.00032589948,0.0010147615,0.000015238119,0.0000474088,0.000006770456,0.0003888936],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938357,0.00016893144,0.00006577604,0.00015788138,0.00017606425,0.00004779115],"domain_scores_gemma":[0.99723756,0.0018636754,0.00022841885,0.000082232895,0.00048556994,0.00010249092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00247994,0.0011096991,0.0018516267,0.0016857241,0.00026806464,0.0020723923,0.0019069059,0.0017354988,0.0025230509],"category_scores_gemma":[0.0035363801,0.0005191346,0.00070165464,0.0055074114,0.0010044604,0.0023057438,0.0008809982,0.001601219,0.0006899879],"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.00015716458,0.00021049146,0.00051878445,0.014392618,0.00020501802,0.00008310665,0.00008117863,0.012941866,0.0010033685,0.027562905,0.01950872,0.9233348],"study_design_scores_gemma":[0.00012079596,0.0005140751,0.0015979928,0.008829656,0.00064413366,0.0009031343,0.00034586914,0.023416184,0.0012335874,0.056035616,0.9062331,0.00012585554],"about_ca_topic_score_codex":0.0020746961,"about_ca_topic_score_gemma":0.0020392837,"teacher_disagreement_score":0.0025230509,"about_ca_system_score_codex":0.0009089833,"about_ca_system_score_gemma":0.0025678666,"threshold_uncertainty_score":0.013115346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6033159,0.0028306306,0.34240115,0.0063107195,0.0007502556,0.00061610114,0.0041179815,0.00078554644,0.038871747],"genre_scores_gemma":[0.9195183,0.0011222489,0.037273638,0.0003439344,0.00030986243,0.00025507846,0.0018967587,0.00025010735,0.03903008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753463,0.0008641446,0.00011945746,0.0006180202,0.00020463979,0.00065903045],"domain_scores_gemma":[0.9954737,0.0026950077,0.0005153946,0.00030088745,0.00026724936,0.00074773456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019210842,0.002250105,0.00536497,0.0016924468,0.0025705146,0.0038562992,0.006288537,0.007183323,0.01833704],"category_scores_gemma":[0.0080300225,0.0027178365,0.002216668,0.0041827303,0.00221659,0.0065619457,0.0033940084,0.0029308202,0.0018113815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015701047,0.00047050434,0.0026755494,0.0006744492,0.00035212457,0.0019267097,0.0002447366,0.9143754,0.0011868167,0.041755576,0.0134006925,0.021367306],"study_design_scores_gemma":[0.00025414047,0.0002807817,0.001435717,0.00007885829,0.00016082227,0.00082409347,0.0007908906,0.9328182,0.00053300493,0.058995612,0.0037324892,0.0000954007],"about_ca_topic_score_codex":0.0135778515,"about_ca_topic_score_gemma":0.009348203,"teacher_disagreement_score":0.01833704,"about_ca_system_score_codex":0.0019209298,"about_ca_system_score_gemma":0.002002726,"threshold_uncertainty_score":0.06134349},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07168022,0.00025613856,0.92360306,0.00014208563,0.00010999249,0.000107113345,0.00008602507,0.0004780016,0.003537445],"genre_scores_gemma":[0.44354862,0.00014639141,0.548969,0.000114899776,0.000062595034,0.00021990218,0.00025988446,0.00015176667,0.0065270048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997788,0.000063303065,0.000009106452,0.000047496927,0.00005448355,0.000046926743],"domain_scores_gemma":[0.99968207,0.00013096308,0.000038092512,0.00003085173,0.00007787558,0.000040181065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049367745,0.0006982407,0.0009192208,0.00047735695,0.0004218209,0.00052713265,0.001419683,0.000912013,0.0034624755],"category_scores_gemma":[0.000842359,0.00039682933,0.0006761389,0.0004069364,0.00031066322,0.0005840988,0.0006987037,0.0008008696,0.00041470135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002902866,0.00012787717,0.00074024143,0.00008269996,0.00006122089,0.00009522657,0.00005767802,0.90378416,0.004428673,0.0044673593,0.0017263815,0.08413826],"study_design_scores_gemma":[0.000025118054,0.000057835165,0.00010437419,0.0000029385492,0.000007517199,0.000019111103,0.000006793814,0.9982821,0.00032481021,0.00071071374,0.00045523906,0.0000035063094],"about_ca_topic_score_codex":0.004834661,"about_ca_topic_score_gemma":0.005327003,"teacher_disagreement_score":0.004834661,"about_ca_system_score_codex":0.00045475096,"about_ca_system_score_gemma":0.0011249642,"threshold_uncertainty_score":0.01158309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015555867,0.00044392454,0.9792437,0.00025754326,0.000048941238,0.000032249984,0.00003782524,0.000108558415,0.0042714677],"genre_scores_gemma":[0.63066286,0.00081139174,0.35843724,0.00025121286,0.00013592973,0.00021864049,0.00018748162,0.0006333415,0.008661964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980788,0.0009951621,0.00008246349,0.00020462513,0.00051114196,0.00012774828],"domain_scores_gemma":[0.9944088,0.003999041,0.00031164466,0.0006368416,0.0004830172,0.00016063235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054460634,0.0015998344,0.0018637239,0.0009525011,0.00060389156,0.002528219,0.0020985613,0.001799711,0.0030749238],"category_scores_gemma":[0.018997505,0.0011508671,0.001250378,0.0012721822,0.0024795353,0.0038967694,0.0039004139,0.0031862704,0.00049265404],"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.00040663898,0.0001559225,0.00085128896,0.0005034263,0.00013130004,0.00019040001,0.00027080547,0.7777855,0.003394738,0.12603013,0.0019565693,0.08832326],"study_design_scores_gemma":[0.00001613597,0.00010784231,0.00013400282,0.000029207213,0.00001832039,0.0000692945,0.000023126897,0.95069385,0.0011315836,0.04707778,0.00068708113,0.0000116897345],"about_ca_topic_score_codex":0.0010905794,"about_ca_topic_score_gemma":0.000835485,"teacher_disagreement_score":0.0054460634,"about_ca_system_score_codex":0.00084404217,"about_ca_system_score_gemma":0.00088523584,"threshold_uncertainty_score":0.028801858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8660342,0.0011739228,0.12519936,0.0015240187,0.00008915867,0.0001943071,0.0009400626,0.0005402569,0.0043047103],"genre_scores_gemma":[0.9919607,0.00019819665,0.006114568,0.00005100792,0.000023363085,0.000031207797,0.00014579359,0.000037546768,0.0014375884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880946,0.00045430567,0.00007607858,0.00019243006,0.00012608529,0.00034165315],"domain_scores_gemma":[0.98691815,0.008904895,0.0020358881,0.0005026417,0.0009921929,0.00064617826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003951224,0.00094911625,0.0015385784,0.0011453851,0.00070867187,0.0017509608,0.0022351916,0.0022995195,0.0033756515],"category_scores_gemma":[0.009079927,0.0009456691,0.00076202775,0.001109653,0.0013947118,0.0012608586,0.0008468739,0.0012637813,0.000395483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048688438,0.00005578503,0.0009433438,0.00007825623,0.000027782435,0.0001638341,0.00005618927,0.98947525,0.0023084662,0.0029074443,0.00051511085,0.002981628],"study_design_scores_gemma":[0.000048055503,0.00014061129,0.0015685383,0.00001249896,0.000042463467,0.000050978517,0.00004377035,0.9946637,0.0005712289,0.0027203741,0.0001220582,0.000015755222],"about_ca_topic_score_codex":0.005828486,"about_ca_topic_score_gemma":0.0029543992,"teacher_disagreement_score":0.005828486,"about_ca_system_score_codex":0.0017940011,"about_ca_system_score_gemma":0.0011356614,"threshold_uncertainty_score":0.020896316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079231516,0.00040905832,0.9155739,0.000365116,0.00008210156,0.000024426046,0.00012907843,0.00008641536,0.0040983306],"genre_scores_gemma":[0.89677995,0.0016245733,0.09130577,0.00026999353,0.00029414007,0.000071354676,0.00058145757,0.00013537833,0.00893745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832183,0.00063523883,0.00007307911,0.0002606709,0.00055523193,0.00015403671],"domain_scores_gemma":[0.99436414,0.0034158437,0.00081741315,0.000480851,0.00067728915,0.0002443935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018457316,0.0015192644,0.0009634528,0.0011799874,0.00039815274,0.0013282924,0.0010952658,0.0016419159,0.0025772955],"category_scores_gemma":[0.009193277,0.00053609494,0.0006901767,0.0015503855,0.0024951464,0.0033948726,0.0021238169,0.0017354599,0.0005406652],"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.00071199046,0.000071371,0.0026032084,0.00039840216,0.00019596869,0.00089504407,0.00066480984,0.28054637,0.031916324,0.615076,0.0018397279,0.065080866],"study_design_scores_gemma":[0.00003339383,0.00014212809,0.0011716938,0.000052696436,0.00006495554,0.0006147471,0.00012889745,0.80961,0.003971209,0.18263885,0.0015014096,0.00007004532],"about_ca_topic_score_codex":0.00102069,"about_ca_topic_score_gemma":0.0007716461,"teacher_disagreement_score":0.0025772955,"about_ca_system_score_codex":0.0005920265,"about_ca_system_score_gemma":0.00096519385,"threshold_uncertainty_score":0.009761274},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00719073,0.00012170405,0.99018914,0.00008261417,0.000045191016,0.000037726615,0.000101188765,0.0013920445,0.0008396627],"genre_scores_gemma":[0.13356902,0.00012704174,0.8624076,0.000092202186,0.0000599565,0.00022641635,0.00049709924,0.00057761034,0.0024431148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988188,0.00037513557,0.00013844244,0.00021935476,0.00030435924,0.00014384359],"domain_scores_gemma":[0.9959176,0.0018632245,0.00031659426,0.0009049258,0.0008518553,0.00014575751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022429288,0.0008290128,0.0013320113,0.0021324109,0.001027153,0.0019626587,0.0021435388,0.0011644918,0.0067612217],"category_scores_gemma":[0.014173125,0.0005717242,0.0011679176,0.0021092552,0.0009966699,0.0023206472,0.0020656716,0.0015615952,0.002681918],"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.00041558302,0.00013241763,0.0019975454,0.00028864143,0.0001209088,0.00021362412,0.00042468045,0.16710414,0.0075128167,0.28009948,0.010604075,0.53108615],"study_design_scores_gemma":[0.00006728841,0.00005132524,0.00025115648,0.000023244407,0.00003228835,0.000090023634,0.000048601363,0.8945079,0.004050046,0.097503684,0.0033434462,0.0000310735],"about_ca_topic_score_codex":0.004466554,"about_ca_topic_score_gemma":0.007715857,"teacher_disagreement_score":0.0067612217,"about_ca_system_score_codex":0.0012811365,"about_ca_system_score_gemma":0.0029306016,"threshold_uncertainty_score":0.022618532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9697655,0.0004058007,0.0027894261,0.002143524,0.000081269,0.000018654488,0.00009530593,0.000059754166,0.024640888],"genre_scores_gemma":[0.99763024,0.00011055645,0.00015664432,0.000063876454,0.000021712402,0.0000030120243,0.000027926802,0.000009686283,0.0019763052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981078,0.00054229307,0.00007271082,0.00017541807,0.00032447893,0.00077727105],"domain_scores_gemma":[0.9909422,0.0053824224,0.0012615715,0.0005851369,0.0010976697,0.0007309686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026349225,0.0003539059,0.0006843983,0.0007228922,0.0014131981,0.0045445645,0.0014794568,0.0023945929,0.011585108],"category_scores_gemma":[0.010428136,0.0003945322,0.0011170858,0.0013577234,0.0025648556,0.0041399933,0.0014935639,0.002565419,0.000802316],"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.0053110654,0.0027116877,0.100642405,0.00030925608,0.000239154,0.0040946826,0.0014337463,0.52053565,0.010453112,0.25498396,0.014254203,0.08503112],"study_design_scores_gemma":[0.000676167,0.0021125225,0.15440336,0.00026181975,0.00069248216,0.00071660045,0.009418633,0.5841502,0.011282374,0.2216645,0.0141613865,0.00045992556],"about_ca_topic_score_codex":0.034736983,"about_ca_topic_score_gemma":0.023231935,"teacher_disagreement_score":0.034736983,"about_ca_system_score_codex":0.0040217736,"about_ca_system_score_gemma":0.0036105781,"threshold_uncertainty_score":0.069069624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05966457,0.00062292785,0.935925,0.00032824877,0.00013572999,0.00018654137,0.00040262743,0.0021482895,0.0005860858],"genre_scores_gemma":[0.5725841,0.00040201188,0.4228747,0.00010699256,0.00018432277,0.0005388892,0.0015491626,0.00009620753,0.0016636372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837565,0.000409257,0.0002392928,0.00032575644,0.00047198814,0.0001779189],"domain_scores_gemma":[0.9976291,0.0014635024,0.00013189741,0.00021641894,0.00049220584,0.00006692272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002055928,0.0009878018,0.0019705896,0.0015882758,0.0006079655,0.0016949963,0.0010175771,0.00086942705,0.0015458511],"category_scores_gemma":[0.006068901,0.00037851502,0.0013515642,0.0022159037,0.00041066922,0.000996097,0.0010000613,0.0015531197,0.0008774838],"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.00048451038,0.0003820201,0.0031687256,0.00018586745,0.00014895525,0.00023197057,0.00012172059,0.06664678,0.013126784,0.0017921185,0.0042204363,0.90949005],"study_design_scores_gemma":[0.000027899672,0.00013554121,0.0017206104,0.000014701884,0.00003634662,0.00010385528,0.00006211396,0.9876072,0.0056928843,0.0036302386,0.0009483383,0.00002022718],"about_ca_topic_score_codex":0.0019844188,"about_ca_topic_score_gemma":0.0012148323,"teacher_disagreement_score":0.002055928,"about_ca_system_score_codex":0.00038555602,"about_ca_system_score_gemma":0.0008474047,"threshold_uncertainty_score":0.0108729005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49822846,0.0020825658,0.45404264,0.0030985442,0.00040404042,0.0004202219,0.0031640811,0.00059655897,0.03796281],"genre_scores_gemma":[0.93340003,0.0007578597,0.0416905,0.00017086884,0.00014557247,0.00016016868,0.0013670061,0.00022777784,0.022080347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994223,0.00016337857,0.000027242386,0.00013139537,0.00007181404,0.00018384779],"domain_scores_gemma":[0.9987754,0.00074140576,0.00010452052,0.000041989515,0.00009032092,0.0002462235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011547018,0.0018837326,0.0024350318,0.0011206826,0.0010218691,0.0032020828,0.0021889105,0.003078494,0.011688712],"category_scores_gemma":[0.00285453,0.0016211492,0.0014851431,0.0016990572,0.0010876008,0.004026335,0.0017849273,0.0018893795,0.00072918186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023755657,0.0001037976,0.00054256513,0.00015523458,0.000055972345,0.0002141138,0.00007051639,0.9767339,0.00071867823,0.0075546633,0.002202879,0.011410052],"study_design_scores_gemma":[0.00003686143,0.00007085799,0.00029291946,0.000016931705,0.000024410292,0.000036405825,0.00009739463,0.98528326,0.00041550022,0.012847709,0.0008600437,0.000017673847],"about_ca_topic_score_codex":0.018501371,"about_ca_topic_score_gemma":0.012763927,"teacher_disagreement_score":0.018501371,"about_ca_system_score_codex":0.0020553314,"about_ca_system_score_gemma":0.0017637032,"threshold_uncertainty_score":0.039102614},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12143284,0.005149934,0.84196544,0.0013337437,0.00010599112,0.0005277491,0.0008096448,0.00085202296,0.027822481],"genre_scores_gemma":[0.7600656,0.009026036,0.22188948,0.00020494191,0.000114862494,0.0006950725,0.0013048443,0.00014533236,0.006553821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998679,0.0005557247,0.00014203945,0.00016189703,0.00034167274,0.000119707],"domain_scores_gemma":[0.9975828,0.0014910449,0.00022171292,0.00029320584,0.00028975727,0.00012148541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011932913,0.0010207089,0.0010824626,0.0019843131,0.0006873626,0.002619959,0.0024278273,0.0021595324,0.0032353296],"category_scores_gemma":[0.0044845343,0.0006482305,0.0015698419,0.0020371655,0.0011107202,0.0025679963,0.0013599084,0.0012893553,0.0004395774],"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.000038117185,0.00013017893,0.0034659475,0.00012135817,0.00004765716,0.000055221048,0.00013468787,0.93935347,0.0006745664,0.03972715,0.00043044292,0.015821187],"study_design_scores_gemma":[0.000008792657,0.000028077318,0.00024356003,0.000033336568,0.000009607599,0.000027842643,0.00004744991,0.98220587,0.00034809232,0.015000019,0.0020399557,0.000007385972],"about_ca_topic_score_codex":0.0070906994,"about_ca_topic_score_gemma":0.0051520607,"teacher_disagreement_score":0.0070906994,"about_ca_system_score_codex":0.0015013167,"about_ca_system_score_gemma":0.0020003212,"threshold_uncertainty_score":0.014098823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69068563,0.0015620342,0.29537234,0.002232426,0.00013965902,0.00020435218,0.0010265629,0.00076624437,0.00801079],"genre_scores_gemma":[0.98528093,0.0007348165,0.007919473,0.00013727912,0.0001981328,0.00013095366,0.00063983526,0.0001496882,0.0048089647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471056,0.0017890944,0.0002756247,0.00096237566,0.0011748009,0.0010876947],"domain_scores_gemma":[0.81507295,0.13850877,0.02186803,0.00868446,0.0116814375,0.0041843574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017166771,0.0016570158,0.0031212813,0.0045817457,0.0011658676,0.004937109,0.0056770314,0.0037857003,0.006783812],"category_scores_gemma":[0.1023617,0.0021889992,0.0020888497,0.0030225238,0.0050634034,0.0066801514,0.0029356482,0.0043972977,0.0009904192],"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.0011402512,0.00052845565,0.020795284,0.00048045386,0.00036577502,0.0023886105,0.0010809309,0.3523391,0.0070352755,0.5913394,0.0047214995,0.017785044],"study_design_scores_gemma":[0.0000460461,0.00010188677,0.005503101,0.000084064566,0.00010569167,0.0005493806,0.00014412391,0.9254021,0.0008984204,0.06678584,0.00027985897,0.000099542136],"about_ca_topic_score_codex":0.004918002,"about_ca_topic_score_gemma":0.0030109475,"teacher_disagreement_score":0.017166771,"about_ca_system_score_codex":0.003695489,"about_ca_system_score_gemma":0.0036265582,"threshold_uncertainty_score":0.09078771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056036566,0.00012959032,0.9897658,0.00008148215,0.000033003027,0.000042439493,0.000015327209,0.00013163734,0.004196987],"genre_scores_gemma":[0.50846595,0.00045520483,0.4844736,0.00013833692,0.000084635314,0.00040194104,0.00007667646,0.00024364106,0.005659999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995771,0.0001839038,0.000015643842,0.00004544812,0.00014031885,0.00003755466],"domain_scores_gemma":[0.99878055,0.0007672912,0.00009819931,0.000065604385,0.0002489308,0.000039337097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012610069,0.0010966099,0.00096062606,0.0008863135,0.00052287604,0.0011107636,0.0013515017,0.0008446975,0.0037150912],"category_scores_gemma":[0.0039068065,0.00066761504,0.00097164,0.00085460936,0.0007681729,0.0011541793,0.0011291035,0.0015503457,0.00046616056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020875039,0.00003813823,0.00016437509,0.000054790726,0.000015453357,0.00002338647,0.000045431727,0.9568185,0.0010726199,0.020049114,0.0005197343,0.021177523],"study_design_scores_gemma":[0.0000013564196,0.000009132649,0.000012673987,0.0000026506445,0.0000015299261,0.0000029028797,0.0000021613307,0.99741334,0.00008541225,0.0023207155,0.00014649368,0.0000016998587],"about_ca_topic_score_codex":0.0045976196,"about_ca_topic_score_gemma":0.0046917987,"teacher_disagreement_score":0.0045976196,"about_ca_system_score_codex":0.0009864216,"about_ca_system_score_gemma":0.0012977064,"threshold_uncertainty_score":0.012428224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022474885,0.00043514138,0.95245475,0.0013553741,0.00012412402,0.000052168805,0.00034752052,0.00013145189,0.022624511],"genre_scores_gemma":[0.7533079,0.0011755459,0.21320356,0.00055989454,0.00030091673,0.00046503427,0.0009103266,0.00024005685,0.02983683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880064,0.0006612777,0.000045340024,0.00016348387,0.00019394538,0.00013528843],"domain_scores_gemma":[0.9964079,0.002414265,0.00034167038,0.00025813686,0.00034588884,0.00023214523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723065,0.001115342,0.0013582452,0.001300927,0.0006837063,0.0033015013,0.0023176705,0.0026688513,0.016317816],"category_scores_gemma":[0.007275557,0.0005130292,0.0010990509,0.001610352,0.0017189238,0.0042596404,0.0015136854,0.0029100303,0.0014343113],"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.00004230524,0.000060602462,0.00013128638,0.000070432216,0.000021671376,0.000049396767,0.000129467,0.1314021,0.00033908887,0.85677326,0.0025447472,0.008435661],"study_design_scores_gemma":[0.000014013031,0.000014997158,0.000046957502,0.0000155259,0.000007819207,0.000020858359,0.000045297646,0.38292667,0.000067603454,0.61569744,0.0011285917,0.000014299979],"about_ca_topic_score_codex":0.004759828,"about_ca_topic_score_gemma":0.004514134,"teacher_disagreement_score":0.016317816,"about_ca_system_score_codex":0.0012360759,"about_ca_system_score_gemma":0.0016273181,"threshold_uncertainty_score":0.054588556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9989832,0.00002770702,0.00003931721,0.000036454105,0.0000028999389,0.0000030125846,0.000053732467,0.0000023676785,0.0008513037],"genre_scores_gemma":[0.9991431,0.00002241372,0.000035572302,0.00000919111,0.0000017783302,0.0000028245174,0.000043299442,0.000001915109,0.000739903],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993892,0.00023971261,0.000024913274,0.00007443974,0.0000330655,0.00023866922],"domain_scores_gemma":[0.990368,0.0053095976,0.00052754,0.00034447905,0.0003872491,0.0030632436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006988845,0.00031990858,0.00061791256,0.00051858067,0.00086276804,0.002363288,0.00076427637,0.00096741767,0.011821233],"category_scores_gemma":[0.0032445383,0.0004138732,0.0008387124,0.0006481138,0.0008221192,0.00096520624,0.0017686237,0.0009827736,0.00051631907],"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.030992262,0.009357645,0.79119164,0.00028049183,0.0013368207,0.00414091,0.0022890917,0.10251361,0.02031808,0.0056123813,0.0037781957,0.028188905],"study_design_scores_gemma":[0.00042658902,0.004352706,0.9151939,0.00004908977,0.00067368883,0.00035461862,0.01288959,0.059636395,0.00157057,0.003251973,0.001480071,0.000120830686],"about_ca_topic_score_codex":0.050396807,"about_ca_topic_score_gemma":0.08015721,"teacher_disagreement_score":0.050396807,"about_ca_system_score_codex":0.0013440787,"about_ca_system_score_gemma":0.000935898,"threshold_uncertainty_score":0.10020691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67322993,0.00056114607,0.30579856,0.000909351,0.00036157857,0.00040021693,0.0003724964,0.0003057755,0.018060971],"genre_scores_gemma":[0.9876193,0.00009268183,0.009365181,0.000050332652,0.00006156948,0.000037802212,0.00007245531,0.00004561496,0.002655127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977946,0.0006715794,0.000120613215,0.00042551963,0.0001975454,0.0007901085],"domain_scores_gemma":[0.9961112,0.0017313282,0.00040407723,0.000629064,0.00055341405,0.0005710041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031372476,0.00095771946,0.002557278,0.000998128,0.0006836297,0.0036885377,0.0025017683,0.0016852772,0.010417105],"category_scores_gemma":[0.008268766,0.00091252715,0.0014670674,0.001479387,0.0013250761,0.004448899,0.0020879454,0.0019378454,0.0008585995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022621858,0.0007943341,0.006659535,0.00030137732,0.00019787006,0.0007582918,0.00021092508,0.8471371,0.013575919,0.04895787,0.0026563378,0.076488376],"study_design_scores_gemma":[0.00010919382,0.0003765231,0.0023721654,0.00002945955,0.00009481759,0.00019661318,0.0002663301,0.97409815,0.0033052138,0.01778875,0.0013183523,0.000044548146],"about_ca_topic_score_codex":0.0037613572,"about_ca_topic_score_gemma":0.0020711669,"teacher_disagreement_score":0.010417105,"about_ca_system_score_codex":0.0016171171,"about_ca_system_score_gemma":0.0014473984,"threshold_uncertainty_score":0.03484869},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2960495,0.049132396,0.5843014,0.022555329,0.000941706,0.00009125991,0.0030211417,0.00039462477,0.04351262],"genre_scores_gemma":[0.9046386,0.030321928,0.050724547,0.0006818547,0.0006508314,0.00007788889,0.0020950502,0.00017382123,0.01063545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.0002508359,0.000048536967,0.00017548165,0.00016289657,0.00008702594],"domain_scores_gemma":[0.9968837,0.0016962443,0.00067373336,0.000106613326,0.00052963855,0.00011008878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017078073,0.0010127611,0.0005805306,0.0009148111,0.00024479162,0.0025658573,0.0019388085,0.0011016331,0.0027331053],"category_scores_gemma":[0.005977947,0.0005843416,0.0007696669,0.0032735956,0.0006284311,0.0027033326,0.00052810373,0.0017883724,0.00037634716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007153944,0.000067379005,0.0050139516,0.00017156512,0.00006698485,0.00003375561,0.000055509518,0.9378769,0.00026477335,0.024384996,0.002825708,0.029166939],"study_design_scores_gemma":[0.000010851643,0.0000461382,0.0033099307,0.00006116243,0.000047396494,0.000047236616,0.00016187454,0.96711916,0.000419314,0.018495979,0.010255526,0.000025297952],"about_ca_topic_score_codex":0.018368043,"about_ca_topic_score_gemma":0.01927513,"teacher_disagreement_score":0.018368043,"about_ca_system_score_codex":0.0026008242,"about_ca_system_score_gemma":0.001462204,"threshold_uncertainty_score":0.03652227},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21937814,0.0011541244,0.24097279,0.0015165762,0.0006747982,0.0015278958,0.07152734,0.41698554,0.04626283],"genre_scores_gemma":[0.64172095,0.0014295791,0.24305491,0.0007729373,0.00017685899,0.0007199029,0.07865787,0.004323197,0.029143764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972934,0.00002674489,0.00001623246,0.000052854688,0.00012720966,0.00004762861],"domain_scores_gemma":[0.9991636,0.00015369419,0.000052174357,0.00008027271,0.0004030309,0.00014722103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231631,0.001360014,0.0006888795,0.0014898763,0.00087210326,0.001147665,0.0014614468,0.00046413715,0.017055035],"category_scores_gemma":[0.0014663489,0.00039852923,0.00034111712,0.001311132,0.00033616013,0.0011332008,0.00074282807,0.00059222744,0.0028914213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043266737,0.000454959,0.013940067,0.0006510793,0.00026596963,0.00053356786,0.0005428901,0.1368875,0.023671176,0.004653929,0.39707834,0.41699395],"study_design_scores_gemma":[0.00078119483,0.00041975846,0.013016935,0.00009974512,0.00024663855,0.00016998993,0.00036696525,0.8029436,0.018708365,0.0027845837,0.16017333,0.0002888947],"about_ca_topic_score_codex":0.43603542,"about_ca_topic_score_gemma":0.51069546,"teacher_disagreement_score":0.99672335,"about_ca_system_score_codex":0.0032766354,"about_ca_system_score_gemma":0.006951224,"threshold_uncertainty_score":0.86699486},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27638194,0.0012785506,0.70023835,0.001819821,0.0003662962,0.00046115252,0.0017946343,0.0008141993,0.016845074],"genre_scores_gemma":[0.89924306,0.00045366457,0.08796007,0.00018256174,0.0001423423,0.00023297087,0.0006728467,0.0001665174,0.010945919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892575,0.0004061506,0.000057137324,0.00025874944,0.00018357376,0.00016851188],"domain_scores_gemma":[0.99709785,0.0019784463,0.00028785795,0.00012324519,0.00019770098,0.00031489413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018736591,0.0017271035,0.0024872418,0.0010671726,0.00066668895,0.0028760375,0.0024644344,0.003016016,0.006733116],"category_scores_gemma":[0.0041701174,0.0022115053,0.0014054478,0.0024052707,0.0010210016,0.0021031497,0.0010882284,0.0016447001,0.00043868556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001574935,0.00008157435,0.0002448936,0.00012578603,0.00004733532,0.00012125678,0.000026645677,0.9863507,0.0010248469,0.005500375,0.00094655296,0.005372434],"study_design_scores_gemma":[0.000040697065,0.00006982545,0.00016502963,0.000007736454,0.00001883342,0.00003162311,0.000011934238,0.9953507,0.0001788587,0.0038504964,0.00026155033,0.000012634288],"about_ca_topic_score_codex":0.005987909,"about_ca_topic_score_gemma":0.004673912,"teacher_disagreement_score":0.006733116,"about_ca_system_score_codex":0.0020450545,"about_ca_system_score_gemma":0.0022964245,"threshold_uncertainty_score":0.022524536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70580524,0.00019693434,0.26858717,0.002685586,0.00006336493,0.0004117386,0.00064384245,0.00055648206,0.021049652],"genre_scores_gemma":[0.97713894,0.000030901865,0.02222355,0.000024885276,0.0000055896926,0.000081832106,0.000105610976,0.00002554348,0.0003630535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926029,0.0047445763,0.00031477475,0.00094603276,0.0010423535,0.00034946878],"domain_scores_gemma":[0.9339851,0.05408913,0.0055469265,0.002654652,0.003019085,0.00070503337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01044375,0.00075913285,0.0004116391,0.0033591734,0.0010899942,0.0052763135,0.0012607613,0.0018415283,0.0039404216],"category_scores_gemma":[0.056633443,0.00056211726,0.0006503462,0.0016430278,0.0028205414,0.009384186,0.0037255313,0.0012812732,0.00040667932],"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.0015929197,0.0005671162,0.2703915,0.0010595928,0.0005286258,0.0011639093,0.120332405,0.077995285,0.011436718,0.341447,0.0025815268,0.17090341],"study_design_scores_gemma":[0.00014095589,0.0004660532,0.05840933,0.00051843375,0.0003658186,0.00029953942,0.050268102,0.4822628,0.0075243684,0.38158464,0.017911414,0.0002484868],"about_ca_topic_score_codex":0.0074761426,"about_ca_topic_score_gemma":0.0062330873,"teacher_disagreement_score":0.01044375,"about_ca_system_score_codex":0.002117476,"about_ca_system_score_gemma":0.0021358756,"threshold_uncertainty_score":0.055232465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23562145,0.0011273787,0.7528974,0.0006798497,0.00025160247,0.0002691124,0.00016664948,0.00037603348,0.008610554],"genre_scores_gemma":[0.9594746,0.00023185195,0.037144486,0.00007088241,0.00007172013,0.00009681217,0.000100916055,0.00009642811,0.0027122686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876815,0.0004935478,0.000048708524,0.0001613824,0.00024448973,0.00028374238],"domain_scores_gemma":[0.99736136,0.0018200073,0.00027352505,0.000106880885,0.00020904161,0.00022917539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034502086,0.0013858369,0.0017097888,0.0011342657,0.000851132,0.0019445181,0.0019157879,0.001409285,0.0045511336],"category_scores_gemma":[0.0067720376,0.00093249424,0.00078119116,0.0009819667,0.0007087489,0.0017973968,0.0011781461,0.0009245459,0.000483239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007705281,0.00017850798,0.0006622021,0.00016491333,0.0000635403,0.00009237488,0.00009997293,0.9448816,0.0035377343,0.0073775267,0.0008545819,0.041316528],"study_design_scores_gemma":[0.000041454066,0.00016979061,0.00035978554,0.000010701979,0.000026520105,0.000028336186,0.000031005024,0.9915935,0.0006802475,0.0067171133,0.00033080956,0.000010816777],"about_ca_topic_score_codex":0.0021100473,"about_ca_topic_score_gemma":0.0019023762,"teacher_disagreement_score":0.0045511336,"about_ca_system_score_codex":0.001083438,"about_ca_system_score_gemma":0.0011355462,"threshold_uncertainty_score":0.01824671},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09348465,0.00062192976,0.89451414,0.0006200926,0.00006108001,0.00015620713,0.00053526025,0.00019448562,0.009812151],"genre_scores_gemma":[0.9569098,0.00043934007,0.034161977,0.00004796387,0.000017973387,0.00023256596,0.00027155873,0.00003282007,0.0078860205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898404,0.00034506136,0.000057361565,0.0002684149,0.00015028565,0.00019480188],"domain_scores_gemma":[0.99894184,0.00057297695,0.00016617785,0.000048225753,0.00018940968,0.000081328326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023658336,0.0009774319,0.0023622091,0.0013452811,0.00074505067,0.0032973895,0.002149205,0.002207415,0.0040732897],"category_scores_gemma":[0.0024365957,0.0009598099,0.0016380979,0.0023764626,0.0008737377,0.002322505,0.001734147,0.0014072204,0.00045587486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037701804,0.000027407545,0.000349859,0.00005355794,0.000035471043,0.000054948894,0.000037343318,0.98455644,0.0004085333,0.010556744,0.00016843875,0.0037135847],"study_design_scores_gemma":[0.000006008458,0.000018336115,0.00012289577,0.000006380033,0.000012066003,0.000006326997,0.000008728402,0.9972813,0.00008351355,0.0022630317,0.00018401151,0.0000074209765],"about_ca_topic_score_codex":0.015746854,"about_ca_topic_score_gemma":0.008669434,"teacher_disagreement_score":0.015746854,"about_ca_system_score_codex":0.0027459292,"about_ca_system_score_gemma":0.0033711111,"threshold_uncertainty_score":0.03131044},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070004106,0.00038311473,0.9187409,0.00082100177,0.00008590926,0.00010861771,0.00021902037,0.00020517685,0.009432124],"genre_scores_gemma":[0.752234,0.00045806635,0.23012847,0.00022852603,0.00010729293,0.0003241137,0.00042240522,0.00031520115,0.01578209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912137,0.00041492988,0.000035365432,0.00015888475,0.00013578033,0.00013368034],"domain_scores_gemma":[0.9969085,0.0023697354,0.00020916121,0.00012070197,0.00021486837,0.00017708808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002808554,0.001557361,0.0026038082,0.0013168674,0.0010398161,0.0029943034,0.0013576968,0.004472321,0.00741373],"category_scores_gemma":[0.0062828306,0.002032867,0.0017623521,0.0017329925,0.0016531117,0.0031802289,0.0019412541,0.0026780663,0.0005883766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002897548,0.000020387402,0.00010302202,0.000018884417,0.000015824271,0.000028437791,0.0000103910415,0.9921659,0.00019302192,0.005107141,0.0001814119,0.0021266104],"study_design_scores_gemma":[0.0000061819987,0.000014665432,0.000030639745,0.0000046502155,0.0000058757996,0.0000043630857,0.000007687798,0.9930964,0.00009596537,0.0065943087,0.00013502475,0.000004169802],"about_ca_topic_score_codex":0.008116916,"about_ca_topic_score_gemma":0.004295554,"teacher_disagreement_score":0.008116916,"about_ca_system_score_codex":0.0021631606,"about_ca_system_score_gemma":0.002297561,"threshold_uncertainty_score":0.024801373},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026181651,0.008996766,0.9561974,0.0023593714,0.00014215808,0.00007154957,0.00028222214,0.00010310087,0.005665811],"genre_scores_gemma":[0.6828322,0.01056387,0.30270404,0.00031525842,0.00030532503,0.00030227454,0.0005031948,0.00009486605,0.0023789522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9896763,0.007220907,0.00053748157,0.0004923423,0.0018255762,0.00024737316],"domain_scores_gemma":[0.9577632,0.03624894,0.0018821022,0.0024759006,0.0013326594,0.000297253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01269665,0.0010538574,0.002222616,0.0031011177,0.0007192211,0.0043538,0.00085408316,0.0013271512,0.0017276495],"category_scores_gemma":[0.034635566,0.0006117734,0.0013341372,0.0085572945,0.0021168685,0.005125562,0.002359545,0.0029070075,0.000256464],"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.00009788476,0.00012273333,0.004269749,0.000783786,0.0005190838,0.00022981281,0.00039398985,0.29889777,0.000986325,0.6063002,0.0022510749,0.08514765],"study_design_scores_gemma":[0.000009501911,0.00002639329,0.0017281203,0.0001328671,0.000042373424,0.00006613906,0.00023028554,0.3713652,0.00060428935,0.621874,0.003890717,0.000030138062],"about_ca_topic_score_codex":0.0029377257,"about_ca_topic_score_gemma":0.0020903272,"teacher_disagreement_score":0.01269665,"about_ca_system_score_codex":0.0022541883,"about_ca_system_score_gemma":0.0029622894,"threshold_uncertainty_score":0.067147136},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070980825,0.000376398,0.914159,0.00037952853,0.00013276574,0.00018514956,0.00044996254,0.0013639638,0.011972381],"genre_scores_gemma":[0.24340478,0.00027558033,0.7506455,0.00013792452,0.00006266161,0.00022276443,0.00085343653,0.00017551456,0.0042217746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996094,0.00007257893,0.00001925951,0.00009386054,0.000108482134,0.00009646779],"domain_scores_gemma":[0.99923563,0.00045762534,0.000053978478,0.00012828612,0.00007476209,0.00004972275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060853857,0.0009277712,0.00089064206,0.0008066092,0.0005271424,0.0010885051,0.0016620696,0.0011056234,0.0068535693],"category_scores_gemma":[0.00231777,0.00056034105,0.0006994038,0.0017202818,0.0004919966,0.0013403555,0.0009947713,0.0012020207,0.0006299804],"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.00042814115,0.00033330408,0.00083324156,0.0003194269,0.00007659332,0.00010651377,0.00011469239,0.5867935,0.007153282,0.038193047,0.011743501,0.35390484],"study_design_scores_gemma":[0.000093790884,0.00006800532,0.00024160916,0.000009572117,0.00002091712,0.000040318268,0.00003067866,0.9736318,0.0010944898,0.023400292,0.0013626311,0.0000059746058],"about_ca_topic_score_codex":0.00585667,"about_ca_topic_score_gemma":0.006516755,"teacher_disagreement_score":0.0068535693,"about_ca_system_score_codex":0.0009338394,"about_ca_system_score_gemma":0.0021156208,"threshold_uncertainty_score":0.022927523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011288134,0.0002578189,0.98187584,0.00029707703,0.00009344673,0.00014810787,0.00012082817,0.00051674224,0.0054020057],"genre_scores_gemma":[0.07194856,0.0002665338,0.9222714,0.0001077465,0.000068666384,0.000326517,0.00034427296,0.00019786965,0.0044684755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999503,0.00014731514,0.000021125872,0.0000891071,0.0001614617,0.00007796104],"domain_scores_gemma":[0.9986609,0.00095452997,0.000059780916,0.000056102443,0.00018416329,0.00008447635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012111362,0.0014843995,0.0017099238,0.001333116,0.0011410194,0.0014698257,0.0016850437,0.0027283889,0.009761672],"category_scores_gemma":[0.0030328352,0.0010648485,0.0010915628,0.0018891979,0.00073065166,0.0015041749,0.001451046,0.0024283377,0.0011980559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002356367,0.0002609568,0.0004234097,0.00019539555,0.000053437627,0.00010142954,0.00008952542,0.7382346,0.0026894254,0.014684829,0.006566964,0.23646438],"study_design_scores_gemma":[0.000045792625,0.000056475743,0.0000739144,0.0000119879005,0.000013191106,0.000019327934,0.0000141013625,0.99330574,0.000329906,0.0050939033,0.0010296907,0.0000060082034],"about_ca_topic_score_codex":0.0074387756,"about_ca_topic_score_gemma":0.0069054537,"teacher_disagreement_score":0.009761672,"about_ca_system_score_codex":0.0010646654,"about_ca_system_score_gemma":0.0023275176,"threshold_uncertainty_score":0.032656014},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18800735,0.0045307,0.477782,0.011390005,0.0016135848,0.000085192274,0.00072808075,0.00047171756,0.31539136],"genre_scores_gemma":[0.9251296,0.0020908443,0.016126053,0.0021689993,0.001621283,0.00011192347,0.0003875935,0.0002549735,0.052108757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981604,0.00054193335,0.00011318233,0.00041831145,0.0004980417,0.0002681036],"domain_scores_gemma":[0.993877,0.002366786,0.0007162713,0.0009454331,0.0013197227,0.00077470444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023146581,0.0015926166,0.001568704,0.002758387,0.0014534607,0.004280756,0.0011245174,0.0014739872,0.017489979],"category_scores_gemma":[0.0120583335,0.00062512205,0.0010880184,0.0017935802,0.0040273466,0.008997087,0.0051889746,0.004012076,0.002244136],"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.000016626327,0.0000074548393,0.00014409094,0.00003165119,0.000012915188,0.000048549533,0.000040287414,0.00054050726,0.00031499768,0.9941855,0.0012740799,0.0033833277],"study_design_scores_gemma":[0.000004503658,0.000008522902,0.00010849645,0.0000073919073,0.000005458982,0.000057798698,0.00001902316,0.0022092566,0.00014705154,0.99545634,0.0019702017,0.0000060249513],"about_ca_topic_score_codex":0.00059950014,"about_ca_topic_score_gemma":0.00042888068,"teacher_disagreement_score":0.017489979,"about_ca_system_score_codex":0.0010138989,"about_ca_system_score_gemma":0.00072327635,"threshold_uncertainty_score":0.058509767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09426752,0.002469332,0.8794803,0.0018158724,0.00021160096,0.00030880328,0.0016515411,0.00043207654,0.019362865],"genre_scores_gemma":[0.60054344,0.0024315047,0.36558646,0.00060159323,0.0005015558,0.000990384,0.0033595606,0.0006009539,0.02538452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978531,0.0010829024,0.00008347779,0.00030988592,0.00033508558,0.0003354605],"domain_scores_gemma":[0.99463814,0.004021519,0.00041894315,0.0002711326,0.00023166508,0.0004186059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032389222,0.0025979585,0.003424658,0.0016442147,0.0009146625,0.003505327,0.0023608778,0.0027082402,0.008994151],"category_scores_gemma":[0.009735498,0.001867207,0.002637578,0.0025773176,0.0015979147,0.0031798282,0.002426121,0.0031008876,0.0006420329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026327383,0.00013428938,0.0005213787,0.00034125382,0.00014350514,0.00012004044,0.000109027904,0.9308398,0.00083253806,0.041050665,0.0053051175,0.020339089],"study_design_scores_gemma":[0.000048982813,0.00007484667,0.00025908524,0.000035524023,0.000043949174,0.0000495716,0.0000740856,0.92123336,0.00020112719,0.07657572,0.0013881099,0.000015628428],"about_ca_topic_score_codex":0.0072745653,"about_ca_topic_score_gemma":0.0054037496,"teacher_disagreement_score":0.008994151,"about_ca_system_score_codex":0.0026778155,"about_ca_system_score_gemma":0.0019717023,"threshold_uncertainty_score":0.030088484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041450174,0.0001328462,0.99439937,0.0001067659,0.00011431295,0.000080409634,0.00006116403,0.00016257234,0.00079756044],"genre_scores_gemma":[0.12835553,0.00027163682,0.8653386,0.00024932527,0.0002509024,0.00058040506,0.00038234194,0.00020025272,0.004371032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974827,0.0011104012,0.00018563446,0.00034034028,0.0007050921,0.0001757602],"domain_scores_gemma":[0.99337703,0.004063115,0.0003455158,0.00039793472,0.0014652058,0.00035114566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055496437,0.0013936575,0.002380667,0.0037506393,0.0011466525,0.002129153,0.0032435902,0.002462945,0.006051361],"category_scores_gemma":[0.010246411,0.0010120417,0.002063427,0.0032449546,0.0010134286,0.0031960085,0.002304373,0.002044959,0.00068803766],"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.00035207914,0.00052497094,0.0021785356,0.00033733196,0.00036110796,0.00017785605,0.00022745405,0.612741,0.0031243765,0.069312416,0.005223085,0.30543977],"study_design_scores_gemma":[0.000016477095,0.000043348275,0.00011056773,0.000016847662,0.000022413593,0.000027321847,0.000009902218,0.9874001,0.00028359945,0.011010664,0.0010459346,0.0000128461625],"about_ca_topic_score_codex":0.004222786,"about_ca_topic_score_gemma":0.003873225,"teacher_disagreement_score":0.006051361,"about_ca_system_score_codex":0.0013982522,"about_ca_system_score_gemma":0.0029758771,"threshold_uncertainty_score":0.029349625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010278761,0.0015500732,0.9581066,0.00151333,0.00041581603,0.00003199451,0.00016642225,0.00021890191,0.027718203],"genre_scores_gemma":[0.7969758,0.0019042809,0.14625463,0.00088755426,0.0011033805,0.00019109776,0.0005279856,0.0005478288,0.05160748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870336,0.0006259185,0.000051600495,0.00023029473,0.0003252648,0.0000636513],"domain_scores_gemma":[0.9978231,0.0012701742,0.00022438559,0.00026156142,0.00027476466,0.0001460439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019050383,0.0014793834,0.0017452535,0.00088151207,0.00033347678,0.0021098193,0.00091841584,0.0016124547,0.006405627],"category_scores_gemma":[0.006668224,0.0005319775,0.0009069942,0.00068294536,0.0017699559,0.0017545744,0.0029298868,0.0025842453,0.0008584097],"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.00015264942,0.00006198847,0.00024755314,0.00023726762,0.00014523769,0.0000690718,0.00004651355,0.22610655,0.0031200885,0.7190077,0.005155391,0.04565002],"study_design_scores_gemma":[0.000019996827,0.00006296378,0.00016484519,0.000024597995,0.00001910206,0.000043055494,0.000009191038,0.76151544,0.0007430513,0.23344119,0.0039419616,0.000014618653],"about_ca_topic_score_codex":0.00071395014,"about_ca_topic_score_gemma":0.00038922168,"teacher_disagreement_score":0.006405627,"about_ca_system_score_codex":0.0010385361,"about_ca_system_score_gemma":0.00070268725,"threshold_uncertainty_score":0.021428943},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099971786,0.000271854,0.89465433,0.00026304225,0.00004346935,0.00009173791,0.00012416081,0.00018400332,0.0043956074],"genre_scores_gemma":[0.95454484,0.00021594447,0.039947066,0.00008231412,0.000045394536,0.000247048,0.00020381802,0.000109876215,0.0046036816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898976,0.00056624983,0.000028442486,0.00015555225,0.00012828283,0.00013167411],"domain_scores_gemma":[0.9917468,0.0062490036,0.00076519535,0.00030156857,0.0005372996,0.00040016588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028002318,0.0015291156,0.0015747884,0.003512004,0.0009781581,0.0020205353,0.002006476,0.0016709794,0.0047943234],"category_scores_gemma":[0.012283661,0.0007962981,0.0018423558,0.0016744448,0.00223908,0.0029979781,0.0025144133,0.0021372784,0.00056602916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023846008,0.00008975814,0.001540565,0.00010693049,0.00017571695,0.00014666769,0.0002487821,0.8314266,0.0024346437,0.15159634,0.0007738347,0.011221716],"study_design_scores_gemma":[0.000006317893,0.00002053287,0.00009763714,0.0000056988965,0.000010830479,0.00000702929,0.000025115593,0.9708247,0.00010114945,0.02880984,0.000083307124,0.0000078182475],"about_ca_topic_score_codex":0.0048826616,"about_ca_topic_score_gemma":0.004351952,"teacher_disagreement_score":0.0048826616,"about_ca_system_score_codex":0.0011297528,"about_ca_system_score_gemma":0.0010810277,"threshold_uncertainty_score":0.016038656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28446063,0.0028692079,0.6909021,0.0061108456,0.001293236,0.0004586527,0.0023722278,0.0007342185,0.010798902],"genre_scores_gemma":[0.9417214,0.0009159779,0.038330264,0.00033764399,0.0008235813,0.00025865829,0.0007606494,0.00018783688,0.016664017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930443,0.0029482516,0.00032905978,0.0013972156,0.00077040476,0.001510661],"domain_scores_gemma":[0.9752187,0.018658748,0.0027661512,0.00068559,0.0009610555,0.001709698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008702116,0.0025378498,0.006620694,0.0020367585,0.0017265002,0.0049871253,0.0050996393,0.0058327615,0.009249625],"category_scores_gemma":[0.02501732,0.0049068513,0.003209835,0.004356349,0.0025493514,0.004712488,0.0026531818,0.0043892306,0.0011495255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035973176,0.00010360856,0.00064942345,0.00007654684,0.00008742623,0.00021195288,0.000046985228,0.9838742,0.0002798272,0.010666426,0.00108531,0.0025585727],"study_design_scores_gemma":[0.00007007333,0.000048113456,0.00030702574,0.000006355772,0.000028782291,0.00004454892,0.00002393536,0.9949007,0.000053315285,0.004310965,0.00018762668,0.000018436975],"about_ca_topic_score_codex":0.021800382,"about_ca_topic_score_gemma":0.011490686,"teacher_disagreement_score":0.021800382,"about_ca_system_score_codex":0.0042424435,"about_ca_system_score_gemma":0.0032992174,"threshold_uncertainty_score":0.0460217},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20647033,0.0003965984,0.7768714,0.0005111047,0.000054285585,0.00014556087,0.00005439285,0.00017162356,0.01532483],"genre_scores_gemma":[0.9324049,0.00025195893,0.063326664,0.000050772825,0.000038277052,0.00013290542,0.0000513675,0.000071705435,0.0036715704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961422,0.0022842584,0.0001588332,0.0002769292,0.00059885083,0.0005388447],"domain_scores_gemma":[0.98208433,0.014975253,0.00093475357,0.00068193267,0.00086845644,0.00045534488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00517255,0.000895651,0.0023915637,0.001135774,0.0010303108,0.0044155223,0.003010272,0.0023491792,0.0042505246],"category_scores_gemma":[0.030582841,0.0015964487,0.0014039068,0.0019461428,0.0021234883,0.0043109385,0.0021532245,0.0019447533,0.00037150318],"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.00029342406,0.00019236303,0.00091710023,0.00014493358,0.00007926466,0.00016577859,0.00023004052,0.87329626,0.0011050147,0.09919642,0.00067286287,0.023706423],"study_design_scores_gemma":[0.000033986187,0.00004864282,0.00015165284,0.000011555997,0.000017633365,0.000042154585,0.00003874554,0.94470316,0.00024544378,0.054543797,0.00015109344,0.0000121435305],"about_ca_topic_score_codex":0.0035101555,"about_ca_topic_score_gemma":0.0025697665,"teacher_disagreement_score":0.00517255,"about_ca_system_score_codex":0.001902495,"about_ca_system_score_gemma":0.0023902422,"threshold_uncertainty_score":0.027355373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77235293,0.00017839517,0.22089647,0.00013828182,0.00012922034,0.00020341373,0.00024546584,0.00047857358,0.0053772978],"genre_scores_gemma":[0.96500635,0.00003475523,0.032814953,0.000013412799,0.00002080722,0.000042639163,0.00012488799,0.000037881473,0.001904279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925846,0.00016783604,0.000027287995,0.00014131205,0.00008012261,0.0003249255],"domain_scores_gemma":[0.99881727,0.0003238415,0.00015050881,0.000087585715,0.0002036155,0.0004171358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010348951,0.00081536634,0.0014601758,0.0009143092,0.0007704044,0.001607916,0.0018388525,0.00088195025,0.003942754],"category_scores_gemma":[0.0017363961,0.0010400633,0.0009509084,0.001008381,0.00052554224,0.0008936772,0.0012369797,0.0009273699,0.00046887144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013421967,0.00036161873,0.002719941,0.000053138847,0.00006836992,0.0001285902,0.000072712035,0.9660878,0.005293405,0.0013357641,0.000678819,0.021857614],"study_design_scores_gemma":[0.000032382704,0.00018680618,0.0008568714,0.0000018355432,0.000018667733,0.0000124216185,0.0000322381,0.9975006,0.00076494616,0.0004476713,0.00013876645,0.0000069031175],"about_ca_topic_score_codex":0.014531412,"about_ca_topic_score_gemma":0.01961794,"teacher_disagreement_score":0.014531412,"about_ca_system_score_codex":0.0011562592,"about_ca_system_score_gemma":0.0029303269,"threshold_uncertainty_score":0.02889365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11924121,0.012229738,0.7608086,0.0041152593,0.00059137645,0.00011460148,0.0008147176,0.00017501706,0.101909444],"genre_scores_gemma":[0.6865389,0.018795418,0.22937815,0.0008875829,0.002403017,0.0003588003,0.0013872902,0.0002671244,0.059983633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988859,0.00045810762,0.00006282871,0.00021323243,0.00026392788,0.000116044845],"domain_scores_gemma":[0.99695253,0.0017943928,0.00047827067,0.00022156481,0.00036373912,0.0001894277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001940155,0.0011579264,0.0011688938,0.0015100361,0.0009035174,0.002088822,0.0021201083,0.0018264166,0.0065652723],"category_scores_gemma":[0.0074273497,0.0007468805,0.0018733159,0.0032677287,0.0016471659,0.005759165,0.0025083595,0.0033849687,0.0011074883],"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.00010079048,0.00016404982,0.00056895433,0.00025940355,0.000051426774,0.00019056501,0.00023944394,0.15336041,0.0006422565,0.8015001,0.009420374,0.03350231],"study_design_scores_gemma":[0.000021890073,0.00006314476,0.00040233083,0.000050723145,0.000023797369,0.00024998462,0.00017094494,0.3344413,0.00015377982,0.65534186,0.009055911,0.000024343037],"about_ca_topic_score_codex":0.0022335239,"about_ca_topic_score_gemma":0.0018892122,"teacher_disagreement_score":0.0065652723,"about_ca_system_score_codex":0.00092687213,"about_ca_system_score_gemma":0.001146391,"threshold_uncertainty_score":0.021963},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013939065,0.060403783,0.8631028,0.001856735,0.0046296734,0.00031424215,0.003177446,0.0009789991,0.06414252],"genre_scores_gemma":[0.019328631,0.07697727,0.80170774,0.0024320686,0.005386457,0.001504535,0.0062411157,0.0017102238,0.084712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985505,0.0004459675,0.00019281438,0.00028725096,0.00045063058,0.00007273037],"domain_scores_gemma":[0.99900347,0.00049390265,0.00006489012,0.00017558874,0.0002237084,0.00003851442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018436507,0.0028774957,0.0014748465,0.0033843268,0.0008522669,0.004145281,0.002945349,0.0021250248,0.027152833],"category_scores_gemma":[0.0043694377,0.0010738571,0.0019349137,0.006738361,0.0012063041,0.004972981,0.0023520745,0.005572226,0.022664417],"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.00004896669,0.00022410523,0.00020090293,0.0016610667,0.000065748514,0.00024939427,0.00013044813,0.017273823,0.0024489497,0.5027441,0.17057934,0.30437323],"study_design_scores_gemma":[0.000022406948,0.00011025142,0.0002610586,0.0003954456,0.000035161967,0.0007009528,0.00006519106,0.03559224,0.00064544386,0.35036033,0.6117538,0.000057596288],"about_ca_topic_score_codex":0.0012068391,"about_ca_topic_score_gemma":0.0021834695,"teacher_disagreement_score":0.027152833,"about_ca_system_score_codex":0.0009908595,"about_ca_system_score_gemma":0.0011926845,"threshold_uncertainty_score":0.09083527},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010017267,0.00068690797,0.95423096,0.0035726472,0.0001578614,0.000034919074,0.000101007405,0.000114333314,0.031084102],"genre_scores_gemma":[0.62938094,0.0033226635,0.33373952,0.0011065915,0.0013303569,0.00037450544,0.00022008692,0.00046559615,0.030059746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966954,0.0018062929,0.00016576145,0.00035962352,0.0007476797,0.00022525439],"domain_scores_gemma":[0.99197316,0.0055093374,0.0005608655,0.0008417196,0.00077894825,0.00033597142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055262554,0.0016121116,0.0019125193,0.0035937221,0.0012637428,0.008210948,0.003311148,0.004014905,0.010368876],"category_scores_gemma":[0.025487138,0.0008208949,0.0016975786,0.0031313626,0.0058486103,0.019531084,0.003565315,0.005204159,0.0013266609],"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.00000412146,0.0000049026225,0.000031111045,0.000010998233,0.00000301397,0.000010892161,0.000034190507,0.0041131964,0.000045866986,0.99318576,0.00033990777,0.0022160404],"study_design_scores_gemma":[0.0000039627007,0.0000046970445,0.000019332849,0.00001439835,0.0000041643484,0.00001725003,0.00001560555,0.026909584,0.000057413305,0.9714603,0.001487033,0.00000620988],"about_ca_topic_score_codex":0.0018379792,"about_ca_topic_score_gemma":0.0008444649,"teacher_disagreement_score":0.010368876,"about_ca_system_score_codex":0.0031323184,"about_ca_system_score_gemma":0.0018076272,"threshold_uncertainty_score":0.0346874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029320028,0.00065207935,0.95957536,0.0007602217,0.00023419535,0.00050348457,0.00040529863,0.0016207084,0.0069286404],"genre_scores_gemma":[0.14756432,0.00036912237,0.84216267,0.00027440343,0.00016132914,0.00062248606,0.0011016548,0.00036196772,0.0073821023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988807,0.00028683888,0.000060865455,0.00023943212,0.0002562331,0.00027594023],"domain_scores_gemma":[0.99784577,0.0014225796,0.00011245044,0.0001067384,0.00022946848,0.0002830813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019689088,0.0018786374,0.0042965086,0.001826828,0.0014107507,0.0022694373,0.0037974238,0.0042850715,0.015082543],"category_scores_gemma":[0.0035204398,0.0017916228,0.0017764498,0.0028946511,0.00091814244,0.0030624717,0.0023462689,0.0032665145,0.001803332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006444168,0.00089033344,0.00068475225,0.00027999666,0.0001189271,0.00017787778,0.00011125203,0.7534457,0.0023593863,0.0101766195,0.012925245,0.21818556],"study_design_scores_gemma":[0.00017307702,0.000110374276,0.00012209968,0.000008704797,0.00002072677,0.000026563239,0.00002450385,0.9945939,0.00028739864,0.0038646522,0.00075666007,0.000011279637],"about_ca_topic_score_codex":0.015777554,"about_ca_topic_score_gemma":0.014157058,"teacher_disagreement_score":0.015777554,"about_ca_system_score_codex":0.0020598255,"about_ca_system_score_gemma":0.0048714518,"threshold_uncertainty_score":0.050456107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18779889,0.0013905042,0.7756824,0.0065468983,0.00035259326,0.000116284886,0.00028041354,0.00034784095,0.027484134],"genre_scores_gemma":[0.95555454,0.0005972084,0.034832567,0.00035200937,0.00014728332,0.000103008766,0.00008783892,0.00009927148,0.00822616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850595,0.0006653731,0.00007349563,0.00028708915,0.00018367224,0.00028450834],"domain_scores_gemma":[0.99709713,0.0019768323,0.0002501617,0.00017791048,0.00027063326,0.000227292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034514237,0.0013061932,0.0022986925,0.0006871567,0.00058689987,0.0028178564,0.0015617068,0.0026070534,0.003007361],"category_scores_gemma":[0.009353305,0.0009706749,0.0011572344,0.0006212682,0.0018969389,0.0034339253,0.002208121,0.002740719,0.00033383814],"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.00020547636,0.00008062932,0.0002646107,0.0001039932,0.00007236787,0.00012806298,0.00010207072,0.317301,0.0025692985,0.6662564,0.0023998213,0.010516255],"study_design_scores_gemma":[0.00007308836,0.00007014909,0.00025341468,0.000030040721,0.000025290792,0.00004895973,0.00003547573,0.612517,0.0006237965,0.38531563,0.0009768693,0.000030348747],"about_ca_topic_score_codex":0.0013204406,"about_ca_topic_score_gemma":0.00058251596,"teacher_disagreement_score":0.0034514237,"about_ca_system_score_codex":0.0015347229,"about_ca_system_score_gemma":0.00205158,"threshold_uncertainty_score":0.018253088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40598628,0.00041237165,0.5481551,0.0022262156,0.00015402678,0.00015137975,0.00027537916,0.00023270574,0.04240652],"genre_scores_gemma":[0.9783029,0.00021681754,0.008896605,0.00011560977,0.000053502885,0.00011782444,0.00005957435,0.000026272692,0.012210851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963581,0.001954479,0.00014048674,0.00038403185,0.0005323132,0.0006304795],"domain_scores_gemma":[0.9812009,0.015457403,0.0013047968,0.000251841,0.00087689643,0.00090819085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035031624,0.0015585093,0.0020299319,0.0015338616,0.0010102835,0.004461608,0.0021519288,0.002167984,0.00515793],"category_scores_gemma":[0.018328547,0.0008888503,0.000993787,0.0010089936,0.0044508046,0.0034431084,0.003347328,0.0020918567,0.00039504684],"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.0002422078,0.00015828393,0.0012332957,0.00014211462,0.000110906876,0.0002981745,0.00040657367,0.19222268,0.0012290407,0.79680705,0.00090965454,0.0062400806],"study_design_scores_gemma":[0.00009648403,0.00008670427,0.00027243642,0.000024530505,0.000028478253,0.00007288313,0.00019946184,0.4778783,0.00033370394,0.5205818,0.000388735,0.000036553167],"about_ca_topic_score_codex":0.0044909506,"about_ca_topic_score_gemma":0.0025803237,"teacher_disagreement_score":0.00515793,"about_ca_system_score_codex":0.0024468645,"about_ca_system_score_gemma":0.0020443236,"threshold_uncertainty_score":0.018526673},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007919956,0.00027040436,0.9858732,0.00018566637,0.00009004058,0.00007035256,0.000055732376,0.000101648926,0.005432965],"genre_scores_gemma":[0.21960026,0.00050302816,0.7693063,0.00030708074,0.0002135727,0.00050621375,0.00022803835,0.00039701394,0.008938506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990295,0.00057064753,0.00003272439,0.00009929001,0.00016976503,0.000098069155],"domain_scores_gemma":[0.9986344,0.00093698286,0.00008095752,0.00008995438,0.00018880698,0.00006890224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023548307,0.001586166,0.0025315075,0.0012756154,0.0007517991,0.0017601597,0.0021018703,0.0037536463,0.008181152],"category_scores_gemma":[0.0046727876,0.0019626813,0.0023514512,0.0014907818,0.0010640367,0.0018134986,0.0015870278,0.0025181775,0.001048248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043212545,0.000071995266,0.00007307269,0.000065124164,0.00003575234,0.000035095683,0.000025111576,0.97159564,0.00047300555,0.013399753,0.0008643053,0.013317937],"study_design_scores_gemma":[0.0000094211655,0.000013385988,0.000018404506,0.0000063357634,0.0000055422056,0.0000036185363,0.0000037546104,0.99718213,0.00006435116,0.0024556632,0.00023403481,0.000003469663],"about_ca_topic_score_codex":0.006475084,"about_ca_topic_score_gemma":0.0043566735,"teacher_disagreement_score":0.008181152,"about_ca_system_score_codex":0.0009768783,"about_ca_system_score_gemma":0.0019148954,"threshold_uncertainty_score":0.027368665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016619401,0.00077138504,0.9712928,0.00048293296,0.00005838066,0.00007354503,0.00015481681,0.00006165662,0.01048511],"genre_scores_gemma":[0.7102867,0.0015564197,0.27404112,0.00031931713,0.00012923275,0.0005490755,0.0004609186,0.00016492716,0.012492378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899703,0.0006261398,0.000030007255,0.00011125903,0.00012087644,0.00011466058],"domain_scores_gemma":[0.99750024,0.0019297436,0.000174321,0.000080900514,0.00022891915,0.000085921914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029298451,0.0011945713,0.0023932524,0.0012157786,0.0006874206,0.0025026428,0.0017481976,0.002229743,0.0042625214],"category_scores_gemma":[0.006192062,0.0010818384,0.0012630046,0.0023545385,0.0013397506,0.0018438279,0.0017613868,0.0029790804,0.00038691747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002264096,0.000015939537,0.000053819498,0.000031651496,0.000012498827,0.000014249572,0.000014470989,0.98602366,0.000076822565,0.010588854,0.00037614157,0.002769186],"study_design_scores_gemma":[0.0000045833085,0.000009152532,0.000017745439,0.0000067214964,0.0000032915038,0.000002472401,0.000005493711,0.99658173,0.000028871811,0.0031256152,0.00021183456,0.0000025945901],"about_ca_topic_score_codex":0.015736777,"about_ca_topic_score_gemma":0.007283297,"teacher_disagreement_score":0.015736777,"about_ca_system_score_codex":0.001939268,"about_ca_system_score_gemma":0.0023219516,"threshold_uncertainty_score":0.031290352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00488642,0.0003040547,0.9851341,0.00038376122,0.00005601819,0.00007762875,0.00013034236,0.00025375542,0.008773841],"genre_scores_gemma":[0.44173428,0.0011556745,0.5380897,0.0005108573,0.00026486858,0.00086321036,0.0007311743,0.0006821276,0.015968176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987412,0.0007627326,0.000033342443,0.00012764666,0.00022116827,0.00011391207],"domain_scores_gemma":[0.9966589,0.0025744608,0.00014786494,0.00012169443,0.00035709664,0.0001398788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030140595,0.0022297006,0.0030332447,0.0010594608,0.0006863729,0.002623031,0.0018909817,0.0020783036,0.008073179],"category_scores_gemma":[0.0058437963,0.0019222604,0.0011693013,0.0017048231,0.0012570723,0.0020226769,0.0015505148,0.003367741,0.0011362864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042660078,0.00005424813,0.000059753867,0.000050865165,0.000022540777,0.000025645879,0.000018061311,0.9801135,0.00016597426,0.00829592,0.0017057556,0.00944509],"study_design_scores_gemma":[0.000007993473,0.000010249561,0.0000110799865,0.0000065193926,0.0000047693165,0.0000033684971,0.00000321603,0.9961564,0.00006104691,0.0035396703,0.00019353413,0.0000020929301],"about_ca_topic_score_codex":0.0071737296,"about_ca_topic_score_gemma":0.008103919,"teacher_disagreement_score":0.008073179,"about_ca_system_score_codex":0.0012515844,"about_ca_system_score_gemma":0.0025238201,"threshold_uncertainty_score":0.02700746},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49915725,0.0012303166,0.4778867,0.0010634258,0.00012125939,0.0002243973,0.0005500294,0.00021079511,0.019555787],"genre_scores_gemma":[0.9404747,0.00024215576,0.054530274,0.00009688156,0.000025197209,0.00014279425,0.00018770684,0.00004760841,0.0042526596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993674,0.00029962338,0.000019369738,0.000118006275,0.000070465576,0.00012508959],"domain_scores_gemma":[0.99900514,0.0007015099,0.00010797236,0.000033083983,0.00006320101,0.00008905303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011822731,0.0011538013,0.0013808038,0.00075915206,0.00052668864,0.0016374182,0.0011624232,0.0018896312,0.003626472],"category_scores_gemma":[0.0021636733,0.00062875677,0.0010542851,0.0010861254,0.00093428453,0.0010008634,0.0013936284,0.0009172422,0.00023400258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030452455,0.000021369593,0.00018671066,0.00003271592,0.000017308612,0.00006361082,0.000015670961,0.9957562,0.00027304966,0.0015983892,0.00013256154,0.0018719652],"study_design_scores_gemma":[0.000017197797,0.000044465873,0.00017037564,0.0000056418157,0.000008957925,0.00001646322,0.00003461104,0.99752516,0.00019769502,0.0017691859,0.00020457522,0.0000056003882],"about_ca_topic_score_codex":0.007944125,"about_ca_topic_score_gemma":0.004357611,"teacher_disagreement_score":0.007944125,"about_ca_system_score_codex":0.0013844867,"about_ca_system_score_gemma":0.001134155,"threshold_uncertainty_score":0.015795767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04335276,0.00069560687,0.9445952,0.0008646275,0.00011091988,0.00026911777,0.00086078607,0.00029001993,0.008961098],"genre_scores_gemma":[0.5342685,0.0014882309,0.43526626,0.0004869143,0.00023357836,0.0011588287,0.0021386365,0.00038733846,0.024571626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985757,0.0006637451,0.000069107715,0.00020054255,0.00026825554,0.0002224918],"domain_scores_gemma":[0.99779093,0.0014863608,0.00021757536,0.0000746362,0.00020365744,0.00022691286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160216,0.002317913,0.002817082,0.0015873912,0.0007399388,0.0031345615,0.0019425156,0.003212231,0.009226925],"category_scores_gemma":[0.0040890444,0.0019161078,0.00286728,0.001682595,0.00112648,0.0020192647,0.0016220186,0.002924103,0.00081056415],"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.00012647262,0.00008099073,0.00020298814,0.00012313742,0.000060528655,0.00006317714,0.000039075287,0.97342235,0.0006399463,0.017568953,0.0011463609,0.006526164],"study_design_scores_gemma":[0.000024184901,0.000045973207,0.00010160302,0.000014850306,0.000017678047,0.000011623947,0.000014387468,0.98877466,0.0001308047,0.0104978215,0.00035629436,0.000009999295],"about_ca_topic_score_codex":0.011266764,"about_ca_topic_score_gemma":0.007509678,"teacher_disagreement_score":0.011266764,"about_ca_system_score_codex":0.0029188597,"about_ca_system_score_gemma":0.0035671857,"threshold_uncertainty_score":0.0308671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7913056,0.0027480405,0.19044757,0.003924456,0.00031630884,0.00011552185,0.001736758,0.00013071128,0.009274969],"genre_scores_gemma":[0.99651945,0.00022695352,0.0019079834,0.000033861495,0.000033746728,0.000016456945,0.00014747023,0.000016210552,0.0010977514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770385,0.0008564635,0.00011455606,0.0004168081,0.0002912281,0.00061709346],"domain_scores_gemma":[0.98914075,0.00778934,0.001333394,0.000186993,0.0008670506,0.000682493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003411725,0.0011784598,0.0018269193,0.0013292384,0.00097443315,0.0042375126,0.0023629721,0.0035294273,0.0024907805],"category_scores_gemma":[0.012998009,0.0021356123,0.0015784949,0.002404218,0.0015394086,0.004366387,0.0018177441,0.0026964406,0.00015583607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024586885,0.000008489297,0.00081377116,0.000013124351,0.000032217296,0.000092708025,0.000016508837,0.99705386,0.000056573812,0.0011502791,0.000085970736,0.000651919],"study_design_scores_gemma":[0.000004857079,0.000021707054,0.0010151672,0.000009503933,0.000026359236,0.000020015734,0.00009657673,0.99652976,0.00007513983,0.0020650632,0.000116787334,0.000018950788],"about_ca_topic_score_codex":0.088591136,"about_ca_topic_score_gemma":0.0631597,"teacher_disagreement_score":0.088591136,"about_ca_system_score_codex":0.0051888167,"about_ca_system_score_gemma":0.0033848705,"threshold_uncertainty_score":0.17615092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90458184,0.00044954254,0.08359498,0.00056211255,0.00009549714,0.00024096838,0.0007896089,0.00028994298,0.009395417],"genre_scores_gemma":[0.99441296,0.000058472895,0.003976386,0.000013854703,0.0000058928663,0.000025775287,0.000089931826,0.000018879306,0.0013978145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989791,0.00030711232,0.00003688732,0.00014911879,0.000092255556,0.000435549],"domain_scores_gemma":[0.9961475,0.0024927242,0.00033964313,0.00012473651,0.00039688087,0.0004985658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017572698,0.0010260923,0.0020683017,0.0011315413,0.0009147169,0.002202962,0.0017316872,0.001527394,0.0070502735],"category_scores_gemma":[0.0041515334,0.0009808826,0.0011563181,0.0013444313,0.0009200195,0.0020652686,0.0012654267,0.001236173,0.0004278086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048148952,0.00009330296,0.0012582861,0.00006172503,0.000050208375,0.00023247069,0.000058543836,0.9894366,0.00076887634,0.002451546,0.0005392509,0.004567609],"study_design_scores_gemma":[0.000012608844,0.00007736312,0.0005709447,0.000006987133,0.000024960847,0.000021357393,0.00010531141,0.99747664,0.00026032035,0.0013309132,0.00009749025,0.00001510832],"about_ca_topic_score_codex":0.027068682,"about_ca_topic_score_gemma":0.017583827,"teacher_disagreement_score":0.027068682,"about_ca_system_score_codex":0.0021691425,"about_ca_system_score_gemma":0.0027191164,"threshold_uncertainty_score":0.05382222},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02905831,0.000311443,0.95756954,0.00086995657,0.00003362911,0.00012349703,0.00022510877,0.000058170204,0.011750296],"genre_scores_gemma":[0.6161546,0.0009231975,0.3792371,0.00020457339,0.000100549594,0.00070704165,0.0006493186,0.00013587257,0.0018876897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924711,0.004776922,0.0003352424,0.0006773807,0.0012380589,0.0005013041],"domain_scores_gemma":[0.9742687,0.021384075,0.000950578,0.0011156634,0.0017163863,0.0005646611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012365469,0.0009389821,0.0022540628,0.002735655,0.0010372511,0.0049965703,0.0023178416,0.0020318176,0.0061758277],"category_scores_gemma":[0.061177287,0.00082664384,0.0015854487,0.0032430133,0.004953407,0.006008495,0.008897636,0.0036092096,0.00035814408],"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.0002005149,0.00006807299,0.0007034659,0.00019431199,0.000038268536,0.000090053836,0.0005330273,0.24850316,0.00083524134,0.71927136,0.0012708902,0.02829162],"study_design_scores_gemma":[0.000027222748,0.00008988344,0.00029852442,0.00017196307,0.000011729413,0.000042060077,0.00021601508,0.5042693,0.00053974526,0.49262714,0.0016667362,0.000039672865],"about_ca_topic_score_codex":0.0032202671,"about_ca_topic_score_gemma":0.0013264669,"teacher_disagreement_score":0.012365469,"about_ca_system_score_codex":0.0017395027,"about_ca_system_score_gemma":0.0019955984,"threshold_uncertainty_score":0.06539565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053460617,0.0031170575,0.92195654,0.0012592261,0.00016046468,0.000101944264,0.00009763036,0.00008127426,0.019765196],"genre_scores_gemma":[0.7396611,0.0033583073,0.23977944,0.00042149716,0.0002871911,0.0004916528,0.0002463851,0.00017061245,0.015583885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982084,0.0010520375,0.0000718043,0.00012265614,0.0003847443,0.00016049683],"domain_scores_gemma":[0.9940773,0.0047032284,0.00046705056,0.0001299907,0.00040711203,0.00021540899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005700413,0.0016171656,0.0019447921,0.0029583175,0.001053655,0.003243792,0.0013692746,0.0029131365,0.0030583297],"category_scores_gemma":[0.016422663,0.0013217856,0.0016567034,0.002974078,0.0022544297,0.0021076018,0.0032142072,0.001981916,0.00034646608],"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.000052835218,0.000048902493,0.0002573816,0.00013369447,0.00009912833,0.00006861941,0.00009135814,0.83865666,0.00027323316,0.14611611,0.0010115703,0.013190591],"study_design_scores_gemma":[0.000024668287,0.00004384386,0.00014211306,0.000060046325,0.000021645848,0.000026762058,0.000037660375,0.86097026,0.00014686561,0.13780233,0.00070870726,0.000015057751],"about_ca_topic_score_codex":0.0028644593,"about_ca_topic_score_gemma":0.0021474068,"teacher_disagreement_score":0.005700413,"about_ca_system_score_codex":0.0020115287,"about_ca_system_score_gemma":0.002002848,"threshold_uncertainty_score":0.030147016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5177806,0.00090954633,0.4705075,0.0012780852,0.00013419589,0.00017125739,0.00051697134,0.00051312,0.008188666],"genre_scores_gemma":[0.96134984,0.0002243675,0.036466885,0.00004960809,0.00006954281,0.000044442924,0.0003037673,0.000038869603,0.0014525772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955076,0.002007963,0.0002872164,0.00036719878,0.0012108267,0.00061916624],"domain_scores_gemma":[0.9696221,0.023249265,0.001965954,0.0017744406,0.0017186016,0.0016697339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005908057,0.0010099785,0.0013571804,0.003902613,0.0012760814,0.0044093886,0.0013408484,0.0014729265,0.0042432873],"category_scores_gemma":[0.029913638,0.0006521232,0.00085895834,0.003197268,0.002074847,0.0057986686,0.0018839614,0.0020350765,0.00038070296],"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.00076848443,0.00025388907,0.009963188,0.00021366475,0.00011727044,0.00013836044,0.00035900602,0.5737905,0.0024134715,0.29503208,0.0027502778,0.11419985],"study_design_scores_gemma":[0.00003558408,0.0002520183,0.0019504979,0.00004905866,0.000031769006,0.000037957416,0.00014842927,0.7281785,0.0009314303,0.26766035,0.00068116694,0.000043229793],"about_ca_topic_score_codex":0.0025752296,"about_ca_topic_score_gemma":0.0031048406,"teacher_disagreement_score":0.005908057,"about_ca_system_score_codex":0.0021997395,"about_ca_system_score_gemma":0.0018734069,"threshold_uncertainty_score":0.031245172},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031211028,0.0005609047,0.9574652,0.00044918148,0.00014553194,0.00022483623,0.0001733345,0.0003180596,0.009451918],"genre_scores_gemma":[0.24200891,0.0006194501,0.74764407,0.00023055599,0.00012730825,0.00076332473,0.00035282603,0.00016150695,0.008092096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939656,0.00029548485,0.00002090131,0.00006261768,0.00015313274,0.00007140014],"domain_scores_gemma":[0.99867487,0.00095742795,0.000084767,0.000053834498,0.00016757894,0.000061539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00173565,0.0014122865,0.001467606,0.0013759742,0.00094266585,0.0022250854,0.0019742553,0.0027765527,0.0054933294],"category_scores_gemma":[0.0025828395,0.0010905842,0.001145862,0.0019970671,0.000847752,0.0016816452,0.0010880801,0.0020276466,0.00051725813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107944645,0.00012640664,0.00016273992,0.00007014573,0.000028169437,0.00003904507,0.000040970543,0.9546938,0.0005062075,0.013859799,0.0013722616,0.028992578],"study_design_scores_gemma":[0.000020213132,0.000030757717,0.000033929486,0.000006670684,0.000008742564,0.000008465651,0.000011355507,0.9959394,0.00012554564,0.0034583614,0.00035204322,0.000004603951],"about_ca_topic_score_codex":0.01182762,"about_ca_topic_score_gemma":0.012703705,"teacher_disagreement_score":0.01182762,"about_ca_system_score_codex":0.0017848179,"about_ca_system_score_gemma":0.0025518273,"threshold_uncertainty_score":0.023517549},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21948878,0.0036865536,0.7603497,0.0012206511,0.00053620344,0.00017553079,0.0003217962,0.0007805067,0.013440269],"genre_scores_gemma":[0.9441322,0.0014927872,0.049845397,0.00019150563,0.0001572996,0.00012747648,0.00030135192,0.00025882653,0.0034930354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782217,0.00093017035,0.000104063874,0.00015224911,0.00058961037,0.00040174162],"domain_scores_gemma":[0.9850366,0.011371837,0.00067085103,0.000608343,0.0017904211,0.00052197155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050325044,0.0010579333,0.0023378134,0.0020941314,0.0014129134,0.0028026137,0.0025951331,0.002500488,0.0018590328],"category_scores_gemma":[0.020559555,0.0007042137,0.001343879,0.0019840724,0.0018312914,0.0026962801,0.0016678467,0.002402214,0.000375928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011056462,0.000043058404,0.00039517588,0.000047141268,0.000018714198,0.00002966009,0.0000988385,0.9808132,0.0002747143,0.014041803,0.0003184973,0.003808669],"study_design_scores_gemma":[0.0000050581616,0.000012852057,0.000053465432,0.000008458345,0.0000045461693,0.0000044939848,0.00001933039,0.99748564,0.000083507635,0.002200043,0.000116719886,0.0000057857756],"about_ca_topic_score_codex":0.028372467,"about_ca_topic_score_gemma":0.00911263,"teacher_disagreement_score":0.028372467,"about_ca_system_score_codex":0.0042829704,"about_ca_system_score_gemma":0.003803997,"threshold_uncertainty_score":0.056414664},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05463396,0.0005023018,0.92340416,0.00066705275,0.00026240986,0.00066975295,0.0003300762,0.0012172367,0.018313041],"genre_scores_gemma":[0.27671835,0.00033439155,0.7120813,0.00027430418,0.00010196765,0.00060272473,0.0006121226,0.00044416008,0.008830652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916446,0.00029130117,0.000029585475,0.0001240959,0.0001354188,0.00025522997],"domain_scores_gemma":[0.9984218,0.0010495915,0.000073941526,0.00011209915,0.00013761093,0.00020499648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014070242,0.0014177002,0.0027188396,0.0015714729,0.0015005113,0.0021193235,0.002758955,0.0032762852,0.016204415],"category_scores_gemma":[0.0034170826,0.0011876945,0.001552082,0.002118143,0.0010623523,0.002599528,0.0021947236,0.0024987366,0.0017368427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037233272,0.00062097097,0.00045610502,0.00019353909,0.00006540238,0.00028648076,0.000181882,0.8281305,0.0022721943,0.02528623,0.009487809,0.13264658],"study_design_scores_gemma":[0.00013776887,0.00011092126,0.00009663567,0.00002050235,0.000026780044,0.000042505562,0.000087435365,0.9857474,0.00052455364,0.011304089,0.0018839017,0.00001762098],"about_ca_topic_score_codex":0.011030095,"about_ca_topic_score_gemma":0.009986639,"teacher_disagreement_score":0.016204415,"about_ca_system_score_codex":0.0015424283,"about_ca_system_score_gemma":0.0041150693,"threshold_uncertainty_score":0.054209173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88462836,0.0003894302,0.09352429,0.00096050854,0.00008153619,0.00020275622,0.000230855,0.0005707252,0.019411525],"genre_scores_gemma":[0.9936591,0.00006061257,0.0053707086,0.000021289496,0.000007480853,0.000015711594,0.00004028756,0.000014765998,0.00081011764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994808,0.00016320951,0.000015703048,0.000098617966,0.00006744918,0.00017420198],"domain_scores_gemma":[0.9982753,0.000765852,0.00022692927,0.00013488973,0.00039809404,0.00019894692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083737634,0.00047328894,0.00035511702,0.0005920141,0.00035477392,0.0012090027,0.00091643236,0.00063998083,0.0065621664],"category_scores_gemma":[0.0049544084,0.00024397238,0.00029586628,0.0007755846,0.00026844878,0.0019626934,0.0009016164,0.00047611768,0.00072836236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011151773,0.001637759,0.068946406,0.00037582984,0.00018269112,0.00037954882,0.0005759763,0.4672328,0.022620482,0.027980125,0.0081903655,0.40076277],"study_design_scores_gemma":[0.00036034756,0.0016124172,0.0813937,0.00009477664,0.00036632793,0.0002879594,0.0051263995,0.85970175,0.011699414,0.02426963,0.0149859935,0.000101310645],"about_ca_topic_score_codex":0.0055259517,"about_ca_topic_score_gemma":0.014570606,"teacher_disagreement_score":0.0065621664,"about_ca_system_score_codex":0.0007158165,"about_ca_system_score_gemma":0.0019204901,"threshold_uncertainty_score":0.02195263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114803724,0.0014095111,0.86815244,0.0030422395,0.00021325742,0.00021641255,0.00020736746,0.000098463606,0.011856564],"genre_scores_gemma":[0.9036854,0.0008202649,0.083488844,0.00028972747,0.00034996733,0.00034924265,0.0001860693,0.00006389085,0.010766504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99274397,0.0048414157,0.00026504893,0.00088670914,0.0005977723,0.0006650969],"domain_scores_gemma":[0.9774035,0.019292837,0.0009897606,0.00052436884,0.000691965,0.001097404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075133718,0.0018117471,0.0046908366,0.0012279734,0.0007895691,0.006128459,0.0032515314,0.0064392462,0.0069052377],"category_scores_gemma":[0.030862017,0.0023785774,0.0020123215,0.002586028,0.002629996,0.007240132,0.003354349,0.0039237533,0.00048163615],"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.00048136717,0.00031015946,0.0013482725,0.00019492887,0.00025391704,0.00048359047,0.000121495286,0.8350124,0.00072276796,0.14481439,0.0015401619,0.014716546],"study_design_scores_gemma":[0.00010750875,0.00006481404,0.00027949098,0.000015550415,0.000045671615,0.000043570974,0.00002683882,0.9411728,0.00013920471,0.057821717,0.0002574337,0.000025356863],"about_ca_topic_score_codex":0.0030548454,"about_ca_topic_score_gemma":0.0014794235,"teacher_disagreement_score":0.0075133718,"about_ca_system_score_codex":0.0023442283,"about_ca_system_score_gemma":0.0017737352,"threshold_uncertainty_score":0.03973502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77593803,0.00039089067,0.15635015,0.0031139518,0.00025474365,0.00018241924,0.00018891298,0.00036401986,0.06321689],"genre_scores_gemma":[0.9947936,0.00003916722,0.0026597967,0.000030918,0.000020395926,0.000008119333,0.000014242522,0.000010227225,0.0024234254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917465,0.00035390852,0.000026884825,0.00013004451,0.00012756452,0.00018683405],"domain_scores_gemma":[0.99798113,0.00103998,0.00020399428,0.00014153657,0.0001770615,0.00045632434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024247195,0.0005721759,0.0011226364,0.00043739696,0.0010922244,0.003096732,0.0012434562,0.0030790223,0.009564412],"category_scores_gemma":[0.0049782386,0.00073709094,0.0007222521,0.00052915554,0.000989648,0.0033119773,0.0016738597,0.0017974132,0.0007472385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008298079,0.0011628303,0.009395026,0.00043282367,0.0003168808,0.008084569,0.0012204563,0.5752315,0.031403087,0.27931368,0.011167464,0.073973686],"study_design_scores_gemma":[0.00022454087,0.00090074894,0.0017121744,0.000022653961,0.00007475105,0.0006126646,0.0006281153,0.91301227,0.0027071424,0.07592609,0.0040884116,0.000090416],"about_ca_topic_score_codex":0.0007185671,"about_ca_topic_score_gemma":0.0011812882,"teacher_disagreement_score":0.009564412,"about_ca_system_score_codex":0.0006944325,"about_ca_system_score_gemma":0.00097133924,"threshold_uncertainty_score":0.03199613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6809285,0.00064959365,0.30472812,0.0037044273,0.000125141,0.00033998137,0.00069248374,0.00011370967,0.008717965],"genre_scores_gemma":[0.99056983,0.000099848534,0.008246068,0.00007211002,0.000023482788,0.000033825116,0.000056122775,0.000013068481,0.00088568317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995415,0.0034974152,0.00011960708,0.0003004164,0.00023076667,0.00043671206],"domain_scores_gemma":[0.9716915,0.024771364,0.0013030628,0.00039585217,0.00058972015,0.0012485094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066556274,0.00084799994,0.0009883257,0.0009521391,0.0004351458,0.0025252516,0.0013010188,0.0021213354,0.006815609],"category_scores_gemma":[0.028673233,0.0011513452,0.00077802554,0.0012317793,0.0006485426,0.0030033619,0.0010678804,0.0018338487,0.00031404282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039634568,0.0002106256,0.012270602,0.00005132397,0.00008424674,0.0001395798,0.00007956568,0.9642538,0.00028031596,0.0063752183,0.0005769229,0.015281425],"study_design_scores_gemma":[0.000043522563,0.00013568524,0.0016765145,0.000010372325,0.000038223923,0.0000394882,0.00010054512,0.9905111,0.00018392946,0.0069612204,0.00028495377,0.0000143944235],"about_ca_topic_score_codex":0.008179949,"about_ca_topic_score_gemma":0.012922972,"teacher_disagreement_score":0.008179949,"about_ca_system_score_codex":0.002487585,"about_ca_system_score_gemma":0.0020657042,"threshold_uncertainty_score":0.035198748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030072376,0.00037261323,0.95783937,0.00036865074,0.000116465504,0.000074083444,0.00024296377,0.00010114492,0.010812379],"genre_scores_gemma":[0.54666704,0.00067690766,0.43655416,0.0002561624,0.00016708698,0.00046202927,0.00085892493,0.000240154,0.014117478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995722,0.00019501586,0.00001147887,0.000066354856,0.00008123239,0.00007372315],"domain_scores_gemma":[0.99936587,0.00037110617,0.00006400089,0.000035400175,0.00009959898,0.00006408548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009408645,0.0010137255,0.00107464,0.0004998425,0.00034877876,0.0010571107,0.0010851347,0.0010830634,0.0042697242],"category_scores_gemma":[0.0017778152,0.0005609636,0.0008550659,0.0006688505,0.00048601767,0.0009861679,0.0010978124,0.0014786883,0.00039087053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089802306,0.00008283737,0.00029438979,0.00011550501,0.0000402594,0.000073780866,0.00003466403,0.9619767,0.0011325821,0.018125298,0.0025279385,0.0155062415],"study_design_scores_gemma":[0.000010530615,0.000019509604,0.000058079844,0.000005184772,0.000006191226,0.0000089488685,0.0000080322925,0.995073,0.00009757919,0.004331223,0.00037922297,0.0000024509375],"about_ca_topic_score_codex":0.006027306,"about_ca_topic_score_gemma":0.00429526,"teacher_disagreement_score":0.006027306,"about_ca_system_score_codex":0.0006563331,"about_ca_system_score_gemma":0.0016334746,"threshold_uncertainty_score":0.014283657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9343236,0.0010295927,0.001097479,0.003249105,0.00017647582,0.000093424496,0.00043409382,0.000052799092,0.059543416],"genre_scores_gemma":[0.9967248,0.00007336382,0.00006847553,0.000235092,0.000040024242,0.000008148496,0.00004878586,0.000004544565,0.0027967205],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793637,0.0004814752,0.00008885584,0.00030358354,0.00034999967,0.0008397701],"domain_scores_gemma":[0.98090565,0.01269248,0.0034455275,0.00056667434,0.0009069626,0.0014826854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029579408,0.00024676588,0.000801901,0.00077166077,0.00056279544,0.0030033477,0.00085770164,0.0031392286,0.02389867],"category_scores_gemma":[0.0117573645,0.0002564095,0.00091027067,0.0005937715,0.0016365227,0.0023305991,0.000974605,0.002225907,0.0007253319],"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.026986167,0.004356684,0.5401096,0.0011816414,0.0011125506,0.0044073313,0.0016352413,0.026206933,0.008929906,0.30107263,0.014659963,0.069341436],"study_design_scores_gemma":[0.002269111,0.006864971,0.8374462,0.00037863664,0.0036582975,0.0019511438,0.0076123103,0.031216992,0.0068357494,0.075385034,0.026229765,0.00015180004],"about_ca_topic_score_codex":0.007510389,"about_ca_topic_score_gemma":0.01084141,"teacher_disagreement_score":0.02389867,"about_ca_system_score_codex":0.0022970594,"about_ca_system_score_gemma":0.0024462976,"threshold_uncertainty_score":0.07994896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21284737,0.018315597,0.548673,0.09585633,0.0015799978,0.00016080918,0.0005297056,0.00037766038,0.121659584],"genre_scores_gemma":[0.9687843,0.005967237,0.012205316,0.0010417993,0.0014841916,0.00007591741,0.000080216116,0.00004445703,0.010316632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625635,0.0025509899,0.00013318166,0.0004201493,0.00038321287,0.00025617972],"domain_scores_gemma":[0.8675551,0.12437963,0.0039471528,0.0014332026,0.0016202604,0.0010646717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010946245,0.00076389406,0.002275992,0.0014393972,0.0014401871,0.0070218327,0.0017476494,0.0061964537,0.009990066],"category_scores_gemma":[0.06597575,0.00092445035,0.0011262574,0.0015722818,0.0055443514,0.01693247,0.0018285582,0.005865133,0.0004855544],"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.00019670639,0.000095161646,0.0010009229,0.00014485006,0.00005958335,0.00033194412,0.00027327825,0.021192038,0.00012457548,0.9586907,0.0042769318,0.013613206],"study_design_scores_gemma":[0.00006374523,0.000019137346,0.00017631282,0.000022612398,0.000018343242,0.00008618711,0.00011109968,0.039109986,0.00004858851,0.9592713,0.0010482445,0.000024440857],"about_ca_topic_score_codex":0.0017604126,"about_ca_topic_score_gemma":0.00092007604,"teacher_disagreement_score":0.010946245,"about_ca_system_score_codex":0.001647722,"about_ca_system_score_gemma":0.0016100087,"threshold_uncertainty_score":0.05788994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052658267,0.00016603699,0.9213764,0.00045422235,0.00016838025,0.00025515433,0.00090349885,0.011751206,0.012266794],"genre_scores_gemma":[0.81210804,0.00010069959,0.17932552,0.0002609603,0.000042049793,0.00029079968,0.0016614917,0.0014693493,0.0047412026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993598,0.0001702533,0.00004327353,0.00015013185,0.00019782451,0.000078686986],"domain_scores_gemma":[0.9982253,0.00069440284,0.00008334185,0.00052433676,0.00041433482,0.000058311303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010958246,0.0009861328,0.0007714108,0.00056626764,0.00032949774,0.0012622427,0.0015213491,0.00064878986,0.010206887],"category_scores_gemma":[0.004979467,0.0006373452,0.001035807,0.0004967331,0.0003253744,0.0012349401,0.0013801765,0.0015283842,0.0018302596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020101549,0.00013382833,0.00096120714,0.00007083743,0.00005210508,0.000099132994,0.000045830653,0.9188262,0.0042249155,0.0037719514,0.004396306,0.06721654],"study_design_scores_gemma":[0.000010940967,0.000008244203,0.00007115116,0.0000024377955,0.000004105215,0.000008112303,0.000004029254,0.9969483,0.0010820314,0.0011630277,0.0006938665,0.000003694843],"about_ca_topic_score_codex":0.0056973323,"about_ca_topic_score_gemma":0.006177326,"teacher_disagreement_score":0.010206887,"about_ca_system_score_codex":0.0007176501,"about_ca_system_score_gemma":0.0011794256,"threshold_uncertainty_score":0.034145415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8379425,0.00020467998,0.15722388,0.00024154347,0.000042410942,0.00016750833,0.00008723199,0.000050993745,0.0040391884],"genre_scores_gemma":[0.984705,0.000034384633,0.014703281,0.000013098993,0.000012415427,0.000050527487,0.00002484543,0.00000905546,0.0004473846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896932,0.0066200006,0.00030832153,0.00096422684,0.0011401355,0.0012741458],"domain_scores_gemma":[0.95293015,0.038667466,0.0020868653,0.0021485281,0.0024689345,0.0016980282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015215155,0.0009987653,0.002152235,0.0013896484,0.0013414308,0.0037705242,0.0018745057,0.001403173,0.0016058466],"category_scores_gemma":[0.03634319,0.00039381578,0.0008751721,0.0018824503,0.001978368,0.0031344555,0.0023025165,0.0010747873,0.00014064927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022565757,0.00075528066,0.016187677,0.00018142206,0.00029242737,0.00023749117,0.00039334423,0.9122041,0.002053485,0.0323132,0.0004542549,0.03267075],"study_design_scores_gemma":[0.000068181085,0.0005677467,0.0047737267,0.000015715079,0.00009402531,0.00003737013,0.00041079262,0.97805846,0.0016345493,0.014090905,0.0002221924,0.000026246697],"about_ca_topic_score_codex":0.0072440132,"about_ca_topic_score_gemma":0.004627383,"teacher_disagreement_score":0.015215155,"about_ca_system_score_codex":0.0030358427,"about_ca_system_score_gemma":0.0024361322,"threshold_uncertainty_score":0.08046639},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06510431,0.0018132105,0.9090353,0.0018723237,0.00031281944,0.00026651277,0.0015985399,0.00068741164,0.0193096],"genre_scores_gemma":[0.69084275,0.0027567255,0.28420585,0.00058312673,0.000437364,0.0004241043,0.0020498107,0.0006059639,0.018094309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987043,0.000404048,0.00006284899,0.00024914954,0.0003589173,0.00022067469],"domain_scores_gemma":[0.9984981,0.0009353307,0.00016650799,0.00011915199,0.00012287029,0.00015802591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012859318,0.0016866736,0.002453601,0.0010008666,0.0010499005,0.004219056,0.002731663,0.0039571268,0.009899769],"category_scores_gemma":[0.0048492514,0.0014547042,0.0013220261,0.0033011655,0.0017115574,0.0035717003,0.0028550418,0.0023887586,0.0014307534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042525132,0.00019760602,0.0006347163,0.0008081011,0.000064623084,0.00047404662,0.00012223993,0.89144,0.002966688,0.032122806,0.00886286,0.061881036],"study_design_scores_gemma":[0.000050329123,0.0000959773,0.00043995035,0.00004636001,0.000024421392,0.00026520813,0.000103947365,0.96124804,0.0016721962,0.03220088,0.003808021,0.000044621465],"about_ca_topic_score_codex":0.0053823437,"about_ca_topic_score_gemma":0.0036901592,"teacher_disagreement_score":0.009899769,"about_ca_system_score_codex":0.0013323862,"about_ca_system_score_gemma":0.0016165875,"threshold_uncertainty_score":0.03311801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17305839,0.0024886073,0.74427795,0.0062007653,0.0007552401,0.0003357426,0.0038494272,0.0003537191,0.06868019],"genre_scores_gemma":[0.8347874,0.0011290639,0.12271347,0.00052190875,0.00048276177,0.00027284442,0.0014650701,0.0001850344,0.0384424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853504,0.00063618086,0.00004710685,0.00041700838,0.00015686073,0.000207692],"domain_scores_gemma":[0.99794906,0.0014531028,0.00014949872,0.00012600659,0.000108543594,0.00021383971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019172042,0.0013712269,0.0021049238,0.000916161,0.0008132763,0.0031954327,0.00278019,0.0037511042,0.015147136],"category_scores_gemma":[0.005604171,0.0009401114,0.0010302662,0.0018984788,0.0013727458,0.0036998352,0.0024611226,0.0019525514,0.0009935271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036619327,0.00025246033,0.0010083967,0.00034540208,0.00011726843,0.00060690084,0.00008407767,0.8813922,0.0010525844,0.07476532,0.007183127,0.032826107],"study_design_scores_gemma":[0.000096448246,0.00006759501,0.00043501065,0.0000199221,0.000022159395,0.00013007775,0.0000815797,0.93011874,0.00036358702,0.06590742,0.0027337365,0.00002380001],"about_ca_topic_score_codex":0.00446411,"about_ca_topic_score_gemma":0.0034809043,"teacher_disagreement_score":0.015147136,"about_ca_system_score_codex":0.0018057722,"about_ca_system_score_gemma":0.0013801471,"threshold_uncertainty_score":0.050672293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087759155,0.00010511563,0.9984786,0.000070341426,0.000016258291,0.000021812672,0.00003837568,0.00014356837,0.000248293],"genre_scores_gemma":[0.14931539,0.00076284714,0.8422922,0.00033050266,0.0002934465,0.0007397855,0.0008043452,0.0005852004,0.0048762048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892238,0.008469924,0.0002298608,0.00082416943,0.0009730163,0.00027931976],"domain_scores_gemma":[0.9792245,0.017377373,0.0008641645,0.0012631629,0.0009956984,0.00027501024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008646879,0.0018021239,0.0027383154,0.0016069036,0.0004906899,0.002368134,0.004256557,0.0022353057,0.0071329116],"category_scores_gemma":[0.04266196,0.0010827602,0.0021776666,0.0015489897,0.0019927695,0.0033018638,0.002884361,0.0031295398,0.0019089844],"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.0005059204,0.00015692381,0.0012080095,0.0005538773,0.00058035296,0.0005209581,0.00018395956,0.44835648,0.0020538326,0.4357682,0.0047177323,0.10539376],"study_design_scores_gemma":[0.00009180166,0.000075199634,0.00017673543,0.00003306609,0.00006001719,0.00017667071,0.000017551256,0.8590675,0.00060188264,0.137577,0.0020861484,0.00003632133],"about_ca_topic_score_codex":0.0021900919,"about_ca_topic_score_gemma":0.0014256522,"teacher_disagreement_score":0.008646879,"about_ca_system_score_codex":0.0012527119,"about_ca_system_score_gemma":0.0028132375,"threshold_uncertainty_score":0.045729578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7447568,0.001778122,0.10244932,0.018651646,0.0005996759,0.00052537007,0.000906228,0.00080291706,0.12952988],"genre_scores_gemma":[0.9901267,0.0002884425,0.0028291887,0.00035070875,0.000057646706,0.000052946933,0.000037086713,0.000035428435,0.0062217996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770653,0.0007664741,0.000057246485,0.00024717904,0.00014531222,0.0010772911],"domain_scores_gemma":[0.99005264,0.0076022614,0.0007379137,0.0002834886,0.00056687585,0.0007568316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033567748,0.001080904,0.0038054103,0.0009441823,0.0011904961,0.004271365,0.0015089528,0.0047584483,0.012321747],"category_scores_gemma":[0.016055642,0.0014743998,0.0009727594,0.00093022484,0.0025902044,0.004082624,0.002017169,0.0041892244,0.0005787798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002336261,0.0009701673,0.003194198,0.0005647549,0.00020481758,0.0009679613,0.00044777204,0.52331096,0.0036305129,0.42169318,0.01833539,0.024344005],"study_design_scores_gemma":[0.00093416503,0.0003734285,0.0036328076,0.00017112838,0.00023075701,0.00021425288,0.0014533268,0.60165584,0.0016717259,0.38357726,0.005989781,0.00009545917],"about_ca_topic_score_codex":0.015897632,"about_ca_topic_score_gemma":0.0141167985,"teacher_disagreement_score":0.015897632,"about_ca_system_score_codex":0.00545104,"about_ca_system_score_gemma":0.009029145,"threshold_uncertainty_score":0.041220307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9987153,0.00005303377,0.00008499637,0.00010786827,0.0000034085551,0.0000042377696,0.000057869478,0.000004048767,0.0009691915],"genre_scores_gemma":[0.9994134,0.000025635447,0.000031707004,0.000010832849,0.0000035145306,0.0000014533431,0.000055352186,0.0000013729485,0.0004567244],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994686,0.00016973115,0.00002462578,0.000095068914,0.000051278057,0.0001907007],"domain_scores_gemma":[0.9767169,0.01919653,0.0023320324,0.0004470439,0.00038673074,0.00092080573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018914,0.0003709299,0.00035375834,0.0004734728,0.0004336311,0.002719882,0.0005470609,0.0014996985,0.0072838627],"category_scores_gemma":[0.013421548,0.00030828692,0.00047886753,0.0003351625,0.00063898554,0.001581518,0.00057721353,0.0017381179,0.0005245611],"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.019345889,0.0062006563,0.80942494,0.00012165318,0.00039681795,0.0013548355,0.00073818304,0.12710372,0.0049538496,0.0033705826,0.0012350997,0.025753768],"study_design_scores_gemma":[0.00027143568,0.0054390104,0.7754539,0.000043573666,0.0005998203,0.00043799708,0.0047633885,0.20207396,0.0038244303,0.0058456417,0.001114508,0.00013239612],"about_ca_topic_score_codex":0.00966918,"about_ca_topic_score_gemma":0.010461782,"teacher_disagreement_score":0.00966918,"about_ca_system_score_codex":0.00090170663,"about_ca_system_score_gemma":0.0005896515,"threshold_uncertainty_score":0.024366975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03044323,0.0012190904,0.9626548,0.0006354684,0.00021540192,0.000017920698,0.00014026165,0.00046573716,0.0042081084],"genre_scores_gemma":[0.8889485,0.0012677629,0.09795896,0.00016473942,0.0005124724,0.00004694294,0.00041146262,0.00016193313,0.0105273025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979988,0.001120173,0.000092599905,0.0001882637,0.00046816174,0.00013205355],"domain_scores_gemma":[0.9937215,0.0047279405,0.00033966522,0.0006283369,0.00040741288,0.00017522843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036101218,0.0007885093,0.0014404792,0.00072306034,0.00043242986,0.0030164144,0.0014400807,0.001969357,0.0046144756],"category_scores_gemma":[0.01617856,0.00069296226,0.0013010789,0.0014246391,0.0008723505,0.004714336,0.0013288055,0.0025848916,0.0006592187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001542743,0.000074487725,0.0011345501,0.000076982484,0.00014847907,0.00018817028,0.00006180922,0.5423022,0.0010942196,0.42337388,0.0019163728,0.029474672],"study_design_scores_gemma":[0.000010469903,0.000010332423,0.00013000755,0.0000036524052,0.000009911872,0.000023989216,0.0000028572392,0.9139284,0.00013181253,0.08532445,0.00041289092,0.000011315612],"about_ca_topic_score_codex":0.00224328,"about_ca_topic_score_gemma":0.0012626799,"teacher_disagreement_score":0.0046144756,"about_ca_system_score_codex":0.00060033496,"about_ca_system_score_gemma":0.00071703724,"threshold_uncertainty_score":0.019092381},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4603486,0.0033430238,0.49813437,0.0075361,0.0004071196,0.0001830482,0.001060448,0.00045389935,0.02853332],"genre_scores_gemma":[0.9564426,0.0013281478,0.009947106,0.00025226455,0.00021901976,0.0001062774,0.00034215508,0.000075104035,0.03128731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976948,0.0010898431,0.00009610459,0.00037823585,0.00024584902,0.0004951371],"domain_scores_gemma":[0.9875731,0.00904971,0.0011978659,0.0003477092,0.0005315075,0.0013000851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005434554,0.0016102568,0.0047963,0.0017650737,0.001306582,0.0064646252,0.0057494775,0.008278669,0.009415965],"category_scores_gemma":[0.015919654,0.0021304889,0.002527811,0.0019786204,0.0032845265,0.0072088013,0.0027034841,0.0050177015,0.0008753981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004718128,0.000255911,0.001493118,0.00012657596,0.00019516291,0.0010028967,0.00020428318,0.70491683,0.00081069174,0.28512776,0.0017952358,0.0035997494],"study_design_scores_gemma":[0.000087418935,0.000055931207,0.0002518286,0.000011072293,0.000045768593,0.00007231729,0.000034710592,0.9618608,0.000059949543,0.03725041,0.00023860784,0.000031199652],"about_ca_topic_score_codex":0.013933615,"about_ca_topic_score_gemma":0.0068283547,"teacher_disagreement_score":0.013933615,"about_ca_system_score_codex":0.003105533,"about_ca_system_score_gemma":0.002466495,"threshold_uncertainty_score":0.031499505},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075210393,0.00013093889,0.99029326,0.000103874496,0.000014530089,0.00003638758,0.00009626346,0.00034290538,0.001460846],"genre_scores_gemma":[0.3106529,0.00029936052,0.6850252,0.00012848129,0.000052299074,0.00024019733,0.0006069753,0.00031254246,0.0026820162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879503,0.00043981356,0.00006672395,0.00028678554,0.00031593168,0.000095730524],"domain_scores_gemma":[0.9926561,0.006216813,0.00031244048,0.00032493597,0.0004028829,0.000086799744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019320438,0.0017800801,0.002004757,0.002238429,0.0006763564,0.0028859577,0.001669502,0.002331138,0.0053430963],"category_scores_gemma":[0.013618857,0.0022173948,0.002391318,0.0015014175,0.0016183078,0.0033608547,0.002516057,0.0029964736,0.0012426428],"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.00015247992,0.00010964737,0.0006494667,0.00023010674,0.00007672322,0.00018722576,0.000097593285,0.9198608,0.0026983516,0.013309941,0.0012505958,0.06137714],"study_design_scores_gemma":[0.00001351754,0.00002326944,0.00008358656,0.000016990176,0.00001257516,0.000025342997,0.000017824275,0.98461074,0.00091171777,0.013788661,0.00048599328,0.0000098248365],"about_ca_topic_score_codex":0.005533509,"about_ca_topic_score_gemma":0.0047800085,"teacher_disagreement_score":0.005533509,"about_ca_system_score_codex":0.0007395237,"about_ca_system_score_gemma":0.0018349951,"threshold_uncertainty_score":0.01787448},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31448358,0.010979892,0.08911566,0.08486879,0.0003965916,0.0005171479,0.0004314838,0.0001312636,0.49907556],"genre_scores_gemma":[0.95313954,0.0045588817,0.007181053,0.0005971429,0.00029579375,0.0004714779,0.000094131654,0.00003649659,0.03362551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9789372,0.014723383,0.0010097518,0.00092005084,0.0020149567,0.002394675],"domain_scores_gemma":[0.8852515,0.10090537,0.0045029568,0.0022822921,0.0038091985,0.0032486112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021558119,0.0005293604,0.0015446086,0.0022440911,0.006810063,0.014436442,0.0026212863,0.012604862,0.013882853],"category_scores_gemma":[0.09352217,0.0014815616,0.0013735023,0.0058540744,0.008729736,0.013205177,0.005742417,0.0071622157,0.00084546005],"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.00011728529,0.00010721009,0.0016710437,0.00009828651,0.000024466242,0.00040039886,0.0012586049,0.01502821,0.00003704022,0.9627379,0.0062321005,0.0122874435],"study_design_scores_gemma":[0.00016531836,0.00007439276,0.0012617309,0.0002127176,0.000042139396,0.0005438678,0.005336466,0.01940581,0.000118649616,0.9415849,0.031213067,0.00004100761],"about_ca_topic_score_codex":0.012935697,"about_ca_topic_score_gemma":0.008118709,"teacher_disagreement_score":0.021558119,"about_ca_system_score_codex":0.0058628367,"about_ca_system_score_gemma":0.006137891,"threshold_uncertainty_score":0.114011586},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008647186,0.00032681928,0.98475176,0.00029692004,0.000055698827,0.000064930005,0.00017069494,0.00008397673,0.0056020166],"genre_scores_gemma":[0.2259704,0.0010532225,0.758495,0.00028456215,0.00020182863,0.00063887786,0.00076486164,0.00031381793,0.012277433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992601,0.0003932295,0.000024773266,0.00009585113,0.00016449593,0.000061457205],"domain_scores_gemma":[0.9992055,0.00050657376,0.00008278482,0.000055224842,0.000091220725,0.0000586865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015282669,0.0016952802,0.0012976181,0.0011941162,0.00045816437,0.0013486217,0.00088241545,0.0015721561,0.0060008103],"category_scores_gemma":[0.0025787435,0.00093056477,0.0021040246,0.0010788707,0.0005902239,0.0012048176,0.0011362225,0.0022419612,0.00080120086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008808974,0.00007100324,0.00022265874,0.000172641,0.000084870655,0.00005765453,0.000043917047,0.9182258,0.0016261456,0.043116152,0.0019952122,0.034295868],"study_design_scores_gemma":[0.000021776312,0.000052407413,0.00007930781,0.00003451431,0.000025221028,0.0000285261,0.000023345867,0.9545517,0.00046115226,0.042375907,0.0023395582,0.0000066052125],"about_ca_topic_score_codex":0.0016696181,"about_ca_topic_score_gemma":0.0016635029,"teacher_disagreement_score":0.0060008103,"about_ca_system_score_codex":0.00091951905,"about_ca_system_score_gemma":0.0012724076,"threshold_uncertainty_score":0.020074725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85575724,0.00024055937,0.10876884,0.00045712056,0.000031072366,0.00046153428,0.000581537,0.00036572156,0.033336453],"genre_scores_gemma":[0.97073966,0.00010348793,0.022676738,0.000017147026,0.0000052175915,0.000084126346,0.00026206992,0.000044875047,0.006066648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994276,0.00019682155,0.000017676477,0.00009401008,0.000085167056,0.0001786746],"domain_scores_gemma":[0.99861586,0.0008403912,0.00008205384,0.00010588927,0.0001780471,0.00017778664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086977304,0.0009500653,0.0005535017,0.0006743207,0.0014424531,0.002218978,0.0012727858,0.0017071245,0.005893308],"category_scores_gemma":[0.0017530326,0.0006502502,0.0008775335,0.0014760182,0.0007438429,0.0017476503,0.0009172304,0.0009698462,0.00040432013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018237422,0.00024248954,0.0026681877,0.00003652946,0.000029190478,0.0008938767,0.00020186235,0.9722037,0.0011429098,0.004671274,0.00069868664,0.017028842],"study_design_scores_gemma":[0.000041340292,0.00022581316,0.001433818,0.000015000332,0.000038053717,0.0001756665,0.00084892643,0.98881626,0.0015665028,0.0046973354,0.0021199875,0.000021299773],"about_ca_topic_score_codex":0.03676143,"about_ca_topic_score_gemma":0.049172517,"teacher_disagreement_score":0.03676143,"about_ca_system_score_codex":0.0027240305,"about_ca_system_score_gemma":0.0022274028,"threshold_uncertainty_score":0.073094904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003640232,0.00033636874,0.993763,0.000251813,0.000023199904,0.000040433428,0.000040810635,0.00010758529,0.001796611],"genre_scores_gemma":[0.63085634,0.0018107631,0.3571843,0.00055744033,0.00046602805,0.0005010505,0.00051109615,0.00026607726,0.007846896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957283,0.0018519905,0.00016157608,0.0006515007,0.0013159063,0.0002906778],"domain_scores_gemma":[0.99424607,0.0035868539,0.00053123804,0.0005855205,0.00082842086,0.00022184761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006778728,0.0014621072,0.0023573013,0.002596691,0.0006013543,0.0031854163,0.0029631811,0.0023817453,0.0034979577],"category_scores_gemma":[0.014447784,0.0006771552,0.0013501747,0.0027064944,0.001344316,0.0034140716,0.0026802272,0.0024252809,0.0008263155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013774369,0.0001935635,0.002837065,0.00022083182,0.00031327904,0.00030011224,0.0001166364,0.628826,0.0031275828,0.2238232,0.0037062236,0.13639778],"study_design_scores_gemma":[0.000027326167,0.00008143915,0.00046127333,0.000023426821,0.00003099917,0.00012930669,0.000015235942,0.9102654,0.0008755751,0.08563398,0.0024367233,0.000019446315],"about_ca_topic_score_codex":0.0007052832,"about_ca_topic_score_gemma":0.00061864767,"teacher_disagreement_score":0.006778728,"about_ca_system_score_codex":0.0015039522,"about_ca_system_score_gemma":0.0012881518,"threshold_uncertainty_score":0.03584981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96079415,0.0005425901,0.022616364,0.0011676564,0.00005932487,0.00005807083,0.000267242,0.000059294605,0.014435247],"genre_scores_gemma":[0.9877944,0.00040873486,0.0016925765,0.00006859793,0.000021500548,0.000022461069,0.00008321695,0.000016111186,0.009892305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891984,0.00038627666,0.00004621383,0.0002074851,0.0001572311,0.00028302788],"domain_scores_gemma":[0.98432964,0.012737387,0.00073594495,0.00042318247,0.0010898989,0.0006838787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021670444,0.00067353033,0.000943138,0.0010272034,0.001236638,0.0027458002,0.0010802221,0.0019242364,0.013638606],"category_scores_gemma":[0.008174186,0.0010724713,0.0012894137,0.0015674251,0.0019516002,0.0045440015,0.002738831,0.0019355153,0.0005433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025075008,0.0011031005,0.059109144,0.0004437301,0.0007091764,0.003003054,0.0013330979,0.7708169,0.012326759,0.117979206,0.0021944176,0.028473955],"study_design_scores_gemma":[0.00023331975,0.0013842043,0.049576655,0.000114939714,0.0014497153,0.00065381255,0.0032548883,0.8069271,0.0071876766,0.12635839,0.0025083486,0.000351054],"about_ca_topic_score_codex":0.027907051,"about_ca_topic_score_gemma":0.029309202,"teacher_disagreement_score":0.027907051,"about_ca_system_score_codex":0.002350721,"about_ca_system_score_gemma":0.0016263825,"threshold_uncertainty_score":0.055489242},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23809804,0.00041474035,0.75490665,0.0008693703,0.00005993403,0.000067223635,0.000111064546,0.0002331542,0.005239812],"genre_scores_gemma":[0.92546326,0.00028165564,0.07132421,0.00006634562,0.00004547374,0.000087121305,0.00012284057,0.00007344835,0.002535723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949217,0.00021780461,0.000030385147,0.00009581799,0.00009762578,0.00006627807],"domain_scores_gemma":[0.9944238,0.004610608,0.00042786822,0.00012771501,0.00021826357,0.00019184641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020793374,0.0006135809,0.0012882658,0.00092969666,0.0005394655,0.002131523,0.0011221023,0.0020369068,0.002452791],"category_scores_gemma":[0.012396644,0.0013837742,0.0007472674,0.0007665751,0.0009711082,0.0023011544,0.0013346709,0.001346231,0.00018710537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022311862,0.000013305435,0.00031996542,0.000012147916,0.000012353065,0.000026408452,0.000009821484,0.9866817,0.00009431129,0.0107988445,0.000088854744,0.0019199289],"study_design_scores_gemma":[0.000005216908,0.0000039159236,0.000040578536,0.0000020936413,0.0000037715602,0.0000038861463,0.000002463534,0.99354845,0.000054859054,0.0062996773,0.000032877957,0.000002193226],"about_ca_topic_score_codex":0.007691672,"about_ca_topic_score_gemma":0.0039494247,"teacher_disagreement_score":0.007691672,"about_ca_system_score_codex":0.001667803,"about_ca_system_score_gemma":0.0018230904,"threshold_uncertainty_score":0.015293837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9855295,0.0007793665,0.0032681348,0.0018755044,0.000017291259,0.000015031059,0.000029022822,0.000005069508,0.008481125],"genre_scores_gemma":[0.99856514,0.00024214791,0.000328546,0.00013067883,0.000025811823,0.000004459243,0.000011726286,0.0000017267827,0.00068968296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993586,0.00035587154,0.000027775062,0.000059416714,0.00009113208,0.000107210086],"domain_scores_gemma":[0.9799191,0.014082647,0.0035696048,0.000779042,0.00048819563,0.0011613914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041193278,0.00026698498,0.00056192605,0.00043473535,0.0004940955,0.001822333,0.0005145741,0.0012707738,0.0035742042],"category_scores_gemma":[0.022224225,0.00018241878,0.00038714622,0.0004906377,0.0010834232,0.0025075793,0.0005345519,0.0015058123,0.00030224808],"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.0059434823,0.0015112386,0.37503216,0.00035818378,0.0010132284,0.0019373383,0.006311063,0.028802047,0.0053526754,0.3949013,0.00596458,0.17287265],"study_design_scores_gemma":[0.000748356,0.0022256507,0.1965025,0.00017091486,0.0004769796,0.0013773146,0.012432663,0.10256102,0.0030407014,0.67040545,0.009873012,0.00018536876],"about_ca_topic_score_codex":0.00051307055,"about_ca_topic_score_gemma":0.0006366977,"teacher_disagreement_score":0.0041193278,"about_ca_system_score_codex":0.0004583293,"about_ca_system_score_gemma":0.0002766913,"threshold_uncertainty_score":0.021785319},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046103265,0.00093024975,0.06366531,0.0031387066,0.0007877666,0.00011031611,0.0018579504,0.00031573157,0.8830907],"genre_scores_gemma":[0.72012824,0.0013394266,0.00847046,0.00032575952,0.00036375358,0.00006019903,0.0013567556,0.00008468376,0.2678708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995895,0.00008622571,0.000009851442,0.00006867397,0.00017252273,0.00007313283],"domain_scores_gemma":[0.9996327,0.0000720507,0.00002269077,0.000075501855,0.0001597626,0.000037258545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003145294,0.00039041735,0.00036186198,0.0006469927,0.00041792984,0.0018822656,0.000728904,0.0008142262,0.06434256],"category_scores_gemma":[0.0018489347,0.00018521056,0.00035964165,0.00096792384,0.00033452534,0.0014674747,0.0004482,0.00106852,0.0067008124],"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.00007485294,0.0001692225,0.001947207,0.000068094865,0.00004159694,0.00010751903,0.00006932701,0.028505323,0.0010556615,0.6910181,0.088736884,0.18820624],"study_design_scores_gemma":[0.00004532704,0.00011020287,0.006626913,0.000060045306,0.000069570786,0.0004264614,0.0003350937,0.16391134,0.0018554335,0.5035899,0.3229181,0.000051593444],"about_ca_topic_score_codex":0.0030627062,"about_ca_topic_score_gemma":0.003154261,"teacher_disagreement_score":0.06434256,"about_ca_system_score_codex":0.0010667101,"about_ca_system_score_gemma":0.00088888925,"threshold_uncertainty_score":0.21524727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04610041,0.00019159514,0.9445906,0.00019823393,0.00009716387,0.00014528605,0.00014806412,0.0002693784,0.008259311],"genre_scores_gemma":[0.8767074,0.00023729545,0.11607652,0.00007841414,0.00004980424,0.0001724977,0.00018619052,0.00010305674,0.0063887644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931884,0.00022635059,0.000021927595,0.00010378019,0.000119621145,0.00020949963],"domain_scores_gemma":[0.9993692,0.00020249357,0.00007152624,0.00003989579,0.00022107446,0.00009588656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010165578,0.0010358396,0.0008740628,0.0007219613,0.0007371907,0.0018778383,0.0015946287,0.0008196918,0.005524073],"category_scores_gemma":[0.0017240675,0.000490028,0.00091377436,0.00087716104,0.0005983861,0.0011466427,0.0011953185,0.00070215965,0.0005442508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097319484,0.000046103367,0.00032038754,0.000051648884,0.000023400486,0.00008000481,0.000050890056,0.9694037,0.0024490813,0.011587992,0.0009316894,0.01495792],"study_design_scores_gemma":[0.000003696303,0.000030157604,0.00004281349,0.0000027452563,0.000008202531,0.000009163771,0.000022817927,0.99738985,0.00022305778,0.0019613404,0.00030242006,0.000003633858],"about_ca_topic_score_codex":0.012556887,"about_ca_topic_score_gemma":0.016565306,"teacher_disagreement_score":0.012556887,"about_ca_system_score_codex":0.002036993,"about_ca_system_score_gemma":0.002342457,"threshold_uncertainty_score":0.02496761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050129495,0.0011207783,0.98897076,0.00042671998,0.00011493482,0.0001402286,0.0003232508,0.00027701128,0.0036133544],"genre_scores_gemma":[0.2923992,0.0034994832,0.6924803,0.00037341993,0.0006718104,0.0011331657,0.001840377,0.0007240511,0.006878233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99342656,0.0030245367,0.0003233722,0.0013308298,0.0015614674,0.00033317227],"domain_scores_gemma":[0.9933739,0.0030281008,0.0006068872,0.00090476044,0.0018839247,0.00020245078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00816706,0.0020146614,0.002403819,0.005675457,0.0014562905,0.004826157,0.0021583007,0.0017375487,0.0036105593],"category_scores_gemma":[0.023272784,0.0007656274,0.0023420001,0.006474075,0.0023502423,0.0034252421,0.0028597617,0.0029315462,0.0014649795],"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.00010087816,0.000069295456,0.0060551176,0.00046303624,0.0007139835,0.00019718651,0.00054097065,0.217086,0.002453138,0.5172539,0.016922837,0.23814361],"study_design_scores_gemma":[0.000011997921,0.000043523334,0.003283774,0.00009613879,0.00009722502,0.00014377425,0.0001047871,0.5800376,0.00080066925,0.4007761,0.014523736,0.000080707985],"about_ca_topic_score_codex":0.005053957,"about_ca_topic_score_gemma":0.0031404702,"teacher_disagreement_score":0.00816706,"about_ca_system_score_codex":0.0025885876,"about_ca_system_score_gemma":0.003197376,"threshold_uncertainty_score":0.04319203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94172275,0.00009523255,0.055168845,0.00059166877,0.000013463712,0.00014652981,0.0003205422,0.00013938412,0.0018015959],"genre_scores_gemma":[0.9917325,0.000030521307,0.007576597,0.000018120689,0.000004680206,0.000036236415,0.00011196271,0.0000049074056,0.00048445497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992544,0.00033478247,0.000024115212,0.00015101691,0.000055517772,0.0001801868],"domain_scores_gemma":[0.9963076,0.00271227,0.00046157817,0.00009563529,0.00016504327,0.00025790592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017865935,0.00058897276,0.0007334495,0.00068246253,0.00058840937,0.0012466878,0.0008409574,0.0014135676,0.0015632884],"category_scores_gemma":[0.0045437473,0.0006363258,0.0004614013,0.00051180914,0.00059892307,0.0011588427,0.00097002136,0.0006868548,0.00008918412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014049264,0.00009156706,0.004765743,0.000014878324,0.000014897306,0.00009192598,0.000036043974,0.9898516,0.0003140882,0.0007941991,0.00012617458,0.003758441],"study_design_scores_gemma":[0.000012052817,0.000022128032,0.0009011175,0.0000019903018,0.0000043072478,0.0000066671696,0.000043761807,0.99833614,0.00012696467,0.0004964479,0.000045542067,0.0000030672152],"about_ca_topic_score_codex":0.04355224,"about_ca_topic_score_gemma":0.03370496,"teacher_disagreement_score":0.04355224,"about_ca_system_score_codex":0.0037335984,"about_ca_system_score_gemma":0.0036073115,"threshold_uncertainty_score":0.0865975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002823699,0.00015740475,0.99087054,0.00020356326,0.00007024688,0.000020725685,0.000023998347,0.00003381719,0.005796012],"genre_scores_gemma":[0.28584182,0.0011513821,0.68894774,0.00035681098,0.00030837176,0.00036151533,0.00029255124,0.00028553675,0.02245424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996087,0.00013586145,0.000013529056,0.00006564764,0.00014153775,0.00003463256],"domain_scores_gemma":[0.99937195,0.00040237058,0.000044963366,0.000034451376,0.00011649248,0.000029815803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082702364,0.0012062076,0.0011621509,0.0010864773,0.0005539997,0.0015390033,0.0014255084,0.0018517995,0.004115601],"category_scores_gemma":[0.002620292,0.0008635593,0.001674373,0.0009348481,0.0012238288,0.0013238443,0.001941026,0.0025757991,0.0005149522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020000745,0.000043123317,0.00013372001,0.000102193815,0.000030133104,0.000076224285,0.00007202922,0.9024287,0.001260453,0.07761613,0.001171997,0.01704533],"study_design_scores_gemma":[0.0000039865563,0.000013060051,0.000024270561,0.000009231899,0.0000063617317,0.000019998013,0.000012552161,0.98069394,0.00013255366,0.017941644,0.0011361284,0.000006288335],"about_ca_topic_score_codex":0.0055895196,"about_ca_topic_score_gemma":0.004034591,"teacher_disagreement_score":0.0055895196,"about_ca_system_score_codex":0.0008448307,"about_ca_system_score_gemma":0.0015509827,"threshold_uncertainty_score":0.013768077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002334697,0.000055862627,0.9955895,0.000048270485,0.000018247354,0.000020327565,0.000021649768,0.00008188971,0.001829598],"genre_scores_gemma":[0.71127856,0.0005106549,0.27875173,0.00029894718,0.00017536314,0.00047448507,0.00019023346,0.00059262547,0.007727462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964474,0.0017532973,0.00014243477,0.0004120502,0.0010035334,0.00024139966],"domain_scores_gemma":[0.99524444,0.0032656167,0.00036085516,0.0005703182,0.0004945408,0.00006419055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051564276,0.001694558,0.0019222604,0.0024526792,0.0004985803,0.0017656427,0.0015797361,0.0011608038,0.0048219813],"category_scores_gemma":[0.01160982,0.00069809135,0.0028466661,0.00188975,0.0016519994,0.00233754,0.0035904779,0.0018289611,0.00038993344],"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.00006561701,0.000040713086,0.00026879786,0.00013111698,0.00018436155,0.00009977508,0.000057751833,0.880849,0.005130129,0.078537546,0.0005814825,0.03405366],"study_design_scores_gemma":[0.000007232246,0.000083180785,0.00019981663,0.000014688372,0.000053938635,0.000038071426,0.00001518717,0.95347345,0.0017314118,0.043477893,0.00088581594,0.000019284169],"about_ca_topic_score_codex":0.0012186981,"about_ca_topic_score_gemma":0.0007279488,"teacher_disagreement_score":0.0051564276,"about_ca_system_score_codex":0.00077649124,"about_ca_system_score_gemma":0.0009928534,"threshold_uncertainty_score":0.027270138},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46649942,0.001338031,0.5107966,0.0027886892,0.00021077602,0.00008664935,0.0004463831,0.000393724,0.017439786],"genre_scores_gemma":[0.98784536,0.00015645454,0.0074494253,0.00004395341,0.000049668277,0.000023567301,0.00007119023,0.00002124919,0.0043390947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999426,0.00021241182,0.000027001422,0.00012355015,0.0000853313,0.00012574065],"domain_scores_gemma":[0.99761534,0.0015813116,0.0002206429,0.0001699224,0.00017197721,0.00024088552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018510048,0.0006394537,0.0015034125,0.00057551,0.00035390983,0.0017865449,0.0008788631,0.0018360986,0.0032845344],"category_scores_gemma":[0.008422036,0.00052596495,0.0004534435,0.00041788383,0.00077410456,0.0019556873,0.0014297297,0.0011394856,0.00024720246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047166512,0.00014682686,0.0022189475,0.00010484171,0.00009079369,0.0001992031,0.00012546856,0.83652663,0.002357762,0.1171562,0.0032280511,0.037373625],"study_design_scores_gemma":[0.000037725677,0.00009334034,0.0007264852,0.000014105609,0.000026295158,0.00006469025,0.000040534662,0.93286526,0.00027935064,0.06517501,0.00066141336,0.000015724274],"about_ca_topic_score_codex":0.0016057388,"about_ca_topic_score_gemma":0.0007407417,"teacher_disagreement_score":0.0032845344,"about_ca_system_score_codex":0.0010523138,"about_ca_system_score_gemma":0.0010910258,"threshold_uncertainty_score":0.010987878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044708624,0.00021513666,0.8851653,0.0009216686,0.0002726508,0.0001550294,0.000112099035,0.0001612406,0.068288185],"genre_scores_gemma":[0.76794016,0.00048806492,0.19323313,0.00019480898,0.00018339745,0.00018881822,0.00012272396,0.00014968908,0.037499234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939895,0.00028902185,0.000010784719,0.000057090947,0.00013598279,0.00010820256],"domain_scores_gemma":[0.9995695,0.00014524492,0.000035028937,0.000028216284,0.00016814242,0.000053941647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000812059,0.00070691976,0.00036199845,0.00055507006,0.00085704937,0.0017759621,0.001513457,0.001318791,0.009062892],"category_scores_gemma":[0.0014864327,0.0003830965,0.00073314173,0.00072946196,0.0006377763,0.0011552701,0.00081104937,0.00082908705,0.00080289034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121078716,0.00010741691,0.00038139988,0.000076044205,0.000018292289,0.00036031991,0.00013451902,0.7634229,0.0053307316,0.19958563,0.0041237986,0.026337842],"study_design_scores_gemma":[0.000018023016,0.00010388675,0.00014308629,0.000015182458,0.000018625155,0.00009591164,0.00012554099,0.96461487,0.00095019466,0.028019445,0.005882174,0.000013066348],"about_ca_topic_score_codex":0.006521631,"about_ca_topic_score_gemma":0.011803217,"teacher_disagreement_score":0.009062892,"about_ca_system_score_codex":0.0014574219,"about_ca_system_score_gemma":0.0013903143,"threshold_uncertainty_score":0.03031838},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006792293,0.00008226477,0.9898812,0.000092656446,0.0000347982,0.00011330841,0.00004416749,0.0002596318,0.0026996033],"genre_scores_gemma":[0.21604641,0.00012553089,0.7798139,0.00010998352,0.000042053714,0.00063696125,0.0001859754,0.00015047209,0.0028885957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920255,0.0003216633,0.000034222485,0.000113765745,0.00019411596,0.00013375803],"domain_scores_gemma":[0.99849164,0.0009815982,0.00007845423,0.00007163921,0.0002826113,0.000094049494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017137604,0.0012839589,0.0024442459,0.0012193222,0.0010063598,0.0016994252,0.0025933897,0.0029447135,0.0059603797],"category_scores_gemma":[0.004072344,0.0014869034,0.0014923598,0.0013827533,0.0009030518,0.0013763005,0.0020145369,0.002154069,0.0008463032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007045972,0.000080191356,0.00017316263,0.00008274811,0.000025372443,0.000051104635,0.000055627348,0.9610483,0.000700838,0.005863027,0.0007734264,0.031075714],"study_design_scores_gemma":[0.000016877855,0.000017427805,0.000021774558,0.000004244944,0.0000048375887,0.0000061707287,0.0000065386434,0.9983569,0.000105643354,0.0012498628,0.00020535199,0.000004456132],"about_ca_topic_score_codex":0.0140565485,"about_ca_topic_score_gemma":0.011223962,"teacher_disagreement_score":0.0140565485,"about_ca_system_score_codex":0.0013711047,"about_ca_system_score_gemma":0.0036383541,"threshold_uncertainty_score":0.027949512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34586206,0.0012456796,0.6440758,0.00058172183,0.00013366077,0.00020642525,0.00045592454,0.0005007303,0.006937967],"genre_scores_gemma":[0.8434458,0.00030236781,0.15091313,0.00008084847,0.00004059188,0.00019016225,0.00033257555,0.0000711977,0.0046233144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940085,0.00023104003,0.00002337192,0.0001603175,0.00008205368,0.00010233105],"domain_scores_gemma":[0.9989619,0.0006343901,0.00016335565,0.00006307521,0.00008447329,0.00009277823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009643101,0.0012907179,0.0019361483,0.0007109864,0.0007335002,0.0011631304,0.0016481802,0.0017952473,0.0031922932],"category_scores_gemma":[0.001959178,0.0010451623,0.0013734056,0.0012387442,0.00082720653,0.0011831755,0.0008467662,0.0011371417,0.0003659863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036259655,0.000025583462,0.00023645912,0.00002018433,0.000015101268,0.000040176106,0.000010024705,0.9965063,0.00019646215,0.00072305236,0.0001162736,0.002074118],"study_design_scores_gemma":[0.000010432251,0.000027142834,0.00011600901,0.0000022162392,0.0000041350495,0.0000065629433,0.000011436178,0.9990318,0.00009180508,0.00053190475,0.00016366525,0.0000028825182],"about_ca_topic_score_codex":0.014602367,"about_ca_topic_score_gemma":0.009940421,"teacher_disagreement_score":0.014602367,"about_ca_system_score_codex":0.001224175,"about_ca_system_score_gemma":0.0012590507,"threshold_uncertainty_score":0.029034734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7243712,0.0011873851,0.15714395,0.014892136,0.00091637176,0.0016251314,0.000731517,0.0011146953,0.09801762],"genre_scores_gemma":[0.9897792,0.0000856628,0.004615038,0.00041355717,0.00007688598,0.00008313055,0.000036320445,0.000017033784,0.0048932103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640995,0.0012703922,0.00011275866,0.00051843317,0.00061432796,0.0010742154],"domain_scores_gemma":[0.99363774,0.0032823235,0.00077161903,0.00040572588,0.0011243765,0.00077822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050800177,0.00068356714,0.0012479816,0.001417917,0.0015746781,0.0050646216,0.0025173547,0.0061492957,0.0063038897],"category_scores_gemma":[0.015372701,0.0007436805,0.0009174179,0.00060502446,0.0014049166,0.003260913,0.0018516214,0.0033811696,0.0003489722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015394036,0.002372623,0.019672953,0.0004756804,0.00026327188,0.0018625134,0.00076876645,0.46029893,0.010331744,0.36510673,0.036054675,0.101252764],"study_design_scores_gemma":[0.00047628244,0.001369615,0.023583436,0.00029414787,0.00040830384,0.00047686236,0.0018604234,0.82735777,0.0033750394,0.11368637,0.026963422,0.0001482838],"about_ca_topic_score_codex":0.011957447,"about_ca_topic_score_gemma":0.011697011,"teacher_disagreement_score":0.011957447,"about_ca_system_score_codex":0.0046102023,"about_ca_system_score_gemma":0.008392854,"threshold_uncertainty_score":0.03344947},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038441357,0.00032264934,0.9936572,0.00016433334,0.000024266112,0.00019129709,0.00010118366,0.00011124377,0.0015837828],"genre_scores_gemma":[0.16117144,0.0008369751,0.83257395,0.00019486317,0.00014722602,0.0011724757,0.00063975423,0.00026790876,0.0029953383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9847478,0.008867545,0.0008792278,0.0011109761,0.0035963438,0.0007979785],"domain_scores_gemma":[0.9583058,0.032271966,0.002242075,0.0023676832,0.004270357,0.000542203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020926742,0.0032493297,0.0058562565,0.011709282,0.0014857139,0.006780427,0.003414226,0.0032117867,0.0060886247],"category_scores_gemma":[0.050337628,0.0017403506,0.003864237,0.0092286775,0.0026285406,0.004903823,0.0034210274,0.0049872743,0.001243529],"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.00013233739,0.00029595083,0.0015493433,0.00043876457,0.00038911187,0.000057852034,0.00014386488,0.63614136,0.0016002802,0.14583188,0.002913338,0.21050586],"study_design_scores_gemma":[0.000041292646,0.00014416497,0.00078376755,0.00013203028,0.00007767428,0.000048722515,0.000092506445,0.8753527,0.0019716143,0.11883889,0.0024484927,0.00006823894],"about_ca_topic_score_codex":0.004955142,"about_ca_topic_score_gemma":0.006479346,"teacher_disagreement_score":0.020926742,"about_ca_system_score_codex":0.0031483725,"about_ca_system_score_gemma":0.007219139,"threshold_uncertainty_score":0.11067253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987938,0.00008450207,0.0007026816,0.0042984798,0.00001994577,0.000009658914,0.0001403207,0.0000071107575,0.0067994674],"genre_scores_gemma":[0.99952507,0.0000140505235,0.000054708682,0.00003413934,0.000007827957,0.0000011681283,0.00001768142,8.7848446e-7,0.0003444067],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872655,0.0003774571,0.0000675705,0.0002260523,0.0001445805,0.00045777622],"domain_scores_gemma":[0.9731958,0.018345328,0.004204514,0.00041178643,0.0012722566,0.0025704717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021161807,0.00018238001,0.00055500417,0.00038844402,0.0010695073,0.0036248202,0.001399893,0.0030699333,0.014607905],"category_scores_gemma":[0.022474756,0.00030314215,0.0002511705,0.00048543268,0.0014434576,0.002770095,0.001502915,0.0025058864,0.00047778437],"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.004540885,0.0022413807,0.7716738,0.00022943356,0.00021409188,0.010406047,0.004121441,0.07270291,0.007041376,0.07932232,0.0077287788,0.039777547],"study_design_scores_gemma":[0.0003001273,0.0011752656,0.5712974,0.000084166,0.00021809193,0.0017731348,0.043056574,0.25802782,0.0022317835,0.118135385,0.0035413539,0.00015894558],"about_ca_topic_score_codex":0.0114503065,"about_ca_topic_score_gemma":0.013306854,"teacher_disagreement_score":0.014607905,"about_ca_system_score_codex":0.0016498687,"about_ca_system_score_gemma":0.0014619158,"threshold_uncertainty_score":0.0488683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9605908,0.00049391045,0.031496916,0.0010764258,0.000043225587,0.000036475452,0.00018334932,0.00007955757,0.005999359],"genre_scores_gemma":[0.9977138,0.000102354716,0.00037931954,0.000018202163,0.000014635478,0.000006570663,0.000046752306,0.0000053700765,0.0017129931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997497,0.00007500663,0.000009976936,0.00003986712,0.000033224056,0.00009215343],"domain_scores_gemma":[0.9963811,0.0019223547,0.0006615478,0.00016063568,0.0003106147,0.00056377775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012663847,0.00035481653,0.0005087221,0.0010982063,0.00054081384,0.001469974,0.0008329152,0.0012935281,0.0050081215],"category_scores_gemma":[0.0062299096,0.00022299391,0.0005378779,0.0005607148,0.00094370695,0.0016188156,0.0010468405,0.0011123986,0.00023257594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062688376,0.00025925363,0.043899164,0.00010507336,0.00019937365,0.0016995235,0.00068130053,0.67090535,0.007866435,0.2528171,0.004161868,0.016778732],"study_design_scores_gemma":[0.000014284682,0.000070549846,0.007687244,0.000012000228,0.00005154448,0.00016095789,0.000301765,0.9609771,0.0004043426,0.029905865,0.00039620342,0.000018085588],"about_ca_topic_score_codex":0.0051904833,"about_ca_topic_score_gemma":0.0020190745,"teacher_disagreement_score":0.0051904833,"about_ca_system_score_codex":0.0010247119,"about_ca_system_score_gemma":0.0004747158,"threshold_uncertainty_score":0.016753852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19066487,0.000731373,0.80236125,0.0011355914,0.00008146553,0.00008681683,0.00077706226,0.0008744307,0.0032871931],"genre_scores_gemma":[0.96300274,0.00028224138,0.031824414,0.0002165921,0.00005164816,0.00007760053,0.0008736074,0.000034876044,0.0036363013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967706,0.000097470496,0.000020487822,0.00009618916,0.000049590257,0.000059273872],"domain_scores_gemma":[0.9989011,0.0007163228,0.00009063648,0.000045024506,0.00018048387,0.000066346234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017903986,0.0006501398,0.00095660426,0.0008259325,0.00024751638,0.00096120656,0.0016716564,0.0012010542,0.0027770293],"category_scores_gemma":[0.003427851,0.00037883647,0.00063802407,0.00074566685,0.0005489151,0.0018682755,0.00089055713,0.0019256163,0.0005808029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039270084,0.00018657692,0.005884079,0.00007535543,0.000071814735,0.0001368993,0.000096126234,0.89119565,0.0018167569,0.01780922,0.0028279854,0.07950685],"study_design_scores_gemma":[0.0000040631926,0.000008320482,0.00010854962,0.0000018777936,0.0000032273228,0.000004863061,0.000002296709,0.99740976,0.0000722137,0.002337505,0.00004565838,0.000001712693],"about_ca_topic_score_codex":0.0059858826,"about_ca_topic_score_gemma":0.005951524,"teacher_disagreement_score":0.0059858826,"about_ca_system_score_codex":0.0009508709,"about_ca_system_score_gemma":0.00083203346,"threshold_uncertainty_score":0.011902094},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21280947,0.0004530301,0.74975556,0.00285265,0.00011675801,0.00016666458,0.0006290594,0.00033137313,0.03288539],"genre_scores_gemma":[0.95582134,0.0003204363,0.03153592,0.0002148146,0.000057284356,0.00019378807,0.00027386757,0.00010588666,0.011476621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978161,0.0012519975,0.00006158491,0.00037518077,0.00021741904,0.000277718],"domain_scores_gemma":[0.9864016,0.010802979,0.00095106056,0.0005481066,0.00058881484,0.0007075225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002846616,0.0010675717,0.0022730574,0.0019401577,0.001573823,0.0041621807,0.0027167317,0.002977032,0.014770799],"category_scores_gemma":[0.017005656,0.0007962055,0.0015820814,0.0020036278,0.0040594954,0.006111295,0.002643381,0.0035433755,0.0012932689],"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.000252063,0.000103082464,0.00062582607,0.000113594426,0.00007983644,0.0001512317,0.00032861443,0.2159682,0.00070072425,0.7719551,0.0019298772,0.0077919196],"study_design_scores_gemma":[0.000053003852,0.00002719131,0.00012515507,0.000012057467,0.000018780718,0.000025160252,0.00007723725,0.3539273,0.00011295955,0.64509416,0.00050466077,0.000022185684],"about_ca_topic_score_codex":0.008116842,"about_ca_topic_score_gemma":0.0056658634,"teacher_disagreement_score":0.014770799,"about_ca_system_score_codex":0.002453608,"about_ca_system_score_gemma":0.0020508235,"threshold_uncertainty_score":0.049413264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028801246,0.00016427554,0.995262,0.00012141172,0.00006388267,0.00003486535,0.0000505446,0.00021616029,0.0012066137],"genre_scores_gemma":[0.11791196,0.00037332147,0.8757258,0.00017353165,0.00013976183,0.00040118367,0.00039912638,0.00025725263,0.0046180566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993899,0.00022081162,0.0000311551,0.00007454835,0.00022175854,0.00006178443],"domain_scores_gemma":[0.99902415,0.0004953313,0.00006255,0.00014010195,0.00021532849,0.00006255871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012500611,0.0013390746,0.0017936263,0.0006099595,0.0005368507,0.0009939276,0.001404189,0.0012992537,0.004009109],"category_scores_gemma":[0.0027338266,0.0007383821,0.00086176244,0.0011348553,0.0007732147,0.0012823585,0.0019795585,0.0024456216,0.0012358932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040161773,0.0002396089,0.00038660754,0.00029295168,0.00014212476,0.0001457835,0.00010665423,0.74267745,0.008718835,0.045923177,0.013567585,0.18739758],"study_design_scores_gemma":[0.00002243868,0.000019756151,0.000031487136,0.0000031900447,0.0000046589557,0.000014165373,0.000004741752,0.99450487,0.00048891077,0.0041472586,0.00075471896,0.0000037728548],"about_ca_topic_score_codex":0.005348631,"about_ca_topic_score_gemma":0.0060423533,"teacher_disagreement_score":0.005348631,"about_ca_system_score_codex":0.00063771405,"about_ca_system_score_gemma":0.002339301,"threshold_uncertainty_score":0.01341176},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18138678,0.00061432767,0.79852986,0.0012128602,0.00009990239,0.00010125368,0.00041159173,0.00022164125,0.017421728],"genre_scores_gemma":[0.9026944,0.00042999635,0.09030206,0.00012057769,0.00011061814,0.000096641605,0.00035579276,0.0001052245,0.0057847793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983779,0.00073723635,0.00008396999,0.00018105372,0.0004116995,0.00020813337],"domain_scores_gemma":[0.9900567,0.0068063857,0.00087964657,0.001021458,0.0007117966,0.0005239897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040465416,0.0007349723,0.001380153,0.0008231708,0.0003665092,0.0024290022,0.0016951164,0.001378962,0.0052764616],"category_scores_gemma":[0.027890535,0.00065485516,0.0005121605,0.0010553463,0.00090373354,0.0030962906,0.0027183793,0.0016482585,0.0004710444],"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.0006452523,0.00013158307,0.0021603364,0.00014365307,0.000066851026,0.00023851465,0.00007060936,0.72651774,0.0031263363,0.20500328,0.0028271165,0.059068706],"study_design_scores_gemma":[0.000054946166,0.000096669704,0.00051108486,0.000035399633,0.000020490394,0.00011642712,0.000021473503,0.8842786,0.0011927767,0.11280245,0.00085472333,0.000015025773],"about_ca_topic_score_codex":0.00069134944,"about_ca_topic_score_gemma":0.0003993996,"teacher_disagreement_score":0.0052764616,"about_ca_system_score_codex":0.0008689736,"about_ca_system_score_gemma":0.0010988405,"threshold_uncertainty_score":0.021400452},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006356324,0.00025005534,0.989267,0.00023092816,0.000079124664,0.00011578966,0.00011738605,0.00053836184,0.0030451068],"genre_scores_gemma":[0.051042765,0.0002716659,0.9443787,0.00011317961,0.000062807136,0.00032445262,0.00038079853,0.00021780994,0.003207771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994351,0.00016388067,0.000025772839,0.0000948445,0.00019036904,0.00008999784],"domain_scores_gemma":[0.9986602,0.00092080137,0.000062615705,0.00005788091,0.00020896741,0.000089599416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011228278,0.0015370387,0.002137789,0.0013755405,0.0010833653,0.0015952059,0.001892306,0.0028057005,0.0107866945],"category_scores_gemma":[0.002953763,0.0011508398,0.0010816735,0.0023578317,0.00071456376,0.001721191,0.0016735874,0.0026835944,0.0016269021],"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.0002060543,0.00026596276,0.00037974044,0.0001747898,0.00006628746,0.00009264956,0.00008473703,0.7084747,0.0025100328,0.013301311,0.007871174,0.26657256],"study_design_scores_gemma":[0.000056360845,0.000045045308,0.00006854462,0.0000124958615,0.000011975326,0.000021098725,0.000014923217,0.9925175,0.00031649886,0.0058944905,0.0010336859,0.000007405339],"about_ca_topic_score_codex":0.009892887,"about_ca_topic_score_gemma":0.009137001,"teacher_disagreement_score":0.0107866945,"about_ca_system_score_codex":0.0011465609,"about_ca_system_score_gemma":0.0029139263,"threshold_uncertainty_score":0.03608507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009993426,0.00035816975,0.9883167,0.00024332546,0.00007660541,0.000027395892,0.00005672437,0.00020989012,0.00071783544],"genre_scores_gemma":[0.5437192,0.000636257,0.44426584,0.00045643264,0.00036433645,0.00033802184,0.0007160776,0.00026081497,0.009243021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995209,0.00016346625,0.00003203874,0.00011108386,0.00009570521,0.00007682807],"domain_scores_gemma":[0.9971125,0.0020771718,0.00013969312,0.0001283834,0.00041049984,0.00013181251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022716194,0.00092421257,0.002116083,0.000719183,0.00047434375,0.0014227661,0.0023075808,0.0025880125,0.004617403],"category_scores_gemma":[0.005465795,0.0011974444,0.0010488573,0.0008598206,0.00069823966,0.0018628228,0.0020050511,0.0030573036,0.0005917673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015426987,0.00015112206,0.00072704465,0.00013545372,0.00012650393,0.00012314842,0.00006157495,0.89221585,0.0013331383,0.017977675,0.0023729263,0.084621266],"study_design_scores_gemma":[0.0000047224908,0.00000548027,0.00001758206,0.0000025785646,0.0000032471478,0.000002794924,0.0000011600541,0.9983524,0.000049781476,0.0014776016,0.000080679725,0.0000018950708],"about_ca_topic_score_codex":0.0069649005,"about_ca_topic_score_gemma":0.0075311433,"teacher_disagreement_score":0.0069649005,"about_ca_system_score_codex":0.0007713612,"about_ca_system_score_gemma":0.0020941782,"threshold_uncertainty_score":0.0154467225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95453304,0.00029584335,0.019322045,0.004703493,0.00013601703,0.00012242963,0.0002421459,0.0002887367,0.020356266],"genre_scores_gemma":[0.99624985,0.000044101016,0.0008635882,0.000096880074,0.00002500775,0.000006360841,0.000044577395,0.0000070356336,0.0026625502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732745,0.0007306689,0.00015280783,0.00040368765,0.0007178839,0.0006676065],"domain_scores_gemma":[0.98072386,0.011421632,0.0028079695,0.0018762941,0.0016449275,0.0015253181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028344495,0.00036142103,0.00061033573,0.0010967212,0.002485605,0.0044024214,0.0011130287,0.005089201,0.009200676],"category_scores_gemma":[0.016731402,0.0004440552,0.0006020287,0.0016250878,0.0020349612,0.004992085,0.0023099005,0.0024649948,0.00075738673],"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.0062799463,0.0026759002,0.15306391,0.00043212916,0.00031297948,0.051258348,0.0049642515,0.4068003,0.012630304,0.24447544,0.031122532,0.085983954],"study_design_scores_gemma":[0.00026423048,0.00071996974,0.013056286,0.00007739766,0.00015181962,0.006343125,0.0028712668,0.860018,0.0046720514,0.105950326,0.0056971684,0.0001782833],"about_ca_topic_score_codex":0.0056011747,"about_ca_topic_score_gemma":0.0023739485,"teacher_disagreement_score":0.009200676,"about_ca_system_score_codex":0.0014349867,"about_ca_system_score_gemma":0.0017366358,"threshold_uncertainty_score":0.030779302},"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":"review","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026449794,0.98167497,0.015941946,0.0005771483,0.00014625643,0.000029881883,0.000054916345,0.000027537093,0.001282931],"genre_scores_gemma":[0.0046236035,0.978211,0.01600933,0.0002924442,0.000341433,0.00008774723,0.0000906305,0.000027793736,0.000316153],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99679047,0.0015073786,0.00040756573,0.0005108764,0.0007087022,0.00007502843],"domain_scores_gemma":[0.96094203,0.03579807,0.0009801999,0.0005665641,0.0015725386,0.00014047674],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008849651,0.0018833714,0.0032215777,0.004366267,0.00040233295,0.002152735,0.0022234544,0.0022568344,0.004758121],"category_scores_gemma":[0.026180651,0.0009445966,0.0024618767,0.0072745834,0.0013918842,0.002523267,0.0009948722,0.0022079782,0.0013849094],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012719778,0.00012294805,0.00087598554,0.05122312,0.00077430304,0.00008339353,0.00016431694,0.0069301524,0.000290272,0.04422628,0.01042051,0.8847615],"study_design_scores_gemma":[0.00021120654,0.00075176946,0.00820533,0.06276422,0.0043137134,0.0017010986,0.00055528694,0.022193586,0.002041694,0.14630911,0.7506008,0.00035203891],"about_ca_topic_score_codex":0.003408259,"about_ca_topic_score_gemma":0.0028393408,"teacher_disagreement_score":0.9911504,"about_ca_system_score_codex":0.0014785103,"about_ca_system_score_gemma":0.0034136125,"threshold_uncertainty_score":0.046801984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006101746,0.00013909093,0.99133927,0.00008485658,0.000097824624,0.000063563675,0.000033770197,0.00024803873,0.0018918053],"genre_scores_gemma":[0.033972315,0.00020140372,0.9630219,0.000043673863,0.00005242613,0.00019103341,0.00010092399,0.000102320126,0.0023141117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955684,0.00007440254,0.000028967834,0.00009960605,0.00019179603,0.00004836325],"domain_scores_gemma":[0.99953616,0.00019997326,0.0000428729,0.000070831215,0.00011956914,0.000030622206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006089302,0.0011717421,0.0012043908,0.000989493,0.0008828238,0.0010367394,0.0018619604,0.0016253012,0.005821248],"category_scores_gemma":[0.001445331,0.001095285,0.001624093,0.002169349,0.0006821316,0.0013073911,0.0011185218,0.0017882559,0.0010369705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061542384,0.00034345442,0.00056416355,0.00039294604,0.00013077413,0.00038138777,0.00018201013,0.50291055,0.032920666,0.04006752,0.009060092,0.41243112],"study_design_scores_gemma":[0.00010460639,0.00015000487,0.00022890228,0.000013625737,0.000034636352,0.00019475528,0.000025542193,0.98137707,0.0037744434,0.009607584,0.0044574374,0.000031249943],"about_ca_topic_score_codex":0.004571991,"about_ca_topic_score_gemma":0.0034204535,"teacher_disagreement_score":0.005821248,"about_ca_system_score_codex":0.0006976231,"about_ca_system_score_gemma":0.0013684422,"threshold_uncertainty_score":0.01947403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19877164,0.0005083582,0.7787923,0.0011739146,0.00012330398,0.00025971452,0.00045922695,0.0010414858,0.018870037],"genre_scores_gemma":[0.77690655,0.0003400395,0.21495406,0.00017102972,0.00006854697,0.00022501808,0.00080035615,0.00031447792,0.0062199594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979494,0.0008250586,0.000114659575,0.0004084671,0.0002896278,0.00041275143],"domain_scores_gemma":[0.9883463,0.010087323,0.0004469713,0.00031072402,0.00042946293,0.00037923723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002815601,0.0016992893,0.0019661065,0.001884807,0.0012112926,0.004814822,0.002219356,0.0017580546,0.011172077],"category_scores_gemma":[0.018040828,0.0010505185,0.0015007134,0.0013508069,0.0017999181,0.004528479,0.002363368,0.0031404046,0.0012081699],"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.0011231934,0.0008326444,0.0037041833,0.00052428077,0.00019456279,0.00023088715,0.00061702373,0.61901355,0.0027164905,0.27259183,0.0052482756,0.09320309],"study_design_scores_gemma":[0.00010019566,0.00009297709,0.00018637929,0.00005244761,0.00003455775,0.00003255034,0.0001760959,0.7080939,0.0013243633,0.28921914,0.00067183725,0.000015506472],"about_ca_topic_score_codex":0.0033270924,"about_ca_topic_score_gemma":0.0038781033,"teacher_disagreement_score":0.011172077,"about_ca_system_score_codex":0.0018724218,"about_ca_system_score_gemma":0.0017367641,"threshold_uncertainty_score":0.037374377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011831924,0.0006652802,0.98045224,0.00093341817,0.000055192733,0.00006909811,0.000069893285,0.000067368135,0.0058555296],"genre_scores_gemma":[0.65504074,0.0014474913,0.32640675,0.00047389412,0.00023005836,0.00055013876,0.0001566873,0.00020564048,0.015488621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974826,0.0014351896,0.00008343025,0.00032622702,0.00042480763,0.00024771792],"domain_scores_gemma":[0.99611425,0.0028539514,0.00025244924,0.00016657193,0.00037271684,0.00024005695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075736344,0.0018105169,0.0021686535,0.0011707396,0.0006705882,0.0023319863,0.0020011321,0.0024733548,0.0051708505],"category_scores_gemma":[0.013161864,0.0011198102,0.0017887343,0.0006260089,0.0020968963,0.0032761747,0.0022573886,0.00319839,0.00050544087],"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.00010727556,0.0001005286,0.0005879674,0.00017877531,0.00008175513,0.00015737044,0.00018897891,0.5736761,0.0016444592,0.40130535,0.0016699844,0.020301443],"study_design_scores_gemma":[0.000029476463,0.00009784336,0.0002946038,0.000057507517,0.000028964952,0.00006670353,0.000037841924,0.8626911,0.00053699425,0.13412547,0.0020038462,0.000029677183],"about_ca_topic_score_codex":0.0022766122,"about_ca_topic_score_gemma":0.0012696976,"teacher_disagreement_score":0.0075736344,"about_ca_system_score_codex":0.002924459,"about_ca_system_score_gemma":0.0030483014,"threshold_uncertainty_score":0.040053666},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10654843,0.00035670484,0.8902923,0.00026792302,0.00001822302,0.000029588387,0.0006375897,0.00032521354,0.001524046],"genre_scores_gemma":[0.9374734,0.0003621026,0.058022372,0.000044662607,0.00003267427,0.00007578304,0.0012182895,0.0000827101,0.002688038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998816,0.0007884058,0.000051491865,0.00015104582,0.00009428808,0.00009884831],"domain_scores_gemma":[0.98868793,0.00912198,0.00080291834,0.0007894675,0.00046057816,0.00013717724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026603811,0.00060688553,0.001418499,0.0008900622,0.0002492071,0.0017501626,0.0014160372,0.0010480687,0.00299221],"category_scores_gemma":[0.014096949,0.0009002953,0.0013657153,0.0011942288,0.00053800765,0.0015266489,0.0015497797,0.0011691783,0.00047676466],"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.00004789206,0.00003378051,0.002431262,0.00005332478,0.00012347879,0.00006427855,0.000050974464,0.9655523,0.00032897515,0.0201952,0.00057712995,0.010541385],"study_design_scores_gemma":[0.000004435979,0.0000075875846,0.00050487387,0.000005342006,0.000010460187,0.000009067952,0.0000112586,0.9907358,0.000083296094,0.008478488,0.0001440639,0.0000052981704],"about_ca_topic_score_codex":0.0068909694,"about_ca_topic_score_gemma":0.006466182,"teacher_disagreement_score":0.0068909694,"about_ca_system_score_codex":0.00045437718,"about_ca_system_score_gemma":0.00097559445,"threshold_uncertainty_score":0.014069617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7819869,0.00013239421,0.13586096,0.0027058239,0.00026068016,0.0012234898,0.0005594913,0.005617832,0.07165248],"genre_scores_gemma":[0.86798704,0.000055966884,0.05560622,0.0003682754,0.00008886841,0.000114070346,0.0003410559,0.00032593944,0.07511249],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988009,0.00023260979,0.00005116947,0.0002905064,0.0003332884,0.00029150967],"domain_scores_gemma":[0.99667966,0.0008978203,0.00012198512,0.0010514547,0.0007891797,0.0004599499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025129511,0.000427755,0.00062807696,0.0007930324,0.0028559677,0.0033082298,0.0015286548,0.002917267,0.049963433],"category_scores_gemma":[0.0034770477,0.00045495734,0.0010214979,0.0010098981,0.0007237114,0.0033340205,0.002604025,0.0014344861,0.009051508],"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.011504306,0.014684954,0.055201,0.00035294794,0.00015362717,0.00885608,0.0039249663,0.041113425,0.13480397,0.050591957,0.047192365,0.6316204],"study_design_scores_gemma":[0.0011527028,0.003982527,0.020855093,0.00015146207,0.00029301687,0.002886393,0.0042640674,0.7943137,0.06645154,0.029953126,0.07534975,0.00034664426],"about_ca_topic_score_codex":0.0050543863,"about_ca_topic_score_gemma":0.004448876,"teacher_disagreement_score":0.049963433,"about_ca_system_score_codex":0.0013946587,"about_ca_system_score_gemma":0.0019656443,"threshold_uncertainty_score":0.1671443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1365489,0.0015777124,0.8536655,0.0009881054,0.00012541727,0.00013993321,0.00020327994,0.00017568488,0.006575407],"genre_scores_gemma":[0.8460508,0.00053216354,0.14325252,0.000135182,0.00008818021,0.00024372312,0.00029765253,0.0000854976,0.009314363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994555,0.00034875487,0.000016886072,0.00006660773,0.0000652561,0.00004687025],"domain_scores_gemma":[0.99636286,0.003070619,0.00018024271,0.0000624641,0.0001570455,0.00016674068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018274271,0.00069231103,0.001538125,0.0008809894,0.00059426326,0.0007887566,0.0016262989,0.0011711625,0.002931326],"category_scores_gemma":[0.005301641,0.0005639999,0.00063614605,0.00083872234,0.00088125595,0.0015920291,0.0011204429,0.00082670414,0.00016209944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002420604,0.00013741599,0.0005762948,0.00009602784,0.000046009896,0.000050437953,0.00003690989,0.9670158,0.0003765279,0.015596768,0.0017601949,0.014065594],"study_design_scores_gemma":[0.000014994878,0.00002728624,0.000049356673,0.0000026563243,0.0000040576797,0.000005283487,0.000007908613,0.99569356,0.000031316544,0.004043555,0.0001175848,0.0000024150565],"about_ca_topic_score_codex":0.0058090524,"about_ca_topic_score_gemma":0.0060740006,"teacher_disagreement_score":0.0058090524,"about_ca_system_score_codex":0.00081122486,"about_ca_system_score_gemma":0.0010628722,"threshold_uncertainty_score":0.0115504265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11793675,0.0010744492,0.87490714,0.0009359824,0.00018317766,0.00010665823,0.00039163447,0.00019533481,0.0042687817],"genre_scores_gemma":[0.9020726,0.0010247475,0.089856915,0.00011126865,0.0002284642,0.00011602695,0.0003828895,0.00014267449,0.006064386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982869,0.00062746473,0.000087017164,0.0003390949,0.00038907814,0.00027055058],"domain_scores_gemma":[0.9937191,0.004730505,0.00069858006,0.00024850352,0.00035934502,0.00024402613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003051912,0.0009944182,0.002664044,0.0011879088,0.0009095451,0.0028279342,0.0016959114,0.0017346911,0.0025952563],"category_scores_gemma":[0.0127245225,0.0014441092,0.0010263338,0.00393784,0.0016321711,0.003188246,0.0015069118,0.0018385086,0.0002657849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010103241,0.000018690222,0.00015513746,0.000034347217,0.000018258152,0.00004114063,0.000027187085,0.9823041,0.0002487198,0.012012443,0.00027009612,0.004768814],"study_design_scores_gemma":[0.000009182967,0.000012010017,0.00008008713,0.0000025688466,0.0000046634977,0.000008383167,0.0000075351477,0.98415726,0.00009139768,0.015474381,0.00014814567,0.000004307428],"about_ca_topic_score_codex":0.009600847,"about_ca_topic_score_gemma":0.0042997147,"teacher_disagreement_score":0.009600847,"about_ca_system_score_codex":0.002601574,"about_ca_system_score_gemma":0.0021320384,"threshold_uncertainty_score":0.019089937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18886958,0.0005549479,0.73626226,0.0050657406,0.00014070375,0.0002962036,0.00048663144,0.00021267665,0.068111286],"genre_scores_gemma":[0.94300896,0.0004030088,0.038467668,0.00021657649,0.00010516723,0.00022942502,0.00014986715,0.00007393027,0.017345373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987037,0.0006621471,0.000031694675,0.00017368716,0.00015173104,0.00027714076],"domain_scores_gemma":[0.98903066,0.00921997,0.00052128953,0.00028073098,0.000439162,0.00050823874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027275924,0.0009474493,0.0015553131,0.0010523736,0.0014542138,0.0031072781,0.0030670566,0.0025581259,0.021775797],"category_scores_gemma":[0.014580743,0.0006700276,0.001616389,0.0009961763,0.0024590609,0.004048554,0.0030012394,0.0029066051,0.0006124183],"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.00019852452,0.0001971931,0.00084522355,0.00011563091,0.000052677555,0.00016127773,0.0002832505,0.46590334,0.0005029402,0.5224072,0.0026279753,0.006704792],"study_design_scores_gemma":[0.000039483584,0.00004166553,0.0001435044,0.000017746193,0.00002095778,0.000029394867,0.00012309903,0.8839542,0.00014082422,0.114739396,0.00073861564,0.000011179018],"about_ca_topic_score_codex":0.005822664,"about_ca_topic_score_gemma":0.003928098,"teacher_disagreement_score":0.021775797,"about_ca_system_score_codex":0.0028012546,"about_ca_system_score_gemma":0.003191515,"threshold_uncertainty_score":0.07284737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66009766,0.00028835368,0.33292392,0.00019795836,0.000050863433,0.00016322231,0.00053140527,0.000494797,0.005251847],"genre_scores_gemma":[0.9815243,0.000059547547,0.017430987,0.000013851856,0.0000073660935,0.000024399422,0.00020183597,0.000022087397,0.0007156601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996569,0.00014348578,0.000015006044,0.000054895485,0.00008895218,0.000040811905],"domain_scores_gemma":[0.9988851,0.0006448114,0.00010076519,0.000094001356,0.0002328518,0.000042520394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243781,0.00049769785,0.00036853255,0.00078373967,0.00025737623,0.00080383004,0.00061224645,0.0006210521,0.001158807],"category_scores_gemma":[0.003893302,0.00021669814,0.00029310808,0.00040662775,0.00028081806,0.00094234117,0.0006266602,0.00038335592,0.00015513983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000987579,0.000021521668,0.0015011061,0.000024737505,0.000023954493,0.000038013568,0.000016649841,0.9803171,0.0014188265,0.0011782341,0.00020244179,0.015158575],"study_design_scores_gemma":[0.000004707541,0.000037923233,0.00064646034,0.000003158692,0.0000068767386,0.000010520662,0.00002181912,0.99795866,0.00067087164,0.00050629186,0.00012965397,0.0000030463614],"about_ca_topic_score_codex":0.007853953,"about_ca_topic_score_gemma":0.0067975186,"teacher_disagreement_score":0.007853953,"about_ca_system_score_codex":0.00059438613,"about_ca_system_score_gemma":0.0007694381,"threshold_uncertainty_score":0.015616477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90576917,0.00009149631,0.06612244,0.00065795967,0.000025871937,0.0001762854,0.000043193093,0.00029644097,0.026817158],"genre_scores_gemma":[0.98877573,0.000025540063,0.0084826555,0.000029836616,0.000008150214,0.000016790877,0.000013482061,0.000008461693,0.002639399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989724,0.0002693441,0.00005071436,0.00016270376,0.0003057884,0.00023897455],"domain_scores_gemma":[0.9959139,0.0017672523,0.00036964484,0.00082841417,0.00081154174,0.00030908527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013490925,0.00031294473,0.00043808212,0.000852135,0.0015929041,0.0016850235,0.0008919673,0.0011442608,0.00864813],"category_scores_gemma":[0.0046963054,0.00031268797,0.00044043476,0.001470663,0.00070589414,0.0023488575,0.0019778898,0.00065877306,0.0006631716],"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.004901547,0.0041295164,0.058900863,0.00063414185,0.00020834166,0.0043060235,0.0033906433,0.1711807,0.07315467,0.1563989,0.004689906,0.51810473],"study_design_scores_gemma":[0.00054002233,0.005245274,0.027121874,0.00015030999,0.0005261802,0.0018770169,0.0030968448,0.81467223,0.04813761,0.08658441,0.011880333,0.00016794137],"about_ca_topic_score_codex":0.0028943648,"about_ca_topic_score_gemma":0.0034879975,"teacher_disagreement_score":0.00864813,"about_ca_system_score_codex":0.0008770779,"about_ca_system_score_gemma":0.0025995208,"threshold_uncertainty_score":0.028930843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025326492,0.00021540352,0.9680836,0.00022821118,0.00006312501,0.00008586089,0.000052598505,0.0001456751,0.0057990276],"genre_scores_gemma":[0.48767853,0.00023597453,0.5048114,0.00021675129,0.00007737078,0.0004539969,0.00023304037,0.0001263215,0.0061665694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993981,0.00025824082,0.0000217097,0.00010993996,0.00011922891,0.00009279148],"domain_scores_gemma":[0.9987357,0.0009524241,0.000075321106,0.00005469958,0.00012722402,0.000054493496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012286362,0.0012861388,0.0019863746,0.0016170378,0.0008655199,0.0016310938,0.0026620252,0.0029302072,0.0038385962],"category_scores_gemma":[0.0024034898,0.00094142446,0.0018855723,0.0012596193,0.0010205484,0.0016997261,0.0016473595,0.0021708182,0.0003269556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000405175,0.000051578856,0.00017154071,0.00004538156,0.000049321905,0.000057562604,0.000031800064,0.9767984,0.00041746057,0.010215668,0.00044512207,0.011675564],"study_design_scores_gemma":[0.000008779628,0.00000989919,0.000017037537,0.000002941068,0.0000067054457,0.000007882875,0.000006396081,0.99703515,0.0000727855,0.0027108074,0.00011885176,0.0000027819008],"about_ca_topic_score_codex":0.0097331945,"about_ca_topic_score_gemma":0.0069406456,"teacher_disagreement_score":0.0097331945,"about_ca_system_score_codex":0.0011033482,"about_ca_system_score_gemma":0.0020370435,"threshold_uncertainty_score":0.019353092},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029925406,0.00023019144,0.9546346,0.0010232453,0.00012890581,0.0001383468,0.00028596088,0.0001566687,0.013476627],"genre_scores_gemma":[0.6618232,0.000836871,0.32221127,0.00035371346,0.00015545926,0.0005724497,0.00048230938,0.00025404178,0.013310676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815685,0.0012540859,0.000050550698,0.00021142184,0.00019633409,0.00013070827],"domain_scores_gemma":[0.9918498,0.006859722,0.00030222957,0.00021759336,0.00041520008,0.00035542625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030607486,0.0012820123,0.0017798168,0.0020190675,0.0012786735,0.0032443455,0.0028819442,0.0036713977,0.009494588],"category_scores_gemma":[0.010359388,0.0006183691,0.0020823188,0.0036701404,0.002439335,0.004280612,0.0020968197,0.0027801765,0.0008374306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066210014,0.00007443667,0.00050421036,0.00006914137,0.00004513305,0.00017509384,0.00020853417,0.58875054,0.0003737263,0.3998798,0.001608069,0.008245013],"study_design_scores_gemma":[0.000017911421,0.000020043393,0.00007350233,0.0000066758034,0.000013342513,0.000024057234,0.000052232816,0.8952092,0.00004457691,0.10373492,0.0007868098,0.00001667531],"about_ca_topic_score_codex":0.0179242,"about_ca_topic_score_gemma":0.0134508135,"teacher_disagreement_score":0.0179242,"about_ca_system_score_codex":0.0029410727,"about_ca_system_score_gemma":0.0025132736,"threshold_uncertainty_score":0.035639703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9321646,0.0006934347,0.012989768,0.0015773163,0.000052627976,0.00003158189,0.000037358597,0.000030142806,0.052423105],"genre_scores_gemma":[0.9984681,0.00009170472,0.00049747684,0.00002173412,0.0000068162585,0.000005904327,0.000007478175,0.0000022809188,0.0008984921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908376,0.00036221472,0.000031460684,0.0001047488,0.00014316781,0.000274701],"domain_scores_gemma":[0.99274945,0.004654858,0.000927755,0.00019276192,0.0005083356,0.00096691947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018149863,0.00030745508,0.00029205618,0.0009056458,0.0006211335,0.004016776,0.00040627227,0.0011766107,0.0059250444],"category_scores_gemma":[0.011086423,0.0002297725,0.00026164518,0.0007237521,0.001442296,0.0024970034,0.0009865622,0.00083100743,0.00051641377],"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.00097462715,0.0011614941,0.14186805,0.0002913412,0.0002284166,0.001154911,0.0035538448,0.067705065,0.006302931,0.5943899,0.004686029,0.17768337],"study_design_scores_gemma":[0.00026077844,0.0011428297,0.14359756,0.00016918017,0.00012894973,0.0005750176,0.011962283,0.19487025,0.0034329272,0.63133436,0.012425726,0.000100169615],"about_ca_topic_score_codex":0.001042911,"about_ca_topic_score_gemma":0.0015668299,"teacher_disagreement_score":0.0059250444,"about_ca_system_score_codex":0.0016009063,"about_ca_system_score_gemma":0.0011275816,"threshold_uncertainty_score":0.019821227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14851159,0.018550081,0.612665,0.030433716,0.0010819769,0.00022429913,0.0006533708,0.0003201763,0.18755978],"genre_scores_gemma":[0.9216966,0.007601154,0.038560487,0.0022422175,0.0007485757,0.00020251551,0.00013376602,0.00021469092,0.028599972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645126,0.0019296767,0.0001808388,0.00041268536,0.00052930985,0.0004962344],"domain_scores_gemma":[0.98659945,0.010154866,0.00097081077,0.0008569921,0.0007928323,0.00062509975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011271052,0.0012940629,0.0028570069,0.0018306612,0.0015006777,0.005142028,0.0018625505,0.005526415,0.014593984],"category_scores_gemma":[0.036248554,0.0011025491,0.0020181062,0.001579391,0.00417451,0.007898454,0.0030605856,0.006365109,0.0010177958],"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.000102779675,0.000037377184,0.00037320625,0.00012942482,0.000071882656,0.00004157778,0.00012317105,0.053467333,0.00014956236,0.92761666,0.0044406643,0.013446321],"study_design_scores_gemma":[0.00004967056,0.000037261965,0.00026527082,0.00009828968,0.000035032965,0.00003355213,0.00006321318,0.047654204,0.000093900715,0.9494819,0.0021653376,0.000022436026],"about_ca_topic_score_codex":0.0027008462,"about_ca_topic_score_gemma":0.0021291198,"teacher_disagreement_score":0.014593984,"about_ca_system_score_codex":0.0026602293,"about_ca_system_score_gemma":0.0023691515,"threshold_uncertainty_score":0.059607685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99305516,0.00006796542,0.0014128238,0.00013140944,0.0000017452091,0.0000129878035,0.00010524141,0.0000067823325,0.0052058045],"genre_scores_gemma":[0.9993766,0.000026848644,0.00025204668,0.0000028872996,0.0000012999243,0.0000030707865,0.00004663275,0.0000022618,0.00028846326],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.00013641466,0.0000100563075,0.000024599394,0.0000836485,0.00008432338],"domain_scores_gemma":[0.9955108,0.0033978426,0.0004985391,0.00015782731,0.00020612631,0.00022884028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069462747,0.00016998971,0.00021278264,0.0020068132,0.00071362907,0.0022281152,0.00048283933,0.00037295328,0.0041814675],"category_scores_gemma":[0.00486991,0.00012085148,0.00036124876,0.002314113,0.0012975595,0.0016369062,0.001065837,0.00040945562,0.00017311146],"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.0010117758,0.0005725727,0.7218721,0.00020882658,0.00028854204,0.0015582728,0.009589794,0.08756145,0.0032295845,0.12695749,0.0018480493,0.04530166],"study_design_scores_gemma":[0.000040457784,0.00042350515,0.6769702,0.00010815578,0.00014416473,0.00056782475,0.06517707,0.16897847,0.0011671905,0.08017822,0.0061841733,0.00006061605],"about_ca_topic_score_codex":0.012508939,"about_ca_topic_score_gemma":0.016167732,"teacher_disagreement_score":0.012508939,"about_ca_system_score_codex":0.0010299,"about_ca_system_score_gemma":0.0014597762,"threshold_uncertainty_score":0.024872243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7031444,0.00080393505,0.16230065,0.00376765,0.00007159821,0.00008953302,0.00015532036,0.00009991922,0.129567],"genre_scores_gemma":[0.9944073,0.00009761263,0.0030672734,0.000088123365,0.00003759385,0.00003939787,0.000028154453,0.000013760435,0.0022208397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99538714,0.0028747867,0.0000898561,0.00050346507,0.00045373692,0.00069104217],"domain_scores_gemma":[0.98153347,0.01460848,0.0011251526,0.00092363707,0.00059971865,0.0012096588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008279597,0.0003655996,0.0013946508,0.0013072436,0.0015969846,0.005939565,0.001419093,0.0017298508,0.012248115],"category_scores_gemma":[0.028272137,0.00036116716,0.00082603603,0.0010217377,0.0031441269,0.005107685,0.003503595,0.0023694423,0.00055357505],"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.00025862412,0.00012121284,0.003987972,0.00006307839,0.000081892984,0.00010048868,0.0007732335,0.027321624,0.0011626659,0.94792926,0.001655942,0.016544053],"study_design_scores_gemma":[0.0000588912,0.00007856912,0.0022484823,0.000031664214,0.000024559433,0.00012357463,0.00075700803,0.061367616,0.00038436658,0.9330717,0.0018349217,0.000018699197],"about_ca_topic_score_codex":0.00060406164,"about_ca_topic_score_gemma":0.0008252186,"teacher_disagreement_score":0.012248115,"about_ca_system_score_codex":0.0013436396,"about_ca_system_score_gemma":0.0008958704,"threshold_uncertainty_score":0.04378718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.894198,0.000102966995,0.08228705,0.0011211727,0.00006561398,0.00011083099,0.00019009515,0.00022147168,0.021702718],"genre_scores_gemma":[0.9938407,0.000021591346,0.0029036135,0.00001973317,0.000008986785,0.000010018794,0.000021979851,0.0000066409402,0.0031667447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991667,0.00024405049,0.000052503354,0.00020039828,0.00013386873,0.0002024035],"domain_scores_gemma":[0.99631643,0.0019810875,0.0004447905,0.00041991807,0.0004865517,0.00035113934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011540805,0.00033454862,0.0005971919,0.0007101843,0.0021054437,0.002864514,0.0011258776,0.0019795548,0.009492813],"category_scores_gemma":[0.0052326005,0.00045375092,0.0005858858,0.0015474366,0.0010528568,0.0030926322,0.0020564827,0.000929656,0.00060110417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003382819,0.0007785928,0.027461141,0.00018635338,0.0001612874,0.0070931856,0.0023034527,0.73534757,0.017462874,0.123388104,0.0033620712,0.07907266],"study_design_scores_gemma":[0.000064755935,0.00020962882,0.002512538,0.000018148083,0.000070222624,0.00027201147,0.0007962899,0.9657538,0.0023844028,0.02636393,0.0015027768,0.000051507446],"about_ca_topic_score_codex":0.011645106,"about_ca_topic_score_gemma":0.0069485554,"teacher_disagreement_score":0.011645106,"about_ca_system_score_codex":0.0012790279,"about_ca_system_score_gemma":0.0016645328,"threshold_uncertainty_score":0.03175664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062942184,0.0061910064,0.9841314,0.00085623364,0.00009953729,0.000019918873,0.00007716435,0.00008450183,0.002245975],"genre_scores_gemma":[0.36822295,0.036917392,0.58056295,0.00078306725,0.0020977182,0.00019053686,0.0009961894,0.0004065511,0.009822624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785197,0.00088210445,0.00010466675,0.0004865333,0.00054346066,0.0001311949],"domain_scores_gemma":[0.9872162,0.009860986,0.000684587,0.0006696766,0.0012458531,0.00032273793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005983418,0.001670216,0.0036001357,0.0012950099,0.00054237334,0.002846697,0.0044260873,0.0023997996,0.0031932388],"category_scores_gemma":[0.016146615,0.0020567295,0.0018478183,0.0033682787,0.0020683617,0.0061136913,0.0023147287,0.005013875,0.00062047405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099937344,0.000117345124,0.0010249593,0.00032297202,0.00012098948,0.000038683105,0.00006731048,0.7559469,0.00026282505,0.120905474,0.0025272553,0.11856539],"study_design_scores_gemma":[0.0000077486075,0.000013004621,0.00017167044,0.000020538511,0.000014695678,0.00001138537,0.0000057457796,0.9308911,0.0000816557,0.06772292,0.0010500955,0.000009469666],"about_ca_topic_score_codex":0.005871002,"about_ca_topic_score_gemma":0.0051514376,"teacher_disagreement_score":0.005983418,"about_ca_system_score_codex":0.0021967795,"about_ca_system_score_gemma":0.0020989608,"threshold_uncertainty_score":0.03164369},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96412826,0.00028304322,0.0040871585,0.003998377,0.00002781942,0.000063272615,0.00007757751,0.000027639806,0.027306948],"genre_scores_gemma":[0.9975278,0.00009596862,0.00033752667,0.00005834769,0.000012408766,0.0000051505826,0.000009588806,0.0000028416941,0.0019504566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923146,0.0002161988,0.000035688437,0.00010655707,0.00008983117,0.0003202817],"domain_scores_gemma":[0.9929763,0.0038786766,0.0011850952,0.00034421272,0.00054164656,0.0010739884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032197942,0.00033505264,0.0010708031,0.0005910165,0.0014177515,0.004069958,0.0009533087,0.002952238,0.010990082],"category_scores_gemma":[0.006621795,0.0002609312,0.00057527696,0.00069769396,0.0013575397,0.0033980506,0.0013429999,0.0013533494,0.0007299734],"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.005624233,0.002475087,0.22706956,0.0008745783,0.0004140317,0.018675929,0.012872155,0.115731135,0.031840224,0.43448937,0.017626222,0.13230745],"study_design_scores_gemma":[0.0005504625,0.0017882742,0.13661243,0.00037148956,0.00048330324,0.002655776,0.07148584,0.4838016,0.007979141,0.28066164,0.013307826,0.0003022118],"about_ca_topic_score_codex":0.007409218,"about_ca_topic_score_gemma":0.00778931,"teacher_disagreement_score":0.010990082,"about_ca_system_score_codex":0.0014687239,"about_ca_system_score_gemma":0.0025310186,"threshold_uncertainty_score":0.036765516},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27535033,0.00076000165,0.6961978,0.0029585538,0.00031765737,0.00079348666,0.0005743078,0.0003306147,0.022717211],"genre_scores_gemma":[0.8177399,0.00014891729,0.17880876,0.00025547264,0.000109987915,0.00021130161,0.00021066556,0.000080266385,0.0024348304],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98330724,0.012241009,0.00047237464,0.0008876059,0.0024321605,0.0006595482],"domain_scores_gemma":[0.96440405,0.026716653,0.0013252039,0.0029077975,0.0039550117,0.00069130823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020868558,0.00088688126,0.0020122086,0.003628561,0.002200179,0.0029815445,0.0023266731,0.0019525486,0.005093237],"category_scores_gemma":[0.053831063,0.0002589498,0.0019304685,0.0030989486,0.0020346814,0.0036584453,0.002972577,0.0024798668,0.00040401847],"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.0019435995,0.001389609,0.03594849,0.00078952534,0.0007866517,0.0011709585,0.0039618076,0.09468037,0.00580162,0.25377965,0.010178666,0.589569],"study_design_scores_gemma":[0.00038274785,0.0019465107,0.013612033,0.00021160913,0.0006848438,0.0008846025,0.005576315,0.6434946,0.0046085133,0.31573918,0.01263936,0.0002197235],"about_ca_topic_score_codex":0.007205929,"about_ca_topic_score_gemma":0.007959393,"teacher_disagreement_score":0.020868558,"about_ca_system_score_codex":0.0013643139,"about_ca_system_score_gemma":0.0038999708,"threshold_uncertainty_score":0.110364795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012064746,0.00018078151,0.9828773,0.00028388624,0.00009279196,0.00008235861,0.00009390314,0.0005450722,0.0037791447],"genre_scores_gemma":[0.16738985,0.00017807522,0.8268295,0.00041234287,0.000059731407,0.00035462916,0.0003270242,0.00023981479,0.0042090425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992867,0.0002483852,0.000031698542,0.00014300365,0.00014206828,0.00014811911],"domain_scores_gemma":[0.99837744,0.0010312246,0.00014770574,0.000084446896,0.00021740221,0.00014179033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014278425,0.0011250579,0.0014424537,0.0009049761,0.0006023739,0.0014593765,0.0025309885,0.0022884281,0.0057407725],"category_scores_gemma":[0.0044920403,0.00082629104,0.00096545275,0.001148348,0.00072233885,0.0013953488,0.001845365,0.0016310426,0.0009982807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042290692,0.00023602467,0.00050840044,0.00012021026,0.000046084177,0.00008902328,0.00009471247,0.8375799,0.0023906617,0.017625706,0.004560146,0.13632618],"study_design_scores_gemma":[0.000045086766,0.00005036426,0.000032772303,0.000008397927,0.000005361045,0.000012555476,0.000012088828,0.9963038,0.00023121912,0.0027516172,0.00054092996,0.000005717502],"about_ca_topic_score_codex":0.005921108,"about_ca_topic_score_gemma":0.0055168266,"teacher_disagreement_score":0.005921108,"about_ca_system_score_codex":0.0015188971,"about_ca_system_score_gemma":0.002874013,"threshold_uncertainty_score":0.019204736},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33369562,0.0061943834,0.019616706,0.24099554,0.0021143544,0.00022909832,0.0006594714,0.00095849216,0.3955363],"genre_scores_gemma":[0.9633211,0.0017848926,0.0051272856,0.0063138846,0.0006430731,0.000041520358,0.00013019692,0.000060877395,0.022577163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986939,0.0003574574,0.000044982295,0.000160007,0.00037388116,0.00036984473],"domain_scores_gemma":[0.99156755,0.0039863507,0.0006319238,0.0007039166,0.0015481373,0.0015621124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022973248,0.0003923046,0.00041066317,0.00056219846,0.0013346501,0.004709255,0.0011685848,0.0055072946,0.058635212],"category_scores_gemma":[0.012733254,0.0002816525,0.00048333692,0.0004773904,0.0013314474,0.015092065,0.002748133,0.0017147126,0.0072459956],"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.001793124,0.0014251852,0.028342677,0.0013704199,0.00024493563,0.0028988502,0.0013910029,0.011649336,0.008048274,0.19707412,0.1789038,0.56685823],"study_design_scores_gemma":[0.00045206875,0.0011819169,0.036357474,0.0017688661,0.0005500703,0.0035468768,0.024886042,0.025871534,0.009932019,0.49984682,0.39527428,0.0003320984],"about_ca_topic_score_codex":0.0018188788,"about_ca_topic_score_gemma":0.0032760224,"teacher_disagreement_score":0.058635212,"about_ca_system_score_codex":0.0010550286,"about_ca_system_score_gemma":0.0027886038,"threshold_uncertainty_score":0.1961543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008112421,0.00019302274,0.98672456,0.00016358538,0.000041816733,0.000028805362,0.000057185047,0.0003010391,0.004377646],"genre_scores_gemma":[0.59053606,0.0004468391,0.40313786,0.00015871786,0.00006409094,0.00018906994,0.00021355072,0.00038452406,0.0048692743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996517,0.00009048452,0.000010726274,0.000059658567,0.000117080264,0.00007040379],"domain_scores_gemma":[0.9993481,0.00036738353,0.000068913425,0.000048873968,0.00011921795,0.000047465466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069193705,0.0012699921,0.0011037188,0.00062807905,0.0004628848,0.0011349212,0.0012204522,0.00073565036,0.003771228],"category_scores_gemma":[0.0019019209,0.0007111497,0.0006605356,0.000621108,0.0005411477,0.001013656,0.0012127154,0.001152633,0.0005323655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022817618,0.000014949167,0.00007782937,0.000035273108,0.000011148569,0.000021833188,0.000012671716,0.9811693,0.0020774133,0.005226503,0.00065485574,0.01067544],"study_design_scores_gemma":[0.0000043484674,0.0000072698153,0.000012458859,0.0000025607412,0.0000028112763,0.000003670682,0.0000034364648,0.9975672,0.0002421127,0.0019526731,0.00020017882,0.0000014108806],"about_ca_topic_score_codex":0.0040285597,"about_ca_topic_score_gemma":0.0070446306,"teacher_disagreement_score":0.0040285597,"about_ca_system_score_codex":0.001095655,"about_ca_system_score_gemma":0.0018801902,"threshold_uncertainty_score":0.012615979},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030083929,0.13151391,0.8330577,0.0023552794,0.00041777836,0.00009147872,0.0007279738,0.0002864014,0.028541135],"genre_scores_gemma":[0.16956985,0.48333323,0.32672682,0.0013400727,0.002650935,0.0006750707,0.0025015068,0.0005611483,0.012641393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"systematic_review","domain_scores_codex":[0.9990476,0.0004033986,0.00008425428,0.00012728533,0.0002724489,0.000064983215],"domain_scores_gemma":[0.9988959,0.00080731657,0.00007407823,0.00004956705,0.0001518393,0.00002129353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016887191,0.0023412537,0.0024344549,0.0011572139,0.00040978304,0.0022751365,0.0020080043,0.0013904679,0.0037799124],"category_scores_gemma":[0.0028056859,0.0010049625,0.0016761849,0.0040274174,0.00058824394,0.0018661213,0.0009402999,0.0023574254,0.0014942717],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050298368,0.00012428292,0.00071179174,0.0021231896,0.00015886722,0.00011342872,0.00008368265,0.7081766,0.00042277007,0.103927515,0.017425112,0.16668251],"study_design_scores_gemma":[0.000014826728,0.000054190692,0.00035923795,0.0005353105,0.0000678149,0.00010427595,0.000047638405,0.882203,0.00021055344,0.06728244,0.049092818,0.000027885699],"about_ca_topic_score_codex":0.005210114,"about_ca_topic_score_gemma":0.004711433,"teacher_disagreement_score":0.005210114,"about_ca_system_score_codex":0.0010821806,"about_ca_system_score_gemma":0.0017294885,"threshold_uncertainty_score":0.012645066},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024276832,0.0013759088,0.0007552071,0.098223925,0.88260084,0.00008160075,0.0015507684,0.00046420164,0.014704851],"genre_scores_gemma":[0.0075052795,0.005630611,0.003356692,0.25051513,0.17373218,0.0004164463,0.0026172765,0.00084904506,0.5553773],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934934,0.00070376456,0.0008728723,0.00090098317,0.0032615503,0.0007674825],"domain_scores_gemma":[0.97792196,0.0037830644,0.0007624016,0.0010660136,0.015846692,0.00061981747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038478624,0.0033645045,0.0030899842,0.0042150235,0.00670494,0.0059535997,0.0049941554,0.015906608,0.060137376],"category_scores_gemma":[0.034726106,0.0018187826,0.003145843,0.0038680588,0.0026556612,0.0033352487,0.002715254,0.012229404,0.042877454],"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.000011560911,0.000007585613,0.00003163576,0.0000350711,0.0000054948505,0.000066134475,0.000011675598,0.000032711505,0.000028246559,0.0004482314,0.99762243,0.001699284],"study_design_scores_gemma":[0.000051563642,0.000040570616,0.0025761866,0.0002424439,0.0000676601,0.00012256559,0.00013074528,0.0005835317,0.00035140588,0.0021731982,0.99357045,0.000089798144],"about_ca_topic_score_codex":0.16790071,"about_ca_topic_score_gemma":0.19572945,"teacher_disagreement_score":0.16790071,"about_ca_system_score_codex":0.008406647,"about_ca_system_score_gemma":0.009246772,"threshold_uncertainty_score":0.33384687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77125853,0.00092011655,0.047220297,0.024200037,0.00010131988,0.0011308765,0.000085103005,0.000106726286,0.15497695],"genre_scores_gemma":[0.97871757,0.00031760836,0.014859156,0.0003567195,0.000010142513,0.00026332817,0.00002333618,0.000019189083,0.005432973],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99109405,0.007063005,0.00014370852,0.00028888736,0.0003278606,0.0010825453],"domain_scores_gemma":[0.99209553,0.0057261246,0.00058517576,0.0002980989,0.0003014313,0.0009936076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007925105,0.00044098464,0.0003054858,0.0006812328,0.007823532,0.003794423,0.0013226311,0.002934363,0.006176583],"category_scores_gemma":[0.00921856,0.00046676776,0.000383484,0.0016488746,0.009263225,0.0037596188,0.0071819024,0.0024941924,0.00038872],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003467565,0.0005519285,0.01848854,0.0006287368,0.000043472377,0.040113904,0.47579896,0.019877171,0.003229552,0.36272553,0.005127034,0.0730684],"study_design_scores_gemma":[0.00041182956,0.00052307924,0.014544991,0.00086243043,0.00007074997,0.00415377,0.6159165,0.022484437,0.0022924861,0.15206638,0.18656978,0.00010355917],"about_ca_topic_score_codex":0.026003832,"about_ca_topic_score_gemma":0.052741073,"teacher_disagreement_score":0.026003832,"about_ca_system_score_codex":0.0086858915,"about_ca_system_score_gemma":0.008203348,"threshold_uncertainty_score":0.063020825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17198554,0.000335848,0.8110988,0.0005803578,0.00013127655,0.00018335953,0.0005812335,0.00032204148,0.014781493],"genre_scores_gemma":[0.8881926,0.00021008492,0.0968225,0.00007690463,0.000069149406,0.00017890209,0.00028458473,0.00012349724,0.014041711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934727,0.00019785769,0.000019709223,0.00015345792,0.00009254444,0.00018919836],"domain_scores_gemma":[0.9986051,0.00085909857,0.00018462919,0.00008864935,0.00016283855,0.00009971507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011359915,0.0010318588,0.0015037518,0.0007319747,0.0005536368,0.0019063124,0.001964108,0.0020450982,0.009720394],"category_scores_gemma":[0.0031856496,0.00089132204,0.0011908092,0.0015440851,0.00079257984,0.0012976268,0.0012155495,0.0009838585,0.0006944977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020616243,0.000054519096,0.000497211,0.00009641146,0.000030473266,0.00018983701,0.000039054667,0.97513163,0.0013967108,0.010893976,0.0010660348,0.0103979055],"study_design_scores_gemma":[0.000017162567,0.00002568034,0.00026454532,0.0000059566078,0.000015175537,0.000022725997,0.000022970959,0.99571425,0.00032629623,0.0032678905,0.00030867517,0.000008613658],"about_ca_topic_score_codex":0.010418958,"about_ca_topic_score_gemma":0.007710718,"teacher_disagreement_score":0.010418958,"about_ca_system_score_codex":0.0018779268,"about_ca_system_score_gemma":0.0011752767,"threshold_uncertainty_score":0.03251791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3637737,0.00015951185,0.50842255,0.00063037645,0.00009195066,0.00022830069,0.00014556278,0.00064466294,0.12590337],"genre_scores_gemma":[0.95022124,0.00005698627,0.038027152,0.000048801827,0.000015442394,0.00008784161,0.000074191536,0.000097661796,0.0113706775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988807,0.000599585,0.00003831286,0.00013778333,0.0001555924,0.00018792202],"domain_scores_gemma":[0.9981014,0.00066363584,0.00012838088,0.0004457561,0.00049281924,0.00016805486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011321752,0.00033618064,0.00042343786,0.0003674545,0.0007789028,0.0023476465,0.00085959496,0.0008236992,0.022841226],"category_scores_gemma":[0.004165386,0.0002655296,0.0005042391,0.0005721197,0.0009872726,0.0016828763,0.0012545807,0.00047263494,0.0020902238],"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.00082106894,0.0003784287,0.0109157,0.0002986329,0.00008857791,0.00036023444,0.0025948843,0.18185666,0.019054117,0.627878,0.0052145496,0.15053914],"study_design_scores_gemma":[0.0001543387,0.0014453449,0.00890528,0.000068447946,0.00025274447,0.00073750137,0.005581042,0.7223646,0.009791327,0.20119266,0.04940346,0.00010324563],"about_ca_topic_score_codex":0.0023175043,"about_ca_topic_score_gemma":0.0040548868,"teacher_disagreement_score":0.022841226,"about_ca_system_score_codex":0.0009197557,"about_ca_system_score_gemma":0.0009473568,"threshold_uncertainty_score":0.076411486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49385586,0.012855712,0.0051479237,0.27411196,0.0028581282,0.00015246337,0.00029994315,0.0002142139,0.21050377],"genre_scores_gemma":[0.9896662,0.00086910446,0.00050718256,0.004972001,0.0002523013,0.000022809754,0.000019550149,0.000015834323,0.0036748888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9926927,0.0025643467,0.00024237369,0.00036177086,0.0020775537,0.0020612532],"domain_scores_gemma":[0.9615255,0.025026964,0.0036464927,0.0009999478,0.005113367,0.0036877985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010595583,0.00029826202,0.00066591613,0.0012400817,0.0016399098,0.0067062387,0.0011818109,0.0052262824,0.009696198],"category_scores_gemma":[0.03972857,0.00028785295,0.00057996955,0.0009914265,0.0034136872,0.0051321825,0.0035054986,0.0036289783,0.0005443583],"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.001975929,0.0015329169,0.07374392,0.0015114485,0.0004409011,0.0012700524,0.003470788,0.013827675,0.004840202,0.48971316,0.08731831,0.32035467],"study_design_scores_gemma":[0.001130725,0.0012051403,0.17387441,0.0049822745,0.0015451922,0.0006479518,0.020071663,0.022230305,0.008851535,0.35960808,0.4055582,0.00029452844],"about_ca_topic_score_codex":0.02492912,"about_ca_topic_score_gemma":0.03924486,"teacher_disagreement_score":0.02492912,"about_ca_system_score_codex":0.0063760867,"about_ca_system_score_gemma":0.020517915,"threshold_uncertainty_score":0.05603552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98476464,0.00003656107,0.000097505486,0.00047752255,0.000020151467,0.000009372447,0.000025622565,0.0000124028165,0.014556152],"genre_scores_gemma":[0.9993536,0.000007879594,0.00001830864,0.000034501867,0.000006595091,0.0000014456507,0.000009391168,0.0000015730687,0.0005667627],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998116,0.0006233645,0.000057943955,0.00013563025,0.00030012676,0.00076695473],"domain_scores_gemma":[0.98006,0.010353964,0.0026053912,0.00065157114,0.0026230575,0.0037060531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023672068,0.00019110649,0.00024839133,0.00033463028,0.0008377495,0.0036735612,0.000565422,0.0010154886,0.014530014],"category_scores_gemma":[0.01673057,0.00011150307,0.0002535639,0.00036350603,0.0015694242,0.0017856761,0.000973739,0.0012400846,0.00079444534],"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.03143554,0.016605562,0.55977,0.00036805903,0.0003871189,0.004713778,0.006649372,0.06150529,0.036583405,0.086546145,0.011080558,0.18435527],"study_design_scores_gemma":[0.0010520895,0.010762033,0.86342585,0.00008772318,0.00036932132,0.00046279075,0.032742947,0.051037077,0.011694639,0.021297004,0.0069292304,0.00013920618],"about_ca_topic_score_codex":0.00516433,"about_ca_topic_score_gemma":0.008205738,"teacher_disagreement_score":0.014530014,"about_ca_system_score_codex":0.001745074,"about_ca_system_score_gemma":0.0026348727,"threshold_uncertainty_score":0.048607707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95553994,0.0005410662,0.0030795897,0.0018541791,0.00006035993,0.00004766692,0.00009093709,0.00006001141,0.03872622],"genre_scores_gemma":[0.9981104,0.00011707234,0.00045454546,0.0000499121,0.0000114747045,0.000005786457,0.000016135264,0.0000102034965,0.0012245178],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658835,0.0013585155,0.00013927538,0.0001702801,0.00067631825,0.001067254],"domain_scores_gemma":[0.9729109,0.017588422,0.002461187,0.00097094604,0.0046322267,0.001436233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004832544,0.0003140054,0.00034511415,0.0009687703,0.0010777191,0.0038904832,0.0007129952,0.0012004216,0.0082297595],"category_scores_gemma":[0.016078377,0.0003019526,0.0006300422,0.00121563,0.0013088625,0.0032502457,0.003533812,0.0010046096,0.0003629243],"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.005387353,0.0044182944,0.40336064,0.0014266788,0.0009849131,0.0020829623,0.003508296,0.11047629,0.024342999,0.06957457,0.005342938,0.36909407],"study_design_scores_gemma":[0.0002223693,0.0036423136,0.73993695,0.000524676,0.0028930518,0.0011494928,0.030169059,0.090001,0.05067183,0.049247567,0.031269554,0.00027217262],"about_ca_topic_score_codex":0.010349562,"about_ca_topic_score_gemma":0.012983659,"teacher_disagreement_score":0.010349562,"about_ca_system_score_codex":0.002010521,"about_ca_system_score_gemma":0.0048058648,"threshold_uncertainty_score":0.027531326},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063382976,0.0037373619,0.8805636,0.009863352,0.0004886496,0.00009967116,0.00024154526,0.00014379006,0.041479144],"genre_scores_gemma":[0.75797296,0.003517272,0.22422758,0.002020073,0.000977121,0.00023790437,0.0002549234,0.00036995256,0.010422167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99404883,0.0034385559,0.00031439442,0.0007052323,0.0012004229,0.0002926663],"domain_scores_gemma":[0.9773381,0.018241985,0.0010958778,0.0015578357,0.0013228495,0.00044338824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0110126,0.0011216657,0.0019443757,0.0023144323,0.0023409596,0.0047706263,0.0025981439,0.002285282,0.005763014],"category_scores_gemma":[0.051777873,0.001279581,0.0018218914,0.0025804376,0.008714547,0.01309396,0.008052099,0.009959398,0.0009325587],"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.000083762076,0.000046924913,0.00064603315,0.00020110059,0.000024914694,0.00011907749,0.00039776033,0.019604132,0.00050540385,0.9585921,0.0018404895,0.01793823],"study_design_scores_gemma":[0.000008672008,0.000020953292,0.00009291121,0.00005203964,0.0000049508776,0.00003403657,0.00005239435,0.03927384,0.00011499544,0.959305,0.0010312264,0.000009001728],"about_ca_topic_score_codex":0.0022587636,"about_ca_topic_score_gemma":0.0020341508,"teacher_disagreement_score":0.0110126,"about_ca_system_score_codex":0.0016125806,"about_ca_system_score_gemma":0.0024399604,"threshold_uncertainty_score":0.05824089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4359157,0.0027178081,0.45088038,0.0032295228,0.0001012959,0.00062268815,0.00022439212,0.00009848065,0.10620958],"genre_scores_gemma":[0.96929014,0.0009777016,0.021160496,0.00018293336,0.000051019422,0.00012632403,0.00005200332,0.00001548917,0.00814389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985576,0.00055108644,0.00003862992,0.0002001459,0.0002557509,0.00039671056],"domain_scores_gemma":[0.99740356,0.0015769374,0.00044219743,0.00012348701,0.00021107923,0.0002427566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019394811,0.0011488124,0.0010479375,0.0017530976,0.0010816978,0.0030766667,0.0018204161,0.0025699914,0.005644333],"category_scores_gemma":[0.0040093563,0.00068931555,0.0020465292,0.0012023138,0.0021299648,0.003558361,0.0019545085,0.0015656062,0.00034826278],"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.00019790685,0.0003362296,0.005958931,0.0003879679,0.00023822929,0.0013606824,0.0004211605,0.39611518,0.00569527,0.56507045,0.0012436463,0.022974275],"study_design_scores_gemma":[0.00011246379,0.00062415836,0.0040523624,0.00013625351,0.00031349383,0.0005760038,0.001333098,0.7165849,0.0028051054,0.26440805,0.00892581,0.00012827304],"about_ca_topic_score_codex":0.0054140543,"about_ca_topic_score_gemma":0.006828991,"teacher_disagreement_score":0.005644333,"about_ca_system_score_codex":0.0035799386,"about_ca_system_score_gemma":0.0026200789,"threshold_uncertainty_score":0.025974452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5029736,0.000950129,0.46066865,0.0026641514,0.00017787884,0.00021363748,0.00025530026,0.00010989619,0.031986672],"genre_scores_gemma":[0.97237307,0.00053672324,0.018413814,0.00018977428,0.00008374388,0.00009090814,0.00007856407,0.000020000974,0.008213408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804926,0.000761267,0.00008916455,0.00033233452,0.00033454775,0.00043350505],"domain_scores_gemma":[0.9956054,0.0025697683,0.0007706531,0.00021312317,0.00022698357,0.000614168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002132293,0.0012106518,0.0018471729,0.00077839155,0.0013569082,0.0022336673,0.002037244,0.0039167674,0.007319303],"category_scores_gemma":[0.0055204644,0.00068619143,0.001980531,0.00084897946,0.0035213162,0.006317746,0.0025875499,0.0026788546,0.0005079127],"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.00034939827,0.00019717014,0.0015563461,0.00011091613,0.00009572034,0.0011283663,0.0006173863,0.28253517,0.0020639068,0.70378727,0.0010917088,0.006466714],"study_design_scores_gemma":[0.00017587258,0.00022797097,0.0004987466,0.00003672093,0.00005485054,0.0002507119,0.00030853975,0.785035,0.00036801826,0.2112244,0.0017558008,0.00006331057],"about_ca_topic_score_codex":0.0044475263,"about_ca_topic_score_gemma":0.002571999,"teacher_disagreement_score":0.007319303,"about_ca_system_score_codex":0.0013982188,"about_ca_system_score_gemma":0.0010685831,"threshold_uncertainty_score":0.024485528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93957216,0.0010427322,0.0492436,0.0019073552,0.00014658038,0.00024493222,0.0016100493,0.00008434278,0.0061482163],"genre_scores_gemma":[0.99492514,0.00015460659,0.0024126996,0.000045298035,0.000022610526,0.00006438733,0.00035736556,0.000007682171,0.002010122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945379,0.0031749238,0.00027173402,0.00067454256,0.00055224885,0.00078859914],"domain_scores_gemma":[0.9746855,0.01820349,0.0034830156,0.001277624,0.0015514178,0.00079908833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010738349,0.00055803487,0.0012754186,0.0010208008,0.00036774902,0.0018380258,0.0020921733,0.0013640501,0.010951321],"category_scores_gemma":[0.045985073,0.00055405643,0.0009403949,0.0011243713,0.0007215226,0.0022393314,0.001847359,0.001344151,0.00065013365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01048664,0.0016937301,0.30396494,0.00079690054,0.0015760674,0.0005427972,0.0016362997,0.44448778,0.0029171002,0.103615314,0.006672599,0.12160984],"study_design_scores_gemma":[0.0003051472,0.0032899373,0.26750103,0.0003335765,0.0009922701,0.00033416296,0.004397723,0.62977123,0.0019788006,0.086116746,0.0048534055,0.00012594443],"about_ca_topic_score_codex":0.004330807,"about_ca_topic_score_gemma":0.0027844645,"teacher_disagreement_score":0.010951321,"about_ca_system_score_codex":0.0017342725,"about_ca_system_score_gemma":0.0012277378,"threshold_uncertainty_score":0.05679047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9295382,0.00059449853,0.06023303,0.0010983581,0.0000833839,0.00018072588,0.0006830665,0.00012571443,0.007462993],"genre_scores_gemma":[0.9832307,0.00015321102,0.013932215,0.000068666806,0.000020193356,0.000052669107,0.00020318117,0.000021798065,0.0023173245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991961,0.00036422707,0.00001987126,0.000104147446,0.00007833076,0.00023726409],"domain_scores_gemma":[0.9975211,0.0017787338,0.00021495715,0.00008660861,0.00015985705,0.00023867858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017708619,0.0008446045,0.00078229845,0.0005298859,0.00070045976,0.0009847573,0.0012175426,0.0018318178,0.0026335472],"category_scores_gemma":[0.003399435,0.00041904347,0.0009383779,0.0005846265,0.0007587413,0.00093853986,0.0007478616,0.0010355953,0.00016342885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017739512,0.00019109524,0.003228899,0.000053863838,0.00003425832,0.0006149528,0.00006048386,0.9861041,0.00068249134,0.003961765,0.00091001444,0.0039806333],"study_design_scores_gemma":[0.00007389517,0.00015229998,0.00123015,0.000006982259,0.000021214631,0.000106500716,0.00017237746,0.99451727,0.0005531801,0.0024413713,0.0007107883,0.000013872539],"about_ca_topic_score_codex":0.0248605,"about_ca_topic_score_gemma":0.015395302,"teacher_disagreement_score":0.0248605,"about_ca_system_score_codex":0.0020990418,"about_ca_system_score_gemma":0.0013053046,"threshold_uncertainty_score":0.049431622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79314286,0.0012139302,0.19267064,0.0013409121,0.00018367368,0.00023844223,0.001228639,0.00028412972,0.009696764],"genre_scores_gemma":[0.95354074,0.0002453447,0.04267789,0.00007167692,0.00003594774,0.00008838847,0.0003287571,0.00003989395,0.0029714843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995461,0.00019859793,0.00002091066,0.00008920022,0.00004863924,0.00009654414],"domain_scores_gemma":[0.9974692,0.002081715,0.0001454264,0.00006820778,0.000115245995,0.00012031898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013703177,0.0011913553,0.0015898334,0.0007283558,0.00073754275,0.001593334,0.0013577951,0.0034040583,0.0038974965],"category_scores_gemma":[0.0027136663,0.0010270077,0.0012147814,0.0011110589,0.0006915666,0.0010393834,0.00083809247,0.0013501613,0.00016256285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073867755,0.000054737913,0.00044124064,0.00008219485,0.000029138175,0.0001859731,0.000018641336,0.99532473,0.00023857065,0.0006976792,0.00029486246,0.0025582449],"study_design_scores_gemma":[0.000020624087,0.00003141845,0.00020141712,0.000003839509,0.00000967053,0.000020375743,0.000030314404,0.99895084,0.00012471306,0.00048054164,0.00012113059,0.000005098519],"about_ca_topic_score_codex":0.026022445,"about_ca_topic_score_gemma":0.019618656,"teacher_disagreement_score":0.026022445,"about_ca_system_score_codex":0.0010577454,"about_ca_system_score_gemma":0.0017834888,"threshold_uncertainty_score":0.051741958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57199687,0.0013048815,0.3239869,0.006354947,0.00016133855,0.00059527875,0.00030238982,0.00035645216,0.094941],"genre_scores_gemma":[0.99165064,0.00033949214,0.0039326176,0.00010874202,0.000015069736,0.000059660022,0.000033019805,0.000006836765,0.0038539912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984769,0.0007223663,0.000049116265,0.00017913835,0.00025581708,0.00031661513],"domain_scores_gemma":[0.99250996,0.0043907673,0.0013785418,0.0005139749,0.0006814356,0.00052534667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021823084,0.0007240184,0.00067713193,0.00049218023,0.0006827729,0.002278141,0.0011415944,0.0022877608,0.0086085005],"category_scores_gemma":[0.009469866,0.00030448264,0.0004989592,0.00048255292,0.001204746,0.0047811633,0.0021615268,0.0016245138,0.0008050953],"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.00066926767,0.0005436393,0.011057389,0.0006213273,0.00010576616,0.0014162472,0.0010209105,0.43415084,0.0101596825,0.46982807,0.0049567632,0.0654702],"study_design_scores_gemma":[0.00020666397,0.0008189722,0.0019278759,0.00021446987,0.000098256845,0.0005328046,0.0006437754,0.8034802,0.0031554478,0.17634112,0.012499613,0.000080752376],"about_ca_topic_score_codex":0.0025638395,"about_ca_topic_score_gemma":0.003310136,"teacher_disagreement_score":0.0086085005,"about_ca_system_score_codex":0.0013533204,"about_ca_system_score_gemma":0.002515278,"threshold_uncertainty_score":0.028798282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95594317,0.00022996639,0.039268974,0.00015069531,0.00002388292,0.00010932047,0.00010570834,0.00007575889,0.004092387],"genre_scores_gemma":[0.99526274,0.00005730506,0.0038532289,0.000009257507,0.000004109636,0.00002321755,0.000045669283,0.000005912499,0.00073840976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981914,0.00069307565,0.000120509496,0.00021868972,0.00040822267,0.00036795388],"domain_scores_gemma":[0.99361527,0.0033503394,0.0014384901,0.0005593567,0.0006256861,0.00041097784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036237128,0.00057676947,0.0005364287,0.00043284477,0.00052123395,0.0011413384,0.0008678437,0.000851553,0.0035592504],"category_scores_gemma":[0.008950297,0.0002833234,0.00062038976,0.00048810296,0.0005539308,0.002090585,0.0010090186,0.0009941454,0.00023831689],"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.001371967,0.00038429652,0.013476846,0.00014634056,0.00009132744,0.00045247242,0.0002801368,0.9185347,0.010549496,0.01658013,0.00079461234,0.037337657],"study_design_scores_gemma":[0.00008149809,0.00093021034,0.013048614,0.000031809068,0.00008562702,0.00018996678,0.0004639715,0.970698,0.0048481626,0.008166183,0.001394804,0.00006124006],"about_ca_topic_score_codex":0.0019674422,"about_ca_topic_score_gemma":0.001597866,"teacher_disagreement_score":0.0036237128,"about_ca_system_score_codex":0.0012541452,"about_ca_system_score_gemma":0.0009989087,"threshold_uncertainty_score":0.019164205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8859927,0.00041877895,0.08847425,0.00090213225,0.00003069088,0.000090157795,0.00007833455,0.000042634663,0.023970237],"genre_scores_gemma":[0.9972156,0.000056558176,0.0015978456,0.000027234728,0.0000064696114,0.0000063799357,0.000009959555,0.0000024970038,0.0010773835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987847,0.0003261197,0.0000419486,0.00024453347,0.0002985943,0.00030416722],"domain_scores_gemma":[0.99595463,0.0021917354,0.0009511892,0.0002845328,0.00031274025,0.00030511423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018575991,0.0005515855,0.0006241558,0.00034099387,0.00062440126,0.0027364357,0.0012934086,0.0024589428,0.004707856],"category_scores_gemma":[0.0067217285,0.0005347316,0.0009207057,0.00033085697,0.0013616307,0.0032752266,0.0010049877,0.0017206913,0.00023699044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009977765,0.0006616123,0.054253735,0.00022739315,0.0003335947,0.004261351,0.001272069,0.55812746,0.014345695,0.32875165,0.0012836856,0.035483975],"study_design_scores_gemma":[0.000117185504,0.0009870112,0.03450905,0.000040802075,0.00025126734,0.0012507931,0.0013828034,0.834507,0.0032058526,0.12073154,0.0028492622,0.00016738076],"about_ca_topic_score_codex":0.007850397,"about_ca_topic_score_gemma":0.0063789748,"teacher_disagreement_score":0.007850397,"about_ca_system_score_codex":0.0017221072,"about_ca_system_score_gemma":0.0008274675,"threshold_uncertainty_score":0.015749276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9609142,0.00041665314,0.0014316383,0.0006819518,0.0000049292084,0.0000337789,0.000017396977,0.000006556868,0.036492858],"genre_scores_gemma":[0.9982626,0.0000993867,0.00019156448,0.000028004746,0.000004064465,0.000007321488,0.000007738263,0.000003620599,0.0013957942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978951,0.00092620705,0.000073614974,0.00023898519,0.0002970024,0.00056896714],"domain_scores_gemma":[0.9743415,0.019232167,0.0030743596,0.0010543801,0.0010313792,0.0012661107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041166055,0.00022728638,0.0004206155,0.0015117258,0.0017369278,0.005214424,0.0008771431,0.0012745466,0.008817274],"category_scores_gemma":[0.011680584,0.00032116607,0.0004865732,0.00285508,0.0036893426,0.0066627655,0.002578297,0.0015718223,0.00060919084],"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.0024524159,0.0014833119,0.3331026,0.0005183164,0.00025051954,0.0015779973,0.12087321,0.010166664,0.00575255,0.37937573,0.0020366115,0.14241011],"study_design_scores_gemma":[0.00035154846,0.0013163518,0.5459087,0.00047121808,0.00026903537,0.001281005,0.27875447,0.021546744,0.0037761515,0.109590515,0.03660494,0.00012926346],"about_ca_topic_score_codex":0.0057064565,"about_ca_topic_score_gemma":0.005533469,"teacher_disagreement_score":0.008817274,"about_ca_system_score_codex":0.0037225217,"about_ca_system_score_gemma":0.0024189593,"threshold_uncertainty_score":0.02949673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8677508,0.0003639554,0.012404843,0.0018391641,0.00012989958,0.00014733791,0.00016503582,0.00012950166,0.1170694],"genre_scores_gemma":[0.9936766,0.000043795648,0.00063558394,0.00007127824,0.000044529217,0.000012254425,0.000021875645,0.00002215446,0.0054718885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643373,0.00077315007,0.00010221267,0.00040629428,0.0010130961,0.0012715067],"domain_scores_gemma":[0.97229093,0.019669788,0.0014219618,0.0014383517,0.0023002492,0.002878722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050859307,0.00047999632,0.000802368,0.0014938497,0.0016089412,0.009246204,0.0012955021,0.0037782104,0.035178833],"category_scores_gemma":[0.022805,0.0003990744,0.0006291254,0.0006860243,0.0019729226,0.0070621604,0.0024177996,0.0024333445,0.0025576074],"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.015428886,0.0024286814,0.032177873,0.0006425063,0.0002731988,0.0037845583,0.0021842453,0.057499774,0.038864713,0.6364546,0.016568307,0.19369271],"study_design_scores_gemma":[0.0010439771,0.0035856424,0.06006256,0.00025030624,0.000667181,0.0015361548,0.007637219,0.3678707,0.037936926,0.4953343,0.023650283,0.00042471156],"about_ca_topic_score_codex":0.0025622428,"about_ca_topic_score_gemma":0.0022695367,"teacher_disagreement_score":0.035178833,"about_ca_system_score_codex":0.002678954,"about_ca_system_score_gemma":0.0024272995,"threshold_uncertainty_score":0.11768496},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13514075,0.0021675776,0.8319611,0.0033433228,0.00027178842,0.00006022514,0.00022727752,0.00018454269,0.02664335],"genre_scores_gemma":[0.9615582,0.0011487876,0.027395753,0.00018068423,0.00023211536,0.00005244329,0.00013842447,0.00008003986,0.009213539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981419,0.0006071152,0.0001103449,0.00026224976,0.0006718522,0.0002066169],"domain_scores_gemma":[0.9918514,0.004622722,0.0009972608,0.0009597509,0.0009534457,0.0006154112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040256144,0.0010097605,0.001411508,0.0015871851,0.0004991707,0.003583446,0.0014365093,0.0015824406,0.002922056],"category_scores_gemma":[0.021559235,0.00044589394,0.00078182895,0.000959863,0.0030413596,0.0052826214,0.0028171558,0.0024347631,0.00043674847],"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.00013369769,0.00003054572,0.00072727754,0.00009385167,0.000050067447,0.00019597114,0.00011471257,0.038889386,0.0018479744,0.9449212,0.0010165971,0.011978699],"study_design_scores_gemma":[0.000035131285,0.00012151294,0.0010652968,0.000044287324,0.0000423525,0.000574088,0.000091090165,0.2015134,0.001540337,0.79263496,0.0022826795,0.000054861288],"about_ca_topic_score_codex":0.00069166935,"about_ca_topic_score_gemma":0.00022675066,"teacher_disagreement_score":0.0040256144,"about_ca_system_score_codex":0.0020891828,"about_ca_system_score_gemma":0.0010826245,"threshold_uncertainty_score":0.021289706},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019595072,0.0001905302,0.97622025,0.00015554226,0.000022430439,0.00007723155,0.00013810949,0.00040731736,0.0031935938],"genre_scores_gemma":[0.47062933,0.0004620533,0.5240704,0.00012926065,0.000060173035,0.0005637794,0.00075728074,0.00037091193,0.0029567562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917644,0.0004050446,0.000054547912,0.000095194424,0.00020601075,0.000062630934],"domain_scores_gemma":[0.99570197,0.0031700588,0.0002945315,0.00029216916,0.00043355775,0.000107741354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023527762,0.00092193106,0.001040962,0.0010024722,0.00033251962,0.0013974367,0.0009374602,0.0011817463,0.0043256204],"category_scores_gemma":[0.013247695,0.00070708117,0.0005884859,0.00077610544,0.0005874626,0.0012123996,0.0012074386,0.00126477,0.0006124481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002605845,0.000010392604,0.00030133102,0.000033721684,0.000014057612,0.000017979857,0.000013590961,0.9781743,0.00029785535,0.0068342485,0.0004102497,0.013866271],"study_design_scores_gemma":[0.000005453738,0.000007529145,0.00005452134,0.0000107026435,0.0000022737404,0.0000057862003,0.000002850498,0.99320835,0.00023862072,0.0059949523,0.00046635777,0.000002601926],"about_ca_topic_score_codex":0.0028044078,"about_ca_topic_score_gemma":0.0021021413,"teacher_disagreement_score":0.0043256204,"about_ca_system_score_codex":0.00090291625,"about_ca_system_score_gemma":0.0012673959,"threshold_uncertainty_score":0.014470696},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01557644,0.6144159,0.012068281,0.061730485,0.101211354,0.00013804277,0.009204362,0.00040310246,0.18525197],"genre_scores_gemma":[0.14129725,0.44878575,0.0078962855,0.010530429,0.032865956,0.00022064339,0.010276848,0.0004784879,0.34764844],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981793,0.0003544145,0.00016366912,0.00023704187,0.00086332206,0.00020238194],"domain_scores_gemma":[0.99557024,0.00085565256,0.00033616181,0.00040788445,0.0023660464,0.0004640783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00365366,0.0011443719,0.0008020228,0.0048259487,0.00089295796,0.0038082877,0.0006381454,0.0012972307,0.0411052],"category_scores_gemma":[0.0072208103,0.00044419445,0.00063736463,0.00788645,0.0015243734,0.0027829926,0.0021271533,0.0016022332,0.014781255],"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.00040030817,0.00010566291,0.0030389477,0.0009829506,0.00013349314,0.00011741483,0.00016446877,0.0028839787,0.0008881483,0.02774525,0.50718814,0.4563513],"study_design_scores_gemma":[0.00000966858,0.000039770148,0.0034965407,0.0005819273,0.000028374207,0.00004971529,0.00012560032,0.000306011,0.00029218354,0.0025957767,0.99246395,0.000010440698],"about_ca_topic_score_codex":0.008914749,"about_ca_topic_score_gemma":0.010616418,"teacher_disagreement_score":0.0411052,"about_ca_system_score_codex":0.0043834727,"about_ca_system_score_gemma":0.003409647,"threshold_uncertainty_score":0.13751066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35041857,0.0027223488,0.61302996,0.0033692874,0.00045902625,0.0006350089,0.00064698706,0.0005016215,0.028217262],"genre_scores_gemma":[0.9635215,0.00056413974,0.027368361,0.00016860229,0.000060280036,0.000102049,0.00016465847,0.00008406034,0.007966294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987501,0.00050179794,0.00005412861,0.0002651892,0.00013638045,0.00029241145],"domain_scores_gemma":[0.99672395,0.0021436855,0.00037428451,0.00013240874,0.00025807426,0.00036760044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00287036,0.0013793894,0.0020444228,0.00087143126,0.00067246915,0.002709531,0.0018220657,0.0029488264,0.007035494],"category_scores_gemma":[0.0083109,0.0017219572,0.0013188287,0.00074019056,0.0020101268,0.0038112155,0.0014486016,0.0025432524,0.00051437353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031694007,0.00014940253,0.0009458443,0.00015334686,0.000053186443,0.00028094603,0.000110289715,0.9593129,0.0009768569,0.028099295,0.001346054,0.008255069],"study_design_scores_gemma":[0.000033210144,0.000080243604,0.00030396844,0.000018542105,0.000020748592,0.000037861293,0.000080836486,0.9847494,0.00026116744,0.013799595,0.0005945011,0.000019906664],"about_ca_topic_score_codex":0.0071884706,"about_ca_topic_score_gemma":0.003927229,"teacher_disagreement_score":0.0071884706,"about_ca_system_score_codex":0.0024465711,"about_ca_system_score_gemma":0.0021938037,"threshold_uncertainty_score":0.023536086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009104054,0.000067405585,0.997874,0.000057537716,0.000016312786,0.000013089742,0.000013225941,0.00006848051,0.0009795728],"genre_scores_gemma":[0.14088102,0.00044640232,0.8544475,0.0001530035,0.00007361723,0.00023622822,0.00013844839,0.00014301809,0.0034808943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992962,0.00022344234,0.000031590982,0.00010880772,0.000279932,0.000059976373],"domain_scores_gemma":[0.99911135,0.000521017,0.000079857644,0.00009046296,0.00015844796,0.000038910828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000995476,0.00091445766,0.00077910395,0.00053265126,0.00033781095,0.0009904819,0.0015182211,0.00076475093,0.0029402869],"category_scores_gemma":[0.0031437057,0.00052388327,0.0010321499,0.0009331146,0.0008235909,0.00084227585,0.0013386332,0.0029682287,0.0007250811],"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.0000372244,0.00004094145,0.00022713983,0.00014191658,0.000025110923,0.000055602948,0.000068055895,0.9034121,0.0030484963,0.044489827,0.0013100822,0.047143407],"study_design_scores_gemma":[0.0000038319968,0.000028637409,0.000019108636,0.000008277153,0.0000041708827,0.000020788133,0.00000649338,0.992619,0.00078426104,0.004782602,0.0017190339,0.0000039066],"about_ca_topic_score_codex":0.002244214,"about_ca_topic_score_gemma":0.001378159,"teacher_disagreement_score":0.0029402869,"about_ca_system_score_codex":0.00083121296,"about_ca_system_score_gemma":0.0010333394,"threshold_uncertainty_score":0.0098362565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03812786,0.00058451394,0.957712,0.000600064,0.000069133916,0.000038440197,0.00010522861,0.0002006735,0.0025621082],"genre_scores_gemma":[0.8825832,0.0004968184,0.11161972,0.0001282063,0.00011766556,0.00016567665,0.00022501723,0.000122064026,0.004541831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996743,0.00017080623,0.000016690688,0.00004867963,0.000056130353,0.000033419616],"domain_scores_gemma":[0.99741757,0.0021268122,0.00012137752,0.00009765074,0.00018453084,0.000052060834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018676433,0.00059512904,0.001877295,0.00053036667,0.00036151544,0.0011691588,0.0011676557,0.0016993913,0.002603797],"category_scores_gemma":[0.008076629,0.0009753714,0.0006605463,0.0010331671,0.0007547785,0.0017688196,0.00094549736,0.0014777425,0.00028869946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007241717,0.000019450801,0.0001020174,0.000036650166,0.000016445065,0.000022209108,0.00001338292,0.98361963,0.00025818072,0.007852059,0.00042866942,0.007558903],"study_design_scores_gemma":[0.0000033200233,0.0000027362087,0.000010596602,0.0000015025164,0.0000011568724,0.0000012803443,0.0000010119301,0.9990305,0.000030241627,0.0008904608,0.000026043224,0.0000011000666],"about_ca_topic_score_codex":0.009637356,"about_ca_topic_score_gemma":0.0055726306,"teacher_disagreement_score":0.009637356,"about_ca_system_score_codex":0.0008130969,"about_ca_system_score_gemma":0.0013896642,"threshold_uncertainty_score":0.019162536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.829678,0.0017375202,0.15526454,0.0007608816,0.00035691998,0.00014587832,0.00016066461,0.0011389954,0.010756671],"genre_scores_gemma":[0.98933476,0.00010337274,0.009441827,0.00004913467,0.000029318031,0.000021042584,0.00005746107,0.000025877538,0.00093717146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988219,0.0002564801,0.00009880657,0.00029128016,0.00029048097,0.00024095546],"domain_scores_gemma":[0.9962514,0.0018244194,0.00042201695,0.000572335,0.00054345065,0.0003864103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002111364,0.0012296641,0.0008895293,0.0009204705,0.0003372533,0.0018101619,0.0011563038,0.0012829675,0.0023916091],"category_scores_gemma":[0.01182242,0.00019476058,0.00037495125,0.000509157,0.00036858016,0.0021839277,0.00108936,0.0011685153,0.0005227966],"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.0032839421,0.0017865214,0.014085619,0.00018544869,0.00042372724,0.00040380523,0.00022139323,0.4357312,0.028371487,0.02216756,0.004269111,0.48907018],"study_design_scores_gemma":[0.00008128913,0.0016334337,0.0036349203,0.000029930277,0.00012965314,0.00013663899,0.00009352512,0.9722072,0.006682127,0.014221962,0.0011077079,0.000041564577],"about_ca_topic_score_codex":0.001263495,"about_ca_topic_score_gemma":0.001348713,"teacher_disagreement_score":0.0023916091,"about_ca_system_score_codex":0.0005290474,"about_ca_system_score_gemma":0.0012719647,"threshold_uncertainty_score":0.011166096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028493503,0.0002647309,0.9678871,0.000174409,0.000019504316,0.00004716609,0.00007885414,0.00024317039,0.0027916483],"genre_scores_gemma":[0.93943805,0.00019133158,0.058720455,0.000054024396,0.000018490373,0.00009351338,0.000094662355,0.0000729441,0.0013165061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939585,0.00021930572,0.00002544169,0.00013661527,0.00014472114,0.000077936405],"domain_scores_gemma":[0.99844944,0.0011121003,0.00021407305,0.000075954675,0.00011327267,0.000035019864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015310256,0.0010579227,0.0007973603,0.0004117947,0.00026542254,0.0009137057,0.00080278364,0.000724057,0.001465632],"category_scores_gemma":[0.0032819442,0.00059858203,0.0005875768,0.00064342003,0.00087289844,0.0009317017,0.0007289637,0.001050617,0.00016711137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012404573,0.000004775106,0.000038970735,0.000010316354,0.000005739201,0.000006683901,0.0000052119794,0.99627715,0.00033206222,0.0014031848,0.000054323024,0.0018492184],"study_design_scores_gemma":[0.000002619037,0.0000072932626,0.000024632587,0.0000010647727,0.0000013164914,0.0000012419131,0.0000013451853,0.99859947,0.00011538297,0.0011987952,0.00004537895,0.0000014366573],"about_ca_topic_score_codex":0.0055133826,"about_ca_topic_score_gemma":0.0034368755,"teacher_disagreement_score":0.0055133826,"about_ca_system_score_codex":0.0011669836,"about_ca_system_score_gemma":0.001058395,"threshold_uncertainty_score":0.010962546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1573339,0.0018024981,0.801392,0.002330304,0.00015140888,0.0003425068,0.00096045353,0.00038393473,0.0353029],"genre_scores_gemma":[0.94577104,0.0007171333,0.04777737,0.00012567051,0.000044981705,0.00019167438,0.00034644696,0.00012406246,0.0049015908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973379,0.0012556803,0.0000819057,0.000272714,0.00047465475,0.00057720346],"domain_scores_gemma":[0.9922031,0.005949988,0.0005768928,0.00026351394,0.0004918396,0.000514769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036638426,0.0013005505,0.0013574376,0.0011213853,0.0010253687,0.0023226254,0.0018932852,0.0014411577,0.005702597],"category_scores_gemma":[0.014197938,0.0008543798,0.0008663032,0.0022151393,0.001938465,0.003100326,0.0017498527,0.0024876453,0.00036707585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036446352,0.00001571569,0.00016448187,0.00003112508,0.000011887265,0.000068024485,0.000037099257,0.97281265,0.00012192683,0.022538945,0.00055077195,0.0036109865],"study_design_scores_gemma":[0.000008182186,0.00002478545,0.00010886469,0.00001644718,0.0000053197236,0.000019273719,0.000049378705,0.968538,0.0001541982,0.030263202,0.00080235966,0.000010051639],"about_ca_topic_score_codex":0.011756228,"about_ca_topic_score_gemma":0.007490795,"teacher_disagreement_score":0.011756228,"about_ca_system_score_codex":0.0036181116,"about_ca_system_score_gemma":0.0027456356,"threshold_uncertainty_score":0.026251316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5504758,0.00039402678,0.44535798,0.00046094874,0.00011862649,0.000076035285,0.000057101926,0.0005152802,0.0025441626],"genre_scores_gemma":[0.98512715,0.00006459863,0.013513427,0.000046733476,0.000041951345,0.000027060703,0.000034824156,0.00002198757,0.0011222251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832493,0.000494839,0.00008219438,0.0005123362,0.0002876386,0.00029801857],"domain_scores_gemma":[0.98597753,0.009640194,0.0011198461,0.0011859331,0.0009624876,0.0011139313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026242638,0.0008426548,0.0014940042,0.0006582641,0.0011394834,0.001465334,0.0026551243,0.0015420795,0.0020771143],"category_scores_gemma":[0.012357777,0.00053739775,0.0005463598,0.00072158925,0.0011165682,0.0026877285,0.0024558557,0.0013137283,0.0003137959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015928836,0.00054829917,0.006705625,0.000110287954,0.00014947624,0.0005366805,0.00086986617,0.89830047,0.0044494057,0.0053389934,0.00092232256,0.08047574],"study_design_scores_gemma":[0.00002335771,0.00017323554,0.000603917,0.0000041740345,0.000027775106,0.000051961095,0.000078754354,0.9939889,0.0009069305,0.0038858652,0.00024556942,0.000009513781],"about_ca_topic_score_codex":0.0048908843,"about_ca_topic_score_gemma":0.004688464,"teacher_disagreement_score":0.0048908843,"about_ca_system_score_codex":0.00073904527,"about_ca_system_score_gemma":0.0013406293,"threshold_uncertainty_score":0.013878584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027759906,0.0006809315,0.98917973,0.0005171717,0.00008201822,0.000109790606,0.00020443276,0.00015140242,0.006298504],"genre_scores_gemma":[0.12967856,0.0010307775,0.8548728,0.00029819028,0.00023001619,0.00086261594,0.00080057,0.00041501666,0.011811393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815434,0.0007870439,0.000101604775,0.00031692124,0.00043282195,0.00020730792],"domain_scores_gemma":[0.9942206,0.0045324797,0.0002202676,0.00019836421,0.0006642845,0.00016409003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042003207,0.0023534736,0.0023128926,0.0020265798,0.0010925313,0.002843368,0.0032297217,0.0032535456,0.014080471],"category_scores_gemma":[0.009990671,0.0011847465,0.001724789,0.0024164729,0.0011419121,0.002137421,0.0038126588,0.0038208938,0.0018129124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010814467,0.00017848688,0.00067351514,0.00054523203,0.00014408368,0.00012159403,0.00018820248,0.8292216,0.0006549443,0.08767601,0.009561946,0.07092624],"study_design_scores_gemma":[0.000027117721,0.000030129697,0.00009345533,0.000044542776,0.000015440795,0.000019639114,0.000058323054,0.96384245,0.00017995853,0.03331209,0.0023683703,0.000008557606],"about_ca_topic_score_codex":0.010714829,"about_ca_topic_score_gemma":0.012823501,"teacher_disagreement_score":0.014080471,"about_ca_system_score_codex":0.002458979,"about_ca_system_score_gemma":0.0036676133,"threshold_uncertainty_score":0.047103822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008876169,0.00030070063,0.98735076,0.00047356638,0.000057173445,0.00003913284,0.000108257074,0.00005419757,0.002740025],"genre_scores_gemma":[0.63231164,0.0007527728,0.358691,0.00026235415,0.0001710481,0.00023725469,0.0004066363,0.00007669861,0.00709068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908864,0.00033582046,0.000042642776,0.00020433892,0.00021783424,0.00011069051],"domain_scores_gemma":[0.99803966,0.0013236548,0.0001693744,0.0001186427,0.0002598906,0.000088777284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020790256,0.0006153367,0.0017515544,0.0010091584,0.00063842244,0.0022948189,0.00308316,0.0021047466,0.0028154135],"category_scores_gemma":[0.0045728134,0.0010211787,0.0013572023,0.001863408,0.0011339854,0.0022592323,0.001943295,0.0017015468,0.0002698365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019764533,0.0000302439,0.00033333988,0.00004400999,0.000021496224,0.000052709645,0.000029542063,0.97145957,0.0002582539,0.020246498,0.00063040445,0.006874136],"study_design_scores_gemma":[0.0000012477332,0.0000026220052,0.00001966879,0.0000020744894,0.0000019395245,0.0000051261663,0.000005054915,0.99765575,0.00003006171,0.0021593529,0.0001152603,0.0000016793383],"about_ca_topic_score_codex":0.010586429,"about_ca_topic_score_gemma":0.0075912564,"teacher_disagreement_score":0.010586429,"about_ca_system_score_codex":0.0020249584,"about_ca_system_score_gemma":0.0016962934,"threshold_uncertainty_score":0.021049619},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044991303,0.0010040352,0.9451981,0.00041271004,0.00020970292,0.00024741722,0.0006436617,0.006214312,0.0010787867],"genre_scores_gemma":[0.45355123,0.00031451933,0.53911346,0.0004353651,0.00023283644,0.0005220185,0.0029976503,0.00054011814,0.002292869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814725,0.00062537397,0.0001360693,0.000420722,0.00042974687,0.00024080121],"domain_scores_gemma":[0.99173707,0.004812093,0.00032487113,0.00081710145,0.0021170697,0.00019187148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029736084,0.0013813378,0.002386266,0.0016852708,0.0007059826,0.0019273702,0.002575733,0.0019203951,0.0039133253],"category_scores_gemma":[0.014828876,0.00068062893,0.0010603449,0.0016914724,0.00062491,0.0018333172,0.001298823,0.0023557418,0.0020703666],"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.00084625644,0.0006193943,0.0036545973,0.00025127656,0.0001671647,0.000120670906,0.000101927915,0.14347777,0.012487213,0.0025172739,0.018202648,0.8175539],"study_design_scores_gemma":[0.000036571942,0.00010729714,0.0004142941,0.000011694113,0.000027713919,0.000054539454,0.000020266134,0.99387276,0.0031969654,0.0016372529,0.0006065773,0.000014016899],"about_ca_topic_score_codex":0.005335851,"about_ca_topic_score_gemma":0.005245578,"teacher_disagreement_score":0.005335851,"about_ca_system_score_codex":0.0008952253,"about_ca_system_score_gemma":0.0024685583,"threshold_uncertainty_score":0.01572609},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2042934,0.002293425,0.38352266,0.077411085,0.008700512,0.00047543438,0.0007427902,0.0009796993,0.32158092],"genre_scores_gemma":[0.93292356,0.0004447563,0.02914529,0.0041878843,0.001247689,0.00014738043,0.00010220472,0.0002335243,0.031567678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98693174,0.004637785,0.00073530007,0.0019015595,0.0029567287,0.002836898],"domain_scores_gemma":[0.94240344,0.038666345,0.004195039,0.004538155,0.005422921,0.0047741095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02551308,0.00092277257,0.0019103587,0.0013558697,0.0028969406,0.008651712,0.0034856645,0.011036916,0.016838234],"category_scores_gemma":[0.0894875,0.0011630728,0.0015208604,0.00091470213,0.0041297358,0.01163653,0.003435703,0.016659759,0.0015577378],"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.00048004597,0.00019303936,0.0006346069,0.00010735153,0.000025094629,0.0001834409,0.00024024365,0.024552831,0.0009766544,0.9345028,0.016688004,0.021415846],"study_design_scores_gemma":[0.00030109723,0.0003140367,0.0014574657,0.00015048157,0.00005589381,0.00019726195,0.0005512062,0.071656905,0.0011354012,0.88850814,0.035507772,0.00016435611],"about_ca_topic_score_codex":0.0067050797,"about_ca_topic_score_gemma":0.0052944436,"teacher_disagreement_score":0.02551308,"about_ca_system_score_codex":0.0049540484,"about_ca_system_score_gemma":0.011546607,"threshold_uncertainty_score":0.13492769},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032403453,0.9589746,0.010183926,0.015196473,0.00043285746,0.00016106442,0.00009210097,0.000021736523,0.0116969375],"genre_scores_gemma":[0.069250345,0.9143268,0.013575362,0.0013661346,0.0005138339,0.00021820723,0.00010881761,0.000012145195,0.00062843953],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9890493,0.0056288126,0.0010945782,0.0009453504,0.0025478154,0.000734104],"domain_scores_gemma":[0.9022043,0.08303116,0.005240492,0.0012738105,0.0073172436,0.0009329925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02327229,0.0019283189,0.0017754439,0.017941609,0.002397919,0.012611368,0.0035237884,0.004729882,0.005250945],"category_scores_gemma":[0.03305232,0.0008741757,0.0012470678,0.039790194,0.006638418,0.013514949,0.0037028755,0.0036299354,0.0006161806],"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.00011519044,0.0004285317,0.0034046562,0.064690106,0.00036420106,0.00024457878,0.0060788696,0.0075232293,0.00036627805,0.372089,0.008052234,0.53664315],"study_design_scores_gemma":[0.00008222837,0.0003864601,0.0095855165,0.23947433,0.0011823328,0.0006488957,0.04023159,0.009929733,0.0011873537,0.27770263,0.41937077,0.00021813727],"about_ca_topic_score_codex":0.012177676,"about_ca_topic_score_gemma":0.014610678,"teacher_disagreement_score":0.02327229,"about_ca_system_score_codex":0.010933435,"about_ca_system_score_gemma":0.029468944,"threshold_uncertainty_score":0.123077095},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039892974,0.00010037901,0.9930821,0.00013605287,0.000047276837,0.00006899718,0.00004609029,0.0002045292,0.002325253],"genre_scores_gemma":[0.0957781,0.00016792223,0.89927924,0.00011028794,0.000039583465,0.00036471637,0.00016819534,0.00013753412,0.0039544175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999548,0.0001237571,0.000020423693,0.000109332505,0.00013363647,0.00006483151],"domain_scores_gemma":[0.9993845,0.00040459246,0.00004505506,0.0000327746,0.00009212513,0.000040980325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092974544,0.0009861713,0.0012624069,0.0010447511,0.0007065097,0.0012267599,0.001603828,0.0015960733,0.006621716],"category_scores_gemma":[0.0020703578,0.0009949333,0.00085981726,0.0012761676,0.00052030646,0.0015904383,0.0017456083,0.0016833089,0.00087322743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012738763,0.0001776278,0.00023436698,0.00012872867,0.000039838676,0.00005557961,0.00006622057,0.8145652,0.0026455573,0.027977701,0.003203415,0.1507784],"study_design_scores_gemma":[0.000035122277,0.000036328904,0.000031868287,0.0000080462605,0.000005864709,0.000016923357,0.0000076260276,0.99348843,0.00031121552,0.0048568733,0.0011957659,0.0000059796103],"about_ca_topic_score_codex":0.003338587,"about_ca_topic_score_gemma":0.003957822,"teacher_disagreement_score":0.006621716,"about_ca_system_score_codex":0.00087120704,"about_ca_system_score_gemma":0.0018507139,"threshold_uncertainty_score":0.022151828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022284687,0.00025204895,0.9921456,0.0007186557,0.00010862947,0.00004045379,0.000084124666,0.00005979292,0.004362204],"genre_scores_gemma":[0.4627732,0.0013252903,0.5151658,0.00063021266,0.0007409675,0.00063857605,0.00032482343,0.00018839144,0.018212682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910691,0.0043727946,0.0004719669,0.0013306035,0.0018212154,0.0009342802],"domain_scores_gemma":[0.9886845,0.0069850413,0.00096183777,0.0012763832,0.0014054679,0.0006867792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015325964,0.0020193069,0.0025290705,0.0019124936,0.0015306904,0.0067726276,0.004936458,0.003858938,0.009014322],"category_scores_gemma":[0.02580277,0.0011685904,0.0025908253,0.002582423,0.0045687975,0.008747749,0.0039735963,0.005485655,0.001130829],"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.00002284077,0.000018130331,0.00006882715,0.000030570387,0.00003129278,0.000054294054,0.00006847302,0.078456596,0.0001350331,0.91608703,0.0007627613,0.0042642197],"study_design_scores_gemma":[0.00001706269,0.000025628668,0.000041122352,0.00001974951,0.000021478389,0.000028603743,0.000020319918,0.18396373,0.00009146314,0.8133994,0.0023535644,0.000017973767],"about_ca_topic_score_codex":0.0056431736,"about_ca_topic_score_gemma":0.0039451933,"teacher_disagreement_score":0.015325964,"about_ca_system_score_codex":0.0041589285,"about_ca_system_score_gemma":0.0044407607,"threshold_uncertainty_score":0.08105242},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009005292,0.00008470166,0.9891059,0.00007079121,0.000028440421,0.000053512966,0.00006739854,0.00025519653,0.0013286702],"genre_scores_gemma":[0.33713186,0.00024229901,0.6597709,0.00007510613,0.000023234597,0.00026457713,0.00030897558,0.00018149194,0.0020016283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835557,0.0009062038,0.00009616466,0.00016319299,0.0003516675,0.00012711131],"domain_scores_gemma":[0.99263304,0.00613452,0.00031725224,0.00019813684,0.00053056545,0.00018648358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003054234,0.0011709377,0.001129522,0.0014886559,0.00053079054,0.0019339821,0.0009218995,0.0013761229,0.00536792],"category_scores_gemma":[0.0109784175,0.0009240813,0.0016584678,0.0010435112,0.0008105599,0.0018032762,0.0016796292,0.0017154989,0.00050600275],"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.000067301335,0.000077044075,0.0005152106,0.000115871815,0.000044246364,0.000102343154,0.000074369294,0.9325244,0.0011158454,0.033353426,0.00039325864,0.031616814],"study_design_scores_gemma":[0.000012116127,0.000017428232,0.00002844572,0.000013433668,0.000010184167,0.000009584682,0.0000063804837,0.9801051,0.00029820713,0.01892891,0.0005649546,0.0000051125326],"about_ca_topic_score_codex":0.0057891784,"about_ca_topic_score_gemma":0.0077551515,"teacher_disagreement_score":0.0057891784,"about_ca_system_score_codex":0.00082351913,"about_ca_system_score_gemma":0.001885935,"threshold_uncertainty_score":0.017957449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16854306,0.0005590039,0.82169247,0.0011369484,0.0001430764,0.00016844505,0.00008677029,0.0008083825,0.0068618897],"genre_scores_gemma":[0.9776299,0.00006981117,0.019756641,0.00010419227,0.000027932814,0.00006495633,0.00003419053,0.000047451602,0.002264855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877363,0.0005187158,0.00005315637,0.00022021738,0.00021753619,0.00021679951],"domain_scores_gemma":[0.9898733,0.008100333,0.0006142661,0.00037987862,0.0005808515,0.00045138702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003467361,0.0012802967,0.0017087148,0.0006497276,0.00047725867,0.0015600355,0.0015823804,0.0024176454,0.0035683196],"category_scores_gemma":[0.015232841,0.0006980657,0.00037392572,0.0004918658,0.0016002989,0.0021649224,0.00195505,0.0028238504,0.0004110262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012332288,0.000070350005,0.00043154854,0.00002592078,0.000018762139,0.0000395483,0.000025791227,0.9839289,0.00047479128,0.004108711,0.00044681015,0.010305581],"study_design_scores_gemma":[0.000010004762,0.000013901792,0.000032419382,0.0000026311252,0.000002115524,0.0000031370162,0.0000020670068,0.99745876,0.000088354755,0.0023500018,0.000034556168,0.0000020416205],"about_ca_topic_score_codex":0.004910865,"about_ca_topic_score_gemma":0.0037129284,"teacher_disagreement_score":0.004910865,"about_ca_system_score_codex":0.0014009038,"about_ca_system_score_gemma":0.0017924792,"threshold_uncertainty_score":0.018337429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.827879,0.0012351269,0.0036785037,0.0060398695,0.000093852665,0.000091652684,0.00018488309,0.00004681554,0.16075034],"genre_scores_gemma":[0.9954815,0.0002504576,0.00018906739,0.000074679076,0.00003267008,0.000008984238,0.000021221798,0.0000033124845,0.0039382023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987318,0.0004989726,0.00003915015,0.00014250138,0.00014940383,0.000438143],"domain_scores_gemma":[0.9874161,0.008283398,0.0018499303,0.0004230377,0.0006141644,0.0014134176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024689247,0.00030344055,0.000304,0.000997764,0.0012727464,0.006124711,0.00053172605,0.0017910235,0.0351391],"category_scores_gemma":[0.012930999,0.00016860467,0.0004069791,0.0010031095,0.0028206152,0.007940469,0.0031411573,0.0012817304,0.00077173504],"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.002292728,0.0017896605,0.13386519,0.00042651183,0.00012553029,0.0012786604,0.0045925346,0.015085797,0.0024979743,0.6367181,0.007296723,0.19403066],"study_design_scores_gemma":[0.0007121813,0.0016808059,0.16488233,0.0012140868,0.0005326464,0.0006553505,0.03498671,0.04081475,0.009086147,0.6582593,0.08704625,0.00012945727],"about_ca_topic_score_codex":0.0036403963,"about_ca_topic_score_gemma":0.004053535,"teacher_disagreement_score":0.0351391,"about_ca_system_score_codex":0.002391583,"about_ca_system_score_gemma":0.0031271887,"threshold_uncertainty_score":0.11755204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029194178,0.0009818844,0.95337975,0.00036074826,0.00035491496,0.00032848667,0.000121861434,0.00045369042,0.014824556],"genre_scores_gemma":[0.30533347,0.0006993801,0.6846052,0.000321862,0.00021329097,0.00063542306,0.00024541304,0.00017552031,0.0077704643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917054,0.00030321578,0.00002828726,0.00010295689,0.0002842338,0.00011084949],"domain_scores_gemma":[0.998505,0.0010023225,0.00007644938,0.000059783437,0.00024490576,0.00011161755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014561164,0.0013039185,0.001621529,0.0014363424,0.00095549604,0.0015270822,0.00245685,0.0025752466,0.0047580083],"category_scores_gemma":[0.0033017069,0.0008047386,0.00092397036,0.0018701339,0.0010498171,0.0011537666,0.0013708945,0.001413155,0.00075548736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017276978,0.00014915234,0.00026351307,0.00012843692,0.000058185957,0.000086422755,0.00006694149,0.9012002,0.0013616391,0.021178693,0.0034627966,0.07187119],"study_design_scores_gemma":[0.000044032215,0.00005687502,0.00003398424,0.000006979051,0.0000074369295,0.000018604804,0.000008782564,0.9966954,0.00012768513,0.0021088943,0.00088526297,0.000005994303],"about_ca_topic_score_codex":0.012632691,"about_ca_topic_score_gemma":0.010620281,"teacher_disagreement_score":0.012632691,"about_ca_system_score_codex":0.0013173493,"about_ca_system_score_gemma":0.0020241444,"threshold_uncertainty_score":0.025118351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027345408,0.0002107851,0.96029466,0.00041015877,0.000086628635,0.00009452929,0.00015695291,0.00012358431,0.011277201],"genre_scores_gemma":[0.8205436,0.000382742,0.15332505,0.00022636709,0.00007890321,0.00048570175,0.00021648787,0.00007937772,0.02466175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924797,0.00029308753,0.000023503562,0.00012889145,0.00015666436,0.0001498936],"domain_scores_gemma":[0.99925166,0.00041678842,0.00006523588,0.000030203124,0.00012611417,0.00010989041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014136322,0.0009536031,0.0015398088,0.00060509134,0.00062048854,0.0018919396,0.0026856062,0.0025572607,0.005277317],"category_scores_gemma":[0.00214467,0.00058271724,0.0009043425,0.0009131892,0.0010574854,0.001975899,0.0017591572,0.0017600316,0.00045015098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037500435,0.000041040785,0.00012542095,0.000021740918,0.000017491375,0.00006326343,0.00003166671,0.97185856,0.00044397239,0.022714233,0.00061308104,0.0040319976],"study_design_scores_gemma":[0.000011178713,0.000013295234,0.000023575054,0.0000017798175,0.000004397183,0.0000073333194,0.000004681746,0.996561,0.000028342614,0.0030649356,0.00027601077,0.000003461746],"about_ca_topic_score_codex":0.014011206,"about_ca_topic_score_gemma":0.012281324,"teacher_disagreement_score":0.014011206,"about_ca_system_score_codex":0.0017339274,"about_ca_system_score_gemma":0.0026653416,"threshold_uncertainty_score":0.02785927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001529631,0.99582666,0.00023502424,0.0018124039,0.0005719409,0.0000036261563,0.000054084965,0.0000063900097,0.0013368488],"genre_scores_gemma":[0.0013457751,0.9967152,0.00019040762,0.000754725,0.0005345423,0.0000056376807,0.00006035658,0.0000043977757,0.00038910145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894506,0.00029390934,0.00015491803,0.00018712095,0.00034035768,0.00007862651],"domain_scores_gemma":[0.9921554,0.005510983,0.00058312033,0.00028107243,0.001218206,0.00025124673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021449162,0.0009093388,0.0017360011,0.006390113,0.00068345416,0.0026799901,0.0012758335,0.0016113695,0.007966131],"category_scores_gemma":[0.010368156,0.0005846669,0.00096453336,0.011256894,0.0014133509,0.0055889604,0.001813559,0.002308065,0.002450877],"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.000090577196,0.000065097425,0.0005999258,0.03266796,0.00016257347,0.00020402757,0.00035688054,0.0008805225,0.00030931743,0.033106975,0.0909184,0.84063774],"study_design_scores_gemma":[0.000005973008,0.0000416787,0.00084302196,0.016996,0.00009229115,0.00028617185,0.00023569935,0.00008229779,0.000089478264,0.0072171786,0.9740865,0.000023667859],"about_ca_topic_score_codex":0.0027544925,"about_ca_topic_score_gemma":0.004396492,"teacher_disagreement_score":0.007966131,"about_ca_system_score_codex":0.0018360777,"about_ca_system_score_gemma":0.00424285,"threshold_uncertainty_score":0.026649356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012106161,0.0009182478,0.9831836,0.00036438397,0.000035607387,0.000035135876,0.000057226203,0.00007673568,0.0032228858],"genre_scores_gemma":[0.90217954,0.0013483409,0.08979087,0.00017435994,0.0000951462,0.00013047604,0.00012646352,0.00008879823,0.0060659405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977639,0.0010124497,0.00009503419,0.0004127735,0.0004884666,0.00022737765],"domain_scores_gemma":[0.9963387,0.0023248328,0.000513535,0.00025219255,0.00037634574,0.00019432645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045237914,0.001513467,0.0021035923,0.00073615875,0.00027761588,0.0023768807,0.001734388,0.0019003747,0.0027598813],"category_scores_gemma":[0.011331738,0.00074391335,0.00092832337,0.00070750143,0.0014600515,0.002194783,0.0018188562,0.0017655846,0.00044624836],"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.00019331579,0.00004055719,0.00047678134,0.00018260615,0.00008957636,0.00012912496,0.00006911759,0.8484553,0.0023297553,0.12802894,0.000824709,0.019180253],"study_design_scores_gemma":[0.000023801656,0.00009288443,0.00012260699,0.00002000195,0.00001941353,0.00004766966,0.000011037112,0.96064603,0.00064449426,0.03766139,0.0006945102,0.000016195338],"about_ca_topic_score_codex":0.0015370548,"about_ca_topic_score_gemma":0.0005041896,"teacher_disagreement_score":0.0045237914,"about_ca_system_score_codex":0.001940312,"about_ca_system_score_gemma":0.0011852093,"threshold_uncertainty_score":0.02392441},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006508586,0.0012893467,0.97642547,0.00094317447,0.00018255827,0.00007172926,0.000115814226,0.000060733237,0.014402604],"genre_scores_gemma":[0.2068775,0.0050098086,0.7673324,0.0009495003,0.0004481349,0.0005567444,0.000496597,0.00043648426,0.017892877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909115,0.00039658346,0.00006761632,0.00014210891,0.00021104574,0.00009147074],"domain_scores_gemma":[0.99796367,0.0013201617,0.00014366864,0.0001485266,0.00035129485,0.00007262478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024891803,0.0011607606,0.0010230805,0.0013257023,0.00043514604,0.0025077523,0.0020647685,0.0029432871,0.009013445],"category_scores_gemma":[0.010432634,0.00078550045,0.0015841797,0.0020196952,0.0013063089,0.0036812064,0.0014298162,0.0025926384,0.0008765888],"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.000104630184,0.00014970955,0.00030187337,0.0004192146,0.000059527512,0.00008212408,0.00013443599,0.32022756,0.0020197611,0.5656199,0.008884915,0.10199644],"study_design_scores_gemma":[0.000048207483,0.000063268264,0.00023672747,0.0001268563,0.000035939596,0.00011243359,0.00008234458,0.7712562,0.0010617345,0.22122192,0.0057157436,0.000038646205],"about_ca_topic_score_codex":0.0015228993,"about_ca_topic_score_gemma":0.0017684165,"teacher_disagreement_score":0.009013445,"about_ca_system_score_codex":0.0013531871,"about_ca_system_score_gemma":0.0013586909,"threshold_uncertainty_score":0.030152977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43400347,0.0006510636,0.55701864,0.00021981359,0.000074171774,0.00010440801,0.00016273352,0.0005898811,0.007175769],"genre_scores_gemma":[0.98021793,0.000063628395,0.017700184,0.000014099871,0.000009149046,0.000024371338,0.000047530284,0.000016306967,0.0019069486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979585,0.000040317882,0.000009208332,0.00004495615,0.00004703458,0.000062649444],"domain_scores_gemma":[0.99978775,0.000074289324,0.000052013133,0.000026726157,0.000038867936,0.000020397229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037510178,0.0005918818,0.00077673135,0.00038692614,0.0006135362,0.00074101426,0.0007931896,0.00047878036,0.001962516],"category_scores_gemma":[0.000542071,0.00031944166,0.0003799912,0.00071487844,0.00034671358,0.0005617734,0.00051509356,0.00032824016,0.0002737564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015842971,0.000079865575,0.00046476972,0.00005703448,0.000025653842,0.00004034211,0.000025155516,0.9537526,0.0054497835,0.0016112672,0.00052584306,0.037809283],"study_design_scores_gemma":[0.0000059712524,0.00009792554,0.00031087775,0.000002585265,0.000007432988,0.00001198588,0.000011553297,0.99760455,0.0010943185,0.0005994506,0.0002491454,0.000004248016],"about_ca_topic_score_codex":0.0046189236,"about_ca_topic_score_gemma":0.0042861504,"teacher_disagreement_score":0.0046189236,"about_ca_system_score_codex":0.0006104489,"about_ca_system_score_gemma":0.0008397147,"threshold_uncertainty_score":0.0091840625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007288498,0.00018369821,0.98567504,0.00023301004,0.00007417918,0.000068374226,0.00009877855,0.00011120279,0.006267183],"genre_scores_gemma":[0.65908194,0.000724302,0.32495227,0.00019807059,0.00017559764,0.0007260265,0.00036597467,0.00017167885,0.013604243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963224,0.00016127236,0.000013818023,0.00006085621,0.00007436545,0.00005748824],"domain_scores_gemma":[0.9994892,0.0003083091,0.0000588563,0.000026684767,0.00007982707,0.000037124457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009318299,0.0008874607,0.0014309312,0.00092828396,0.0006727903,0.0013598909,0.0022768595,0.002297395,0.005085458],"category_scores_gemma":[0.0017732691,0.00066780974,0.0010996226,0.0012739288,0.0009139956,0.0012526792,0.0012489127,0.0013422123,0.00048842037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010887205,0.0000136017015,0.00003292226,0.000023920224,0.000006702259,0.000024176283,0.0000101317455,0.9883073,0.00017879791,0.008487367,0.0003760724,0.0025281932],"study_design_scores_gemma":[0.0000050971958,0.0000047265285,0.000008129527,0.0000024356248,0.0000023076266,0.000002705247,0.000002683486,0.99864775,0.000027659335,0.001135753,0.0001591829,0.0000016165158],"about_ca_topic_score_codex":0.0106660575,"about_ca_topic_score_gemma":0.006496226,"teacher_disagreement_score":0.0106660575,"about_ca_system_score_codex":0.0015184617,"about_ca_system_score_gemma":0.0022535073,"threshold_uncertainty_score":0.021207988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035652258,0.0033551112,0.9549715,0.0010280068,0.00014774855,0.000065986875,0.00016645403,0.00019112481,0.0044218805],"genre_scores_gemma":[0.9063827,0.003409601,0.08301474,0.00029665846,0.0005792067,0.00022549284,0.00032116706,0.00024543147,0.0055249603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343455,0.0036842846,0.00030447252,0.00082904595,0.0010955132,0.0006520438],"domain_scores_gemma":[0.94900423,0.04031486,0.0046339864,0.0017958202,0.0029996573,0.0012514024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022998823,0.0037575376,0.0030438413,0.003518555,0.00065407605,0.0052571828,0.0037818088,0.0033720632,0.002572879],"category_scores_gemma":[0.057574384,0.0012912583,0.002377539,0.0024776796,0.0046529914,0.008155307,0.0033989812,0.004030364,0.00023152785],"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.00014386539,0.00007576648,0.00087179133,0.00022292192,0.00018079093,0.00024523214,0.00015983985,0.7782162,0.0009600865,0.2058969,0.0011164191,0.011910192],"study_design_scores_gemma":[0.000008716095,0.000075612115,0.00050917536,0.000067398156,0.00006174713,0.000111004156,0.000072602656,0.9020455,0.00040096793,0.096232414,0.0003674572,0.0000472892],"about_ca_topic_score_codex":0.0017684223,"about_ca_topic_score_gemma":0.0011820479,"teacher_disagreement_score":0.022998823,"about_ca_system_score_codex":0.0032359015,"about_ca_system_score_gemma":0.0019430068,"threshold_uncertainty_score":0.12163085},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011494338,0.053746354,0.93498564,0.001483691,0.00025281275,0.000044939025,0.00022622215,0.00017801192,0.007932901],"genre_scores_gemma":[0.12577246,0.20772712,0.6524786,0.0014742786,0.0036974077,0.00059970253,0.0010975758,0.0004989782,0.0066538113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963063,0.0018196345,0.0002861853,0.000493153,0.0009423674,0.00015235961],"domain_scores_gemma":[0.9960198,0.0030736742,0.00017908223,0.00029365518,0.00035968906,0.00007420526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004291758,0.0023994618,0.0024246871,0.0019079662,0.00054636394,0.0031321696,0.0025079027,0.0019989042,0.0051850597],"category_scores_gemma":[0.009429468,0.0010602954,0.002355689,0.004547167,0.0013349049,0.0031619517,0.002146081,0.0035682993,0.0016225568],"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.00007332,0.00012477054,0.0010957716,0.0024173786,0.00025112953,0.00008973294,0.00021576372,0.17792164,0.00054549525,0.50948787,0.0132785095,0.29449874],"study_design_scores_gemma":[0.000024070063,0.00008677126,0.00063662464,0.0008896688,0.00008838637,0.0001288592,0.000073899384,0.4836906,0.0004347547,0.4553322,0.058557212,0.000057014357],"about_ca_topic_score_codex":0.0037827466,"about_ca_topic_score_gemma":0.0027939223,"teacher_disagreement_score":0.0051850597,"about_ca_system_score_codex":0.0016683287,"about_ca_system_score_gemma":0.002447343,"threshold_uncertainty_score":0.02269727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33699417,0.0008149783,0.6184498,0.006164338,0.0002646492,0.00014993991,0.00044555267,0.00013125573,0.03658534],"genre_scores_gemma":[0.98416764,0.00024519683,0.00819566,0.0001274662,0.0000788258,0.00007736165,0.00006434624,0.000018310539,0.007025091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989133,0.00048682603,0.000035300924,0.00020272438,0.00012610176,0.00023578081],"domain_scores_gemma":[0.99531686,0.003003006,0.0005272873,0.00021254795,0.0005027137,0.00043756276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021017492,0.0005385733,0.001521202,0.00071758893,0.0011718018,0.0022431402,0.002269138,0.0021450703,0.006933751],"category_scores_gemma":[0.009431049,0.0004338103,0.0010328281,0.00082077016,0.0021997404,0.0040159808,0.0015819097,0.001636233,0.00051433925],"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.00015315686,0.00020464965,0.0038811709,0.00013279433,0.00014186892,0.00034302255,0.00078307843,0.42709398,0.0013848154,0.55358034,0.0033528341,0.008948305],"study_design_scores_gemma":[0.000013956232,0.000022535205,0.00042366897,0.0000061416117,0.0000144900305,0.000020052938,0.00007636077,0.9291171,0.000043794553,0.07001111,0.00023646813,0.000014388501],"about_ca_topic_score_codex":0.009267032,"about_ca_topic_score_gemma":0.0059975577,"teacher_disagreement_score":0.009267032,"about_ca_system_score_codex":0.0018582173,"about_ca_system_score_gemma":0.0017836866,"threshold_uncertainty_score":0.023195684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4213201,0.0016038285,0.5494054,0.005164982,0.00031057466,0.0003139256,0.0019292746,0.00041491401,0.019536989],"genre_scores_gemma":[0.91499335,0.00080160366,0.07462291,0.00034613843,0.00020237034,0.00022395655,0.0007103515,0.00014328983,0.007956144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855083,0.0006575292,0.000068336725,0.00026480577,0.00016504708,0.0002934075],"domain_scores_gemma":[0.9947502,0.0038535497,0.0006448492,0.00017019943,0.00024170754,0.00033948675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026242363,0.0016425397,0.0017769691,0.0009107787,0.0010025607,0.0023458716,0.002257814,0.0030535606,0.0035974379],"category_scores_gemma":[0.0076917373,0.0009667579,0.0016462958,0.0015212079,0.0015446807,0.0018365487,0.0012408616,0.002340893,0.00024325699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044770433,0.000028378598,0.0003441415,0.00004047461,0.000022237473,0.00013141328,0.000022928974,0.9907374,0.00013912519,0.006540746,0.00050439005,0.0014439323],"study_design_scores_gemma":[0.00002403799,0.000021021768,0.00018008046,0.0000057382085,0.000009566505,0.00004330628,0.000033508088,0.9919008,0.00011107382,0.0072156424,0.00044640232,0.000008963156],"about_ca_topic_score_codex":0.020809134,"about_ca_topic_score_gemma":0.012685799,"teacher_disagreement_score":0.020809134,"about_ca_system_score_codex":0.0031728563,"about_ca_system_score_gemma":0.0018627545,"threshold_uncertainty_score":0.041376054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019680136,0.00021399146,0.99093574,0.00024079469,0.00007449434,0.00012442221,0.000112192545,0.00016894941,0.00616142],"genre_scores_gemma":[0.08229217,0.00047586317,0.9076745,0.00019327243,0.00012510373,0.0005176897,0.00034210348,0.00022717593,0.0081520295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993787,0.00017189092,0.000026258285,0.000114512884,0.00021791659,0.000090816546],"domain_scores_gemma":[0.9987405,0.0008552098,0.00007575347,0.000083943385,0.00019055032,0.000054099288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015371836,0.0013076994,0.001029802,0.00096785097,0.00080211414,0.001456787,0.0016789592,0.0016296206,0.012241632],"category_scores_gemma":[0.0039362446,0.00074180483,0.0012779527,0.0014100075,0.0006546046,0.0014714397,0.00122858,0.0021660754,0.0015525536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039240484,0.00008062143,0.00029513348,0.00021570043,0.00003294245,0.000088993664,0.00007519905,0.8703136,0.00093208364,0.054633483,0.0051041567,0.06818888],"study_design_scores_gemma":[0.000016597027,0.000015935062,0.00004387886,0.000018115106,0.000008174062,0.0000222645,0.000019786901,0.9805103,0.00016071035,0.016094964,0.0030842898,0.000004862854],"about_ca_topic_score_codex":0.010211328,"about_ca_topic_score_gemma":0.013285759,"teacher_disagreement_score":0.012241632,"about_ca_system_score_codex":0.0016959542,"about_ca_system_score_gemma":0.0032220478,"threshold_uncertainty_score":0.040952325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047766857,0.00031219737,0.9464052,0.0001778691,0.000075551616,0.00010639357,0.00006082281,0.0003725639,0.00472254],"genre_scores_gemma":[0.51752657,0.00023065679,0.4765815,0.00020637429,0.000052248957,0.00041142027,0.0002739965,0.00013170672,0.0045856205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970835,0.00008241683,0.0000106003035,0.0000526431,0.000096025535,0.000049865826],"domain_scores_gemma":[0.99966025,0.00016804258,0.000029231236,0.000024040486,0.000081846425,0.00003658821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071619725,0.000763213,0.0011918696,0.00092773925,0.0004742095,0.0007583112,0.001571995,0.0013279135,0.0030584317],"category_scores_gemma":[0.0011259527,0.0004927985,0.00074293604,0.00091649144,0.00056022167,0.00086578465,0.001209035,0.00087299163,0.00037446723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012367008,0.0001395588,0.0005196476,0.00004410282,0.00005346416,0.000044390265,0.0000451685,0.9038722,0.002500371,0.006625545,0.0010547092,0.08497715],"study_design_scores_gemma":[0.000020679743,0.000036575075,0.00006415735,0.0000032542348,0.0000067496676,0.000009387604,0.000006271111,0.99848014,0.00019186352,0.00093539275,0.00024305456,0.0000024430224],"about_ca_topic_score_codex":0.005137276,"about_ca_topic_score_gemma":0.0042708092,"teacher_disagreement_score":0.005137276,"about_ca_system_score_codex":0.00074273575,"about_ca_system_score_gemma":0.0014473674,"threshold_uncertainty_score":0.010231495},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029439392,0.00022663106,0.9673587,0.00023794486,0.000052503816,0.00016670075,0.00033446084,0.00037656983,0.0018070543],"genre_scores_gemma":[0.30579904,0.0002369329,0.6915831,0.00008417732,0.0000762379,0.00045052663,0.00089214696,0.00015800566,0.00071992126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958865,0.0013855135,0.0007001882,0.00065354,0.0010316727,0.00034251835],"domain_scores_gemma":[0.9910329,0.0060713296,0.00067264726,0.000866443,0.0011434616,0.00021311568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004431097,0.00087911024,0.0017554099,0.0053673475,0.001468405,0.0070400927,0.0011208779,0.0011220718,0.0024525416],"category_scores_gemma":[0.019279905,0.0009784367,0.0027164358,0.0040865713,0.0023080187,0.0062091933,0.0033944661,0.0019585283,0.00037482206],"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.0006142452,0.00013515611,0.0023139778,0.0007531729,0.00022478944,0.0006115001,0.0042559896,0.046143617,0.015436656,0.7341769,0.002844263,0.19248971],"study_design_scores_gemma":[0.000056288132,0.0000779951,0.0007928336,0.00012014091,0.0000952547,0.00009471327,0.0006131842,0.2018023,0.005644475,0.7862844,0.004358265,0.0000601761],"about_ca_topic_score_codex":0.0017854773,"about_ca_topic_score_gemma":0.00099219,"teacher_disagreement_score":0.0070400927,"about_ca_system_score_codex":0.0011273588,"about_ca_system_score_gemma":0.0018354903,"threshold_uncertainty_score":0.023434162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95634073,0.00063304877,0.03715548,0.0013481824,0.00005311235,0.000070923896,0.00039642505,0.00009158875,0.0039105117],"genre_scores_gemma":[0.99707437,0.00010976019,0.0023619318,0.000035857684,0.000016612832,0.000014404408,0.00008009393,0.000013302196,0.00029373437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518496,0.002800932,0.00018576124,0.0004871172,0.0006185242,0.00072271196],"domain_scores_gemma":[0.92151487,0.0691157,0.0042457017,0.0018813121,0.002017572,0.0012248418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015480178,0.00105707,0.001203854,0.0015343006,0.00043417228,0.0031562576,0.0012676578,0.0023820854,0.00126244],"category_scores_gemma":[0.062633656,0.00064096664,0.0010359426,0.000990816,0.0015709372,0.0032239456,0.0013145668,0.0021131006,0.00012641803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064496446,0.00011496008,0.004596029,0.000057928402,0.0001161519,0.00008788635,0.000035750036,0.9816025,0.0005812938,0.008234728,0.0002771427,0.0036506723],"study_design_scores_gemma":[0.000029890018,0.00028206062,0.0028788792,0.000016482438,0.000045157078,0.00004263611,0.00007335157,0.9872268,0.00091546227,0.008353759,0.00011251753,0.00002303169],"about_ca_topic_score_codex":0.005682533,"about_ca_topic_score_gemma":0.0029516616,"teacher_disagreement_score":0.015480178,"about_ca_system_score_codex":0.0027720768,"about_ca_system_score_gemma":0.002197736,"threshold_uncertainty_score":0.08186799},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82548624,0.0029837994,0.15671396,0.0006411002,0.000048505197,0.00022474825,0.00076338724,0.00028744317,0.012850766],"genre_scores_gemma":[0.9851328,0.00062972505,0.013106822,0.000025052994,0.000011876356,0.000078310586,0.00031709013,0.000026564801,0.00067174924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939275,0.0002800469,0.000026739914,0.00010236399,0.0000820718,0.00011606652],"domain_scores_gemma":[0.9959955,0.003060516,0.00038197063,0.00019190587,0.0002681428,0.00010195874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021389623,0.0012187684,0.00086561183,0.0010602514,0.00044206675,0.0013568676,0.001210458,0.0010374078,0.0026618517],"category_scores_gemma":[0.0045300378,0.00036794244,0.00077292445,0.0015572528,0.0004868017,0.0018506513,0.00080797233,0.0015279738,0.0002293208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054073953,0.00015293632,0.0016406836,0.00008842298,0.000022676006,0.00003571719,0.00003082634,0.9890203,0.00025956784,0.0027210924,0.00036908095,0.0056046234],"study_design_scores_gemma":[0.000003888276,0.000035323177,0.00053509884,0.000007937424,0.0000066347498,0.000007627292,0.000043173244,0.9983854,0.00009094875,0.0006959142,0.00018424615,0.0000038635762],"about_ca_topic_score_codex":0.013833433,"about_ca_topic_score_gemma":0.0080276495,"teacher_disagreement_score":0.013833433,"about_ca_system_score_codex":0.0015357675,"about_ca_system_score_gemma":0.00080862007,"threshold_uncertainty_score":0.027505815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013464133,0.00009770231,0.9853625,0.000084992236,0.000055353838,0.000094347204,0.00001504367,0.00013126474,0.00069459045],"genre_scores_gemma":[0.59647053,0.00014877378,0.40012276,0.00013303045,0.00008740923,0.0005920474,0.00017807046,0.00015259058,0.0021147318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99160004,0.0040181745,0.00052259996,0.001469179,0.0017907952,0.0005991256],"domain_scores_gemma":[0.9822879,0.01159209,0.0009146306,0.00094070524,0.003727384,0.0005372597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01555218,0.0013964835,0.0036001906,0.0023979899,0.001684011,0.0022282943,0.003704767,0.0023664066,0.004111536],"category_scores_gemma":[0.030314608,0.0010850049,0.0023888303,0.0023509727,0.0015507938,0.0038567777,0.0038767292,0.0029670885,0.0005519157],"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.00067861064,0.00036074696,0.0012387133,0.0003285193,0.0004536025,0.00013424866,0.0004375454,0.7783253,0.003791059,0.02980156,0.0017922455,0.18265787],"study_design_scores_gemma":[0.000021148402,0.00007492778,0.00019235861,0.000011137274,0.000032126976,0.000012892767,0.000022045053,0.99102014,0.0005515228,0.007852438,0.00019037991,0.000018816614],"about_ca_topic_score_codex":0.004320844,"about_ca_topic_score_gemma":0.0024200964,"teacher_disagreement_score":0.01555218,"about_ca_system_score_codex":0.0020250992,"about_ca_system_score_gemma":0.0027430581,"threshold_uncertainty_score":0.08224875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004009811,0.00011444773,0.9929899,0.00010143801,0.00006754606,0.000043478376,0.000071141825,0.0001497202,0.0024524918],"genre_scores_gemma":[0.20563485,0.00027206205,0.7843036,0.00047255366,0.00012239371,0.0005131322,0.0003875786,0.00042191354,0.0078719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994404,0.00023436088,0.000025551564,0.00007661614,0.00014060547,0.000082608516],"domain_scores_gemma":[0.99825877,0.0009813579,0.00011584023,0.00013052518,0.0003563257,0.00015730098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019199747,0.0010066858,0.0014487837,0.0008148918,0.00049597706,0.001288207,0.002028358,0.0018637202,0.0075027365],"category_scores_gemma":[0.0042269505,0.0009364122,0.0013214779,0.00089875335,0.0007203992,0.0010199279,0.0022753207,0.0021824974,0.0010625538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008200378,0.00007264612,0.00025924758,0.000085042964,0.00003351806,0.000059354043,0.000046705594,0.9510548,0.0011417391,0.012832151,0.0014798406,0.03285286],"study_design_scores_gemma":[0.000005151159,0.0000113896,0.000014828457,0.0000051803286,0.0000022974723,0.000003301288,0.0000033386098,0.99812764,0.000059729562,0.0014281592,0.00033704026,0.0000019932102],"about_ca_topic_score_codex":0.0057814717,"about_ca_topic_score_gemma":0.0060474356,"teacher_disagreement_score":0.0075027365,"about_ca_system_score_codex":0.00094588305,"about_ca_system_score_gemma":0.0019018946,"threshold_uncertainty_score":0.025099158},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045893513,0.038843963,0.09039244,0.4934336,0.0057622464,0.00008409178,0.00026818254,0.00019979216,0.32512212],"genre_scores_gemma":[0.9410396,0.017169029,0.011790927,0.0070961243,0.0031099722,0.0001352659,0.00013046847,0.00011216878,0.019416373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963775,0.0017441374,0.00011390929,0.00041293728,0.00069475314,0.0006567843],"domain_scores_gemma":[0.99376774,0.0020737608,0.0006477194,0.00056985824,0.0011718621,0.0017689847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007644072,0.0004911979,0.0007060065,0.0012043363,0.0045105163,0.020768195,0.0016647379,0.007072483,0.012741697],"category_scores_gemma":[0.0066154865,0.0004168659,0.00061393454,0.0024247216,0.012718702,0.034329038,0.0062123276,0.005036405,0.0012711781],"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.00006996398,0.000035810455,0.0006586692,0.000092177885,0.000013101375,0.000075900505,0.002288487,0.0017289264,0.00021945269,0.960269,0.013069666,0.021478854],"study_design_scores_gemma":[0.000026866095,0.00004338067,0.0011136681,0.00031308612,0.000014919673,0.000094622155,0.008354153,0.003561541,0.00014446494,0.7712113,0.21508543,0.000036560232],"about_ca_topic_score_codex":0.008184991,"about_ca_topic_score_gemma":0.0064568785,"teacher_disagreement_score":0.020768195,"about_ca_system_score_codex":0.008786307,"about_ca_system_score_gemma":0.016200235,"threshold_uncertainty_score":0.06374943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064233574,0.0010620228,0.98668474,0.0008117685,0.0000921853,0.000028065986,0.00006658603,0.00006221624,0.004769057],"genre_scores_gemma":[0.6821449,0.004966544,0.29100174,0.0007500126,0.0012976988,0.00037078705,0.0005796715,0.0004706381,0.018418007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955884,0.0024330826,0.00017717382,0.0004692766,0.00088913867,0.0004428638],"domain_scores_gemma":[0.9884928,0.008069934,0.0008196693,0.0008062892,0.001296164,0.00051512284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013063289,0.002960169,0.0022506304,0.0020985424,0.0008968107,0.004855408,0.003919797,0.0032867985,0.003638],"category_scores_gemma":[0.024922535,0.0011952781,0.002125765,0.0016738471,0.0033795324,0.0074334405,0.00336516,0.0056311544,0.0005811689],"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.000038338567,0.000074523596,0.00030921493,0.00011714908,0.00009032099,0.00018023733,0.00009518305,0.61390144,0.00063312147,0.37280893,0.0022406548,0.009510889],"study_design_scores_gemma":[0.000004978803,0.000016021519,0.000100619545,0.00002858796,0.00002528621,0.000050370192,0.000014924927,0.85017025,0.000104401515,0.14889571,0.000573699,0.000015218511],"about_ca_topic_score_codex":0.0030500453,"about_ca_topic_score_gemma":0.0024297338,"teacher_disagreement_score":0.013063289,"about_ca_system_score_codex":0.0025190653,"about_ca_system_score_gemma":0.002587215,"threshold_uncertainty_score":0.069086134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024967475,0.99462765,0.0015905005,0.00037342004,0.00048273895,0.000008229572,0.000052862415,0.000024911707,0.0025901757],"genre_scores_gemma":[0.0015703301,0.9954999,0.0011577038,0.0002027626,0.00043973234,0.000009593098,0.00009046441,0.000007221492,0.001022324],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997309,0.000041582196,0.000040345727,0.00006890334,0.00009322639,0.000025024008],"domain_scores_gemma":[0.9992649,0.00043418395,0.00007456198,0.00002452061,0.00016584253,0.00003596553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067022594,0.0011248543,0.0012179943,0.0023136572,0.0002967621,0.0011826915,0.0010594357,0.0010853482,0.007297715],"category_scores_gemma":[0.0015321027,0.00056113285,0.00071672193,0.0037147931,0.00032946476,0.0020347985,0.00063236256,0.0013786573,0.003730462],"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.000065868284,0.000102385275,0.0002538559,0.023786059,0.000107630905,0.00015447027,0.000067827605,0.0036666712,0.0015912339,0.015112202,0.04521503,0.9098767],"study_design_scores_gemma":[0.00000954519,0.00011649967,0.00048667635,0.0034830002,0.00012755876,0.0005225534,0.000059669448,0.00084901904,0.00050791056,0.0051288884,0.98867387,0.00003486687],"about_ca_topic_score_codex":0.0012137272,"about_ca_topic_score_gemma":0.0014987792,"teacher_disagreement_score":0.007297715,"about_ca_system_score_codex":0.0005192984,"about_ca_system_score_gemma":0.0012255996,"threshold_uncertainty_score":0.024413347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847905,0.00019732308,0.008193793,0.00032188414,0.000011565809,0.0001290282,0.0001968453,0.000071729315,0.0060872776],"genre_scores_gemma":[0.98945844,0.00028496818,0.00872473,0.000026599408,0.0000068244885,0.00006988102,0.00011395874,0.000011251486,0.001303427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997336,0.00014022378,0.0000070299757,0.000026544214,0.000023822007,0.00006877931],"domain_scores_gemma":[0.9992669,0.00049295515,0.000060239217,0.000023165136,0.000077610115,0.000079016696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068514684,0.0007726034,0.00039048545,0.00071668817,0.00068180374,0.000832359,0.0008744902,0.0007357439,0.001535423],"category_scores_gemma":[0.0013273818,0.00021731101,0.00037312362,0.001228505,0.00051342766,0.00053714274,0.0006912602,0.00045576945,0.00006739362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010215191,0.00022367123,0.008393089,0.00010440577,0.00005822556,0.000738044,0.00025223402,0.9708321,0.00080730714,0.0027576534,0.0006785687,0.01505243],"study_design_scores_gemma":[0.00003715853,0.00013994279,0.0035880625,0.000010743625,0.000028481254,0.000049683607,0.00093274424,0.9921956,0.00082492153,0.0011312369,0.0010441988,0.000017234193],"about_ca_topic_score_codex":0.1335003,"about_ca_topic_score_gemma":0.10570692,"teacher_disagreement_score":0.1335003,"about_ca_system_score_codex":0.002931991,"about_ca_system_score_gemma":0.0019456992,"threshold_uncertainty_score":0.26544642},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31021425,0.00075424806,0.52098966,0.00884119,0.00008038935,0.00052734534,0.0002547234,0.0001062777,0.1582319],"genre_scores_gemma":[0.96930426,0.00046179842,0.02469476,0.00022284841,0.000025884407,0.00014847341,0.000033135024,0.00002039148,0.005088353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977642,0.0013435996,0.00008226943,0.0001774718,0.00030257946,0.00032983362],"domain_scores_gemma":[0.99008626,0.008048307,0.00055578083,0.00023825862,0.00038924484,0.00068209757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003552308,0.0009915351,0.0011257741,0.0009443909,0.001656045,0.0061839693,0.0018126095,0.0043857833,0.008910807],"category_scores_gemma":[0.015343352,0.0007504795,0.0009952508,0.0011274086,0.0039896416,0.008070931,0.0030264894,0.0030539567,0.00045552058],"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.00016160907,0.00024532256,0.0015193507,0.00023129371,0.000084005034,0.00036050868,0.0018474818,0.21849595,0.0019211385,0.75717,0.002178181,0.015785104],"study_design_scores_gemma":[0.000072572446,0.00011670779,0.00041222112,0.00006589879,0.000033244403,0.00009447897,0.001697308,0.39313534,0.00030722553,0.60196245,0.0020667678,0.000035801262],"about_ca_topic_score_codex":0.0056512873,"about_ca_topic_score_gemma":0.0070433063,"teacher_disagreement_score":0.008910807,"about_ca_system_score_codex":0.002373414,"about_ca_system_score_gemma":0.003860313,"threshold_uncertainty_score":0.029809594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004729492,0.00036822856,0.989677,0.00019170588,0.00016313525,0.00007802111,0.0001108618,0.00019733213,0.0044842097],"genre_scores_gemma":[0.23503171,0.00071072194,0.7502573,0.0003728246,0.00028783316,0.00047400172,0.0004524966,0.000339016,0.012074243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993662,0.00018579015,0.00003173131,0.00011609112,0.00018077104,0.00011947997],"domain_scores_gemma":[0.9977779,0.0014503527,0.00009225454,0.0001831952,0.00037559436,0.00012069668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012862319,0.00089918246,0.0020625903,0.0010923315,0.0008281667,0.0012804583,0.003115469,0.0020616993,0.012521976],"category_scores_gemma":[0.0041642073,0.0007920932,0.001259236,0.0015449411,0.0008703036,0.0023278354,0.0020560974,0.002329687,0.0011515521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001377966,0.00015728269,0.0004504332,0.00031679665,0.00006400283,0.00013448714,0.000100085614,0.85847574,0.0011438832,0.039305575,0.006447394,0.093266465],"study_design_scores_gemma":[0.000020682612,0.000016006978,0.000044123153,0.000009819354,0.0000070142173,0.000017303182,0.000013867584,0.9883464,0.00008484068,0.010774502,0.00066032447,0.000005056586],"about_ca_topic_score_codex":0.013268786,"about_ca_topic_score_gemma":0.01360353,"teacher_disagreement_score":0.013268786,"about_ca_system_score_codex":0.0010360483,"about_ca_system_score_gemma":0.0024914795,"threshold_uncertainty_score":0.041890204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043476734,0.0003625026,0.9498458,0.000389672,0.000039030463,0.00006644563,0.00006424771,0.00037364193,0.0053819166],"genre_scores_gemma":[0.7756894,0.00029272004,0.21945547,0.0002575671,0.000043793607,0.00024555973,0.00017558268,0.00013227727,0.0037075444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969864,0.0000895431,0.000014989436,0.00007115386,0.000074560856,0.000051061157],"domain_scores_gemma":[0.9988661,0.0008210768,0.00010340209,0.00004703357,0.00011311112,0.00004930787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089346734,0.0009663159,0.000900375,0.00054756616,0.00030856804,0.0008948841,0.0010054073,0.0012042571,0.0027195392],"category_scores_gemma":[0.00308729,0.0005959751,0.0005938717,0.00062496774,0.0008342238,0.0010973252,0.00101883,0.0013222502,0.00027367365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020496618,0.00001945343,0.00019850125,0.000024778807,0.0000090629965,0.00001808941,0.000013046074,0.9860378,0.0003768038,0.0031865234,0.00023086555,0.009864567],"study_design_scores_gemma":[0.0000025112993,0.000006321322,0.000015548458,0.0000021659328,0.0000012614425,0.0000016282751,0.0000020732145,0.99890804,0.00008849993,0.00090221217,0.000068937225,8.0136226e-7],"about_ca_topic_score_codex":0.0057091434,"about_ca_topic_score_gemma":0.0059899776,"teacher_disagreement_score":0.0057091434,"about_ca_system_score_codex":0.0010348157,"about_ca_system_score_gemma":0.0015641854,"threshold_uncertainty_score":0.011351824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8190212,0.0017727986,0.1664872,0.0015989476,0.00013058918,0.00011309618,0.00016707614,0.00034817826,0.010360859],"genre_scores_gemma":[0.9949536,0.00034324024,0.0041216966,0.00006991344,0.000044386532,0.000020415398,0.000022542297,0.000033541255,0.00039065906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965449,0.0012483145,0.0001368503,0.0004137352,0.0006123468,0.001043759],"domain_scores_gemma":[0.93836313,0.046644386,0.008606815,0.0027671717,0.0025189766,0.0010994428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007472103,0.0012014203,0.0011398342,0.0016342344,0.0009531003,0.0020034963,0.0013007121,0.0017042235,0.0007099011],"category_scores_gemma":[0.053110003,0.0006789937,0.0006369766,0.0015596717,0.001993533,0.0021365443,0.0014666364,0.0023000927,0.00018483303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006827397,0.0004250623,0.03194828,0.00024741818,0.0001580287,0.0034438048,0.00043058413,0.8115112,0.018430796,0.110668145,0.0019325345,0.020121409],"study_design_scores_gemma":[0.000029358875,0.00015366498,0.004913145,0.000046625868,0.00006790082,0.0005018369,0.00009636103,0.9781171,0.0058898088,0.009767481,0.00034103187,0.0000756941],"about_ca_topic_score_codex":0.007876196,"about_ca_topic_score_gemma":0.003545819,"teacher_disagreement_score":0.007876196,"about_ca_system_score_codex":0.0023358872,"about_ca_system_score_gemma":0.0022556118,"threshold_uncertainty_score":0.039516687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020998688,0.00086461793,0.96843576,0.0013826726,0.0001637537,0.00018441197,0.00032359659,0.00011656968,0.0075299805],"genre_scores_gemma":[0.6306106,0.0017389775,0.3418219,0.000538603,0.0005138234,0.0005588876,0.00088062615,0.00030892034,0.023027709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974159,0.0012734332,0.00008848183,0.00043884138,0.00046512132,0.00031814552],"domain_scores_gemma":[0.9938898,0.0046872282,0.00035400817,0.00013257809,0.0005128902,0.00042342689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047936016,0.0022172716,0.003752266,0.0032338845,0.0012752617,0.004601637,0.0052973274,0.0052371793,0.007965664],"category_scores_gemma":[0.009936343,0.0025548988,0.0026617455,0.0026875865,0.0027510172,0.0043894784,0.003583252,0.0039475886,0.00051571307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032230226,0.000044090313,0.0002009757,0.0000647705,0.00003871288,0.00006725112,0.000031444724,0.9730971,0.00019108866,0.021367727,0.0007704947,0.0040939907],"study_design_scores_gemma":[0.000009139518,0.00002698867,0.000060698567,0.000012597376,0.00001225563,0.000012667369,0.000018625475,0.9825797,0.000046898665,0.016888892,0.00032222152,0.000009275187],"about_ca_topic_score_codex":0.01658449,"about_ca_topic_score_gemma":0.0130851185,"teacher_disagreement_score":0.01658449,"about_ca_system_score_codex":0.003857866,"about_ca_system_score_gemma":0.0032627783,"threshold_uncertainty_score":0.032975912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8462597,0.00028429134,0.1471583,0.00029020058,0.000025840685,0.00006264511,0.00008715187,0.000062454514,0.0057693846],"genre_scores_gemma":[0.99576086,0.00004457124,0.0037523697,0.000005747145,0.0000051426605,0.000010562364,0.000020547192,0.0000046966093,0.00039564053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983809,0.00071217027,0.00009013082,0.0002022416,0.00047100702,0.00014352817],"domain_scores_gemma":[0.9872121,0.009001766,0.0019075914,0.00060231605,0.0007475566,0.0005287499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006301288,0.0005806637,0.0007243079,0.000702638,0.0003636927,0.0021991795,0.0011154632,0.0014230954,0.0017429505],"category_scores_gemma":[0.027757956,0.00022544943,0.00041963928,0.0006773375,0.0014804947,0.0030178817,0.00133856,0.0012806497,0.00007309205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002204752,0.00008308542,0.008526422,0.000049886472,0.00004422163,0.00034111703,0.0001199739,0.92032653,0.002814389,0.057712775,0.0001194902,0.009641581],"study_design_scores_gemma":[0.0000096323,0.00009242127,0.0018266964,0.000009094725,0.000009301641,0.000057538182,0.000047238216,0.9834978,0.0010204373,0.013311304,0.00010634296,0.0000121372495],"about_ca_topic_score_codex":0.0018798073,"about_ca_topic_score_gemma":0.00079061906,"teacher_disagreement_score":0.006301288,"about_ca_system_score_codex":0.0014536212,"about_ca_system_score_gemma":0.0007585797,"threshold_uncertainty_score":0.033324778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03260736,0.00017155877,0.9609637,0.0003828713,0.000062436455,0.00010287222,0.00022669116,0.0006967005,0.004785757],"genre_scores_gemma":[0.73976696,0.0001611435,0.25116616,0.00026439366,0.0000870306,0.0001904683,0.00063050474,0.00018120113,0.007552129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982482,0.00046192296,0.00008848087,0.00037371577,0.00048280798,0.0003448207],"domain_scores_gemma":[0.9978409,0.0010087454,0.00018359716,0.0002682571,0.0004591052,0.00023939692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002450741,0.001318541,0.0023708595,0.00051263353,0.0007149939,0.0027702805,0.002214186,0.0025243822,0.0066211238],"category_scores_gemma":[0.004837428,0.000728906,0.0007916752,0.0007206309,0.00080152316,0.0021912958,0.0029079723,0.0021681532,0.0014309965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005432487,0.000185714,0.0007869684,0.00006721248,0.00005711974,0.0001559267,0.000037053465,0.93868434,0.0029404422,0.005915252,0.0025173274,0.04810943],"study_design_scores_gemma":[0.00001231945,0.000041667103,0.00007109842,0.0000026973166,0.0000055002856,0.000020405154,0.000004809877,0.99612194,0.0008161983,0.0027280569,0.00017195575,0.000003399756],"about_ca_topic_score_codex":0.0020192752,"about_ca_topic_score_gemma":0.002364219,"teacher_disagreement_score":0.0066211238,"about_ca_system_score_codex":0.001026722,"about_ca_system_score_gemma":0.002209427,"threshold_uncertainty_score":0.02214986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27695635,0.0025905184,0.7118291,0.0013790817,0.0001850534,0.00005994441,0.00079959887,0.0028426184,0.0033576356],"genre_scores_gemma":[0.9732193,0.00038685647,0.023931863,0.00012312032,0.000050286002,0.00002950883,0.00039541727,0.000033327095,0.0018304338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997886,0.0000572211,0.000013123953,0.00006220391,0.000037581096,0.000041330022],"domain_scores_gemma":[0.9993253,0.0003819099,0.000096268166,0.000044972203,0.00011654894,0.00003506643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006239381,0.0007061347,0.00047842765,0.0007230382,0.00023413247,0.00050900975,0.0009411455,0.0008249875,0.0012514694],"category_scores_gemma":[0.0029643534,0.00034326155,0.000492799,0.00076658855,0.00035746186,0.0013653336,0.0006260918,0.001401619,0.00027829615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014937403,0.00008679645,0.0033971884,0.000049868064,0.00006846888,0.00008084966,0.00004961745,0.9054337,0.0021156648,0.0034671582,0.0015936634,0.08350753],"study_design_scores_gemma":[0.0000019202967,0.000008248762,0.00031352605,0.0000025442175,0.000005687297,0.0000043987775,0.0000017984361,0.9974806,0.00014923814,0.0019576943,0.00007208781,0.0000023422274],"about_ca_topic_score_codex":0.020790122,"about_ca_topic_score_gemma":0.023362432,"teacher_disagreement_score":0.020790122,"about_ca_system_score_codex":0.0011543438,"about_ca_system_score_gemma":0.00058974675,"threshold_uncertainty_score":0.041338265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025945224,0.00007952628,0.9964108,0.0000316147,0.000020643634,0.000012005505,0.000026242198,0.00006673068,0.00075786444],"genre_scores_gemma":[0.14176139,0.00043481748,0.8529995,0.00009091984,0.0001112033,0.00016855757,0.00024145447,0.00019055029,0.0040015304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.0002575603,0.00003901502,0.0000821251,0.00030007417,0.00005341002],"domain_scores_gemma":[0.999014,0.00055169367,0.00008793829,0.00012461536,0.0001558982,0.00006587888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014246535,0.0005606966,0.0010358281,0.0010264604,0.00051510264,0.0013754829,0.0014561331,0.0010302529,0.0041877506],"category_scores_gemma":[0.0032803284,0.00049662613,0.0012392227,0.0012842255,0.00072685146,0.002033631,0.0012782898,0.0017609533,0.0008346086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084437044,0.000105350904,0.00078824285,0.0001187281,0.000091453156,0.00011512231,0.00009049128,0.6202092,0.0040881545,0.26021355,0.0018297505,0.112265505],"study_design_scores_gemma":[0.000008376124,0.000022486305,0.00006133649,0.0000074558425,0.000004778606,0.000019895257,0.0000075148632,0.9588117,0.00047078918,0.03937041,0.0012048715,0.0000104224555],"about_ca_topic_score_codex":0.0013827368,"about_ca_topic_score_gemma":0.0018026112,"teacher_disagreement_score":0.0041877506,"about_ca_system_score_codex":0.0005271123,"about_ca_system_score_gemma":0.0011309066,"threshold_uncertainty_score":0.014009476},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10427935,0.0003068568,0.86343795,0.0014140245,0.00006281829,0.00016673988,0.00025158754,0.00017815844,0.029902525],"genre_scores_gemma":[0.80381304,0.00040656098,0.18635826,0.00018558966,0.000027821872,0.00024505384,0.00030021157,0.00012433963,0.008539217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990402,0.0004960531,0.000021690443,0.00017356698,0.000120650046,0.00014781507],"domain_scores_gemma":[0.9966761,0.0026389319,0.00018815696,0.00012741238,0.00018257873,0.00018673135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014566678,0.0008606255,0.0012421777,0.001106828,0.0009337696,0.002091987,0.0022711407,0.0024074088,0.0150140505],"category_scores_gemma":[0.0076258318,0.00071505015,0.0013077952,0.0009777471,0.0015594874,0.00373074,0.002145446,0.0027669023,0.00069524505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015468537,0.00015874782,0.0005518794,0.00020320232,0.00007282818,0.00019869479,0.000236794,0.68502265,0.0009219999,0.2958336,0.0015759621,0.015068995],"study_design_scores_gemma":[0.00002938548,0.000053963653,0.00009505617,0.000023800176,0.000027908405,0.000031436637,0.00012424364,0.81399286,0.00020619413,0.1846285,0.0007739592,0.000012808656],"about_ca_topic_score_codex":0.008384163,"about_ca_topic_score_gemma":0.006792335,"teacher_disagreement_score":0.0150140505,"about_ca_system_score_codex":0.0012521615,"about_ca_system_score_gemma":0.003410642,"threshold_uncertainty_score":0.050226986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27158892,0.0038335365,0.6392017,0.0015824874,0.00019378742,0.00024500483,0.00048658325,0.00016491192,0.082702965],"genre_scores_gemma":[0.9422439,0.00095740135,0.052625526,0.000120809156,0.00020071564,0.00020193096,0.00032642932,0.000052700856,0.0032705038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99414486,0.0023259271,0.00057133014,0.0010857991,0.0014701315,0.0004019691],"domain_scores_gemma":[0.9435698,0.04176639,0.004725505,0.0026472213,0.0058326446,0.001458442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010165459,0.000723968,0.0010367552,0.00489886,0.0021875375,0.0071458705,0.0026906647,0.0010736637,0.0050415713],"category_scores_gemma":[0.032668296,0.0005308322,0.0012502219,0.0036887974,0.00611425,0.010070825,0.0034291823,0.0023364204,0.00038907756],"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.000029191524,0.000022076376,0.00074951095,0.00005323246,0.000019595813,0.000028994062,0.00027939072,0.0017662726,0.00025362917,0.99228245,0.00024686212,0.004268752],"study_design_scores_gemma":[0.000014562745,0.00004300523,0.0009325491,0.00004625807,0.000032694446,0.000120170036,0.00028648274,0.024903439,0.00071697234,0.9713588,0.0015210292,0.000024037607],"about_ca_topic_score_codex":0.0006773553,"about_ca_topic_score_gemma":0.00074561854,"teacher_disagreement_score":0.010165459,"about_ca_system_score_codex":0.0023977456,"about_ca_system_score_gemma":0.0015518935,"threshold_uncertainty_score":0.053760707},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21552995,0.0022548535,0.73968786,0.0033974387,0.0002211969,0.0001266394,0.00019289293,0.00013343003,0.038455654],"genre_scores_gemma":[0.9689544,0.00097597425,0.023656823,0.00015502046,0.00016016435,0.00007786523,0.00008572849,0.000046777248,0.0058872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980763,0.0012152332,0.000063923675,0.00019095333,0.00025267332,0.0002009215],"domain_scores_gemma":[0.99230427,0.005382612,0.0008345919,0.00045800107,0.00053343276,0.0004871764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046785325,0.0013494105,0.0014523815,0.0011946799,0.0011023994,0.0054128733,0.001981436,0.0032420086,0.0072618257],"category_scores_gemma":[0.014648581,0.00060213916,0.0025616712,0.0011038333,0.0047930875,0.0064071654,0.0023410167,0.003573596,0.00036423886],"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.000051844247,0.00006278888,0.000914715,0.000052602256,0.00004179679,0.0002752851,0.000121431076,0.19427408,0.0009728073,0.79873544,0.0006056671,0.003891567],"study_design_scores_gemma":[0.000021491525,0.000039790317,0.0003944418,0.000034833723,0.00002121883,0.000049916714,0.000053688123,0.71114504,0.00017474362,0.28735897,0.00067088526,0.000034902525],"about_ca_topic_score_codex":0.005857347,"about_ca_topic_score_gemma":0.0031512368,"teacher_disagreement_score":0.0072618257,"about_ca_system_score_codex":0.0023040178,"about_ca_system_score_gemma":0.0020465038,"threshold_uncertainty_score":0.024742723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44269374,0.0026749172,0.4058235,0.010335636,0.000622633,0.00072028174,0.0022766825,0.00079763663,0.13405503],"genre_scores_gemma":[0.9774162,0.0005823316,0.012729601,0.00045813737,0.00017227615,0.00014392633,0.000100317266,0.000053481977,0.008343727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936196,0.0026552433,0.00022210866,0.0012827085,0.0005972543,0.0016231176],"domain_scores_gemma":[0.968781,0.020423384,0.0051014028,0.0020676008,0.0020781145,0.0015484676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007422061,0.0018337265,0.0032822466,0.0017808328,0.0027743569,0.008542137,0.0029046033,0.006489514,0.0248601],"category_scores_gemma":[0.015836842,0.001665951,0.0031084497,0.001204879,0.0045372103,0.010892593,0.004694855,0.005249346,0.002010673],"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.0018596846,0.0009472062,0.004340265,0.00080753246,0.00029683672,0.003380642,0.00071317045,0.27693206,0.0061674016,0.6811819,0.008067932,0.0153053105],"study_design_scores_gemma":[0.00036486855,0.00032291422,0.0016400876,0.00010204481,0.00022451454,0.0005309201,0.00076653773,0.51638895,0.0012092417,0.47454935,0.0036785686,0.0002219194],"about_ca_topic_score_codex":0.009104284,"about_ca_topic_score_gemma":0.0060581304,"teacher_disagreement_score":0.0248601,"about_ca_system_score_codex":0.005038116,"about_ca_system_score_gemma":0.0041375956,"threshold_uncertainty_score":0.08316535},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044841584,0.00012069509,0.9215661,0.00049242284,0.00006950496,0.0004527912,0.0014509562,0.025205467,0.0058004516],"genre_scores_gemma":[0.15572405,0.00009512751,0.84060067,0.000058995363,0.000010719128,0.0002289391,0.0010676895,0.00049510057,0.0017187379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990023,0.00023277101,0.00014203016,0.00023940348,0.00029899334,0.000084421124],"domain_scores_gemma":[0.9962739,0.0020442891,0.00027896906,0.0004938836,0.0006123084,0.0002966825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018958127,0.0007709457,0.0007781086,0.0018125612,0.0007693791,0.0025548793,0.002085318,0.0010391047,0.008750706],"category_scores_gemma":[0.008002639,0.0005625777,0.000989083,0.0013268257,0.0004646283,0.0030964348,0.003471916,0.00091894885,0.0014363115],"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.00078904524,0.000749763,0.011385012,0.0007529333,0.0003395313,0.00064581056,0.0034364418,0.16081783,0.014966449,0.031022279,0.018538391,0.7565565],"study_design_scores_gemma":[0.00014863828,0.0001601916,0.0015933283,0.00012553214,0.00013272121,0.00017678205,0.0009275902,0.95129156,0.010577024,0.011111387,0.023671,0.0000843172],"about_ca_topic_score_codex":0.007422792,"about_ca_topic_score_gemma":0.0127806775,"teacher_disagreement_score":0.008750706,"about_ca_system_score_codex":0.0007604843,"about_ca_system_score_gemma":0.002201423,"threshold_uncertainty_score":0.029274046},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4337182,0.0024026912,0.53835064,0.0034119617,0.00041841742,0.00040330226,0.001024295,0.000634975,0.019635454],"genre_scores_gemma":[0.98191905,0.0002695917,0.014885841,0.00007401585,0.0000425995,0.00005694748,0.00013478086,0.00004852162,0.0025687662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989629,0.00032509747,0.00003286836,0.00015569336,0.00013436077,0.00038916938],"domain_scores_gemma":[0.9968098,0.002256203,0.0002606651,0.00006223305,0.0002852441,0.00032583758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017720162,0.0010062783,0.0017484066,0.00094000297,0.00083457795,0.0023913588,0.0014898408,0.0015633457,0.0039952314],"category_scores_gemma":[0.005043016,0.0015945315,0.0008112059,0.0015145347,0.001121012,0.001601459,0.0010308542,0.0015138541,0.0002536335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050457493,0.000016324866,0.000114916926,0.000018490982,0.00001148554,0.00002671961,0.000011984854,0.99592894,0.00019665866,0.001857903,0.00037220676,0.0013939397],"study_design_scores_gemma":[0.0000047121716,0.000007688915,0.00006392375,0.0000021468873,0.0000032033615,0.0000028225602,0.000012291948,0.9988984,0.000047212652,0.0009136792,0.000040950737,0.0000029193375],"about_ca_topic_score_codex":0.045688342,"about_ca_topic_score_gemma":0.030397253,"teacher_disagreement_score":0.045688342,"about_ca_system_score_codex":0.0038579265,"about_ca_system_score_gemma":0.0039878855,"threshold_uncertainty_score":0.09084481},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009695012,0.00044442428,0.98870987,0.00013353278,0.000085164414,0.000016032576,0.000020286529,0.000250952,0.00064473756],"genre_scores_gemma":[0.65113854,0.0006121203,0.3433816,0.00014365492,0.00029303032,0.00021062206,0.00021680076,0.0001540105,0.0038496167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868685,0.0005017129,0.000102829545,0.00015380028,0.00043836568,0.00011642927],"domain_scores_gemma":[0.9975569,0.0014058424,0.00014920572,0.00012226844,0.00069477037,0.00007102113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022459284,0.0008526686,0.0025064477,0.00075991644,0.00036443837,0.0013914667,0.001368989,0.0015395831,0.0019015643],"category_scores_gemma":[0.00750648,0.000709403,0.001030381,0.0012988583,0.00040978912,0.001756886,0.0010079786,0.0017484981,0.0005580024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001275922,0.00011744663,0.0006431314,0.00009042699,0.00013014645,0.000034472752,0.000031518757,0.8472146,0.0010107703,0.007857535,0.0012606975,0.1414816],"study_design_scores_gemma":[0.0000022982654,0.000009061462,0.000044757304,0.000002344348,0.0000041725734,0.000002341937,0.0000010831811,0.99853694,0.000107424654,0.0011907415,0.00009685583,0.0000019311024],"about_ca_topic_score_codex":0.0045944084,"about_ca_topic_score_gemma":0.003951387,"teacher_disagreement_score":0.0045944084,"about_ca_system_score_codex":0.00064730854,"about_ca_system_score_gemma":0.0017092143,"threshold_uncertainty_score":0.011877775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31683156,0.0024455853,0.5369355,0.008925128,0.00035960393,0.0023371102,0.0016670788,0.00047148071,0.13002703],"genre_scores_gemma":[0.88745826,0.00082648394,0.08668702,0.00044214493,0.00009036517,0.00094712037,0.0004481904,0.000085599924,0.023014814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99448365,0.0029090825,0.0002478816,0.00071225397,0.00061035855,0.0010367697],"domain_scores_gemma":[0.97639966,0.015937964,0.0022460143,0.0012711457,0.001235536,0.0029096662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008426617,0.0011305263,0.0017643303,0.0011498082,0.0015039551,0.0032358356,0.0018554033,0.0044616903,0.01869933],"category_scores_gemma":[0.03228684,0.0013717068,0.00090503594,0.0010708302,0.0018806037,0.0045688367,0.0025036216,0.0038419052,0.0016103918],"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.0010905996,0.0008917775,0.0050272783,0.00051702076,0.00010303884,0.0006529198,0.00052407745,0.3724494,0.0023030574,0.5326254,0.016818523,0.06699703],"study_design_scores_gemma":[0.0005201167,0.0005571631,0.0028281736,0.00026129463,0.00006532675,0.00040501938,0.00064748124,0.53169674,0.0016630328,0.4367022,0.024569472,0.000083865045],"about_ca_topic_score_codex":0.003417198,"about_ca_topic_score_gemma":0.0036228676,"teacher_disagreement_score":0.01869933,"about_ca_system_score_codex":0.004199896,"about_ca_system_score_gemma":0.0076808445,"threshold_uncertainty_score":0.06255543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032356414,0.00012920934,0.99577385,0.00010617296,0.000012369832,0.000030207593,0.000034618184,0.00008694657,0.0005909063],"genre_scores_gemma":[0.38219,0.0006702733,0.6123159,0.00026859672,0.000120618766,0.0004236781,0.0005402156,0.00023047085,0.003240298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967423,0.0016693809,0.00014638352,0.0005256997,0.00071771216,0.00019856755],"domain_scores_gemma":[0.98944527,0.007559184,0.00092710246,0.0007742716,0.0011056489,0.00018851114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007744463,0.0017851195,0.0021852779,0.002580045,0.0007787039,0.0027195767,0.002128407,0.0017225754,0.0029881797],"category_scores_gemma":[0.019465297,0.0011533046,0.0030573863,0.0020848946,0.0015803988,0.0027997233,0.0027270257,0.0026831515,0.0007773075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032674845,0.000054740325,0.0019142207,0.00013605836,0.00011607374,0.00009412119,0.00006535621,0.88327,0.0008980113,0.05195054,0.0010800216,0.060388137],"study_design_scores_gemma":[0.000003070631,0.00001868952,0.00021895707,0.000016026828,0.000009214349,0.00002084237,0.000007068027,0.9768024,0.0002748179,0.021904847,0.00071435893,0.000009766266],"about_ca_topic_score_codex":0.0036973185,"about_ca_topic_score_gemma":0.0027344066,"teacher_disagreement_score":0.007744463,"about_ca_system_score_codex":0.0018255875,"about_ca_system_score_gemma":0.0022237317,"threshold_uncertainty_score":0.040957093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019903813,0.00010336215,0.97809553,0.00017073145,0.000025966921,0.00019112701,0.00010668319,0.0002486664,0.0011540855],"genre_scores_gemma":[0.26702777,0.00011074319,0.7306589,0.00014903306,0.0000357399,0.00044729534,0.0003963711,0.000041799725,0.0011322402],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960907,0.0018844269,0.00032622603,0.00049275975,0.0010047252,0.00020125035],"domain_scores_gemma":[0.9815011,0.01483002,0.00049818825,0.00081810507,0.0019699333,0.00038275638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005653444,0.00096044707,0.001938968,0.0015787646,0.0008181437,0.0017341413,0.003687786,0.0014811236,0.0041940967],"category_scores_gemma":[0.020103354,0.0009304707,0.0017164692,0.002263998,0.00096710486,0.0034172595,0.002909694,0.00291217,0.00042357756],"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.0008883688,0.001221283,0.003758926,0.00067662116,0.0004106072,0.00026320945,0.0010527134,0.3372231,0.006607242,0.049904082,0.004371531,0.5936223],"study_design_scores_gemma":[0.000052688974,0.00014695268,0.0003252933,0.000021435662,0.000047439644,0.000035255423,0.000064777276,0.9697496,0.0010966145,0.027755523,0.00067922013,0.000025162108],"about_ca_topic_score_codex":0.0050848476,"about_ca_topic_score_gemma":0.008471217,"teacher_disagreement_score":0.005653444,"about_ca_system_score_codex":0.0014008224,"about_ca_system_score_gemma":0.0025265755,"threshold_uncertainty_score":0.029898584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056651533,0.00054988905,0.93766195,0.00046479885,0.00003755011,0.000028000763,0.00013556001,0.00018625165,0.0042845234],"genre_scores_gemma":[0.96676016,0.00050372427,0.029072223,0.00013046213,0.000032978853,0.000050066817,0.00009791358,0.000085772306,0.0032666542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856395,0.0007222163,0.00006310801,0.00021959846,0.0002640638,0.00016711571],"domain_scores_gemma":[0.9917908,0.006482072,0.0006332667,0.0004963339,0.00039059142,0.00020695504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040299026,0.000882611,0.00096682383,0.0013576696,0.00035419516,0.0019614599,0.0009911838,0.0011230547,0.0024044823],"category_scores_gemma":[0.01675539,0.0005897504,0.0013951635,0.0008051298,0.0020416472,0.0021879028,0.0023915751,0.0018925213,0.00014701468],"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.000023590033,0.0000166023,0.0013346216,0.000061854094,0.00004484233,0.00015949347,0.00010415025,0.8248524,0.0011489303,0.1670177,0.00032180225,0.004913914],"study_design_scores_gemma":[0.00000255166,0.000011671722,0.0002951915,0.000011633105,0.000010383608,0.000033661858,0.000014048593,0.9227033,0.00032632728,0.07628609,0.00029534442,0.000009657058],"about_ca_topic_score_codex":0.00311424,"about_ca_topic_score_gemma":0.0012577903,"teacher_disagreement_score":0.0040299026,"about_ca_system_score_codex":0.0018168957,"about_ca_system_score_gemma":0.0008226004,"threshold_uncertainty_score":0.021312416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30680096,0.0007746336,0.6858887,0.0006328764,0.00060519035,0.0001472621,0.0002466598,0.00021097258,0.004692706],"genre_scores_gemma":[0.9815625,0.00014212015,0.015569315,0.00003426262,0.000064654145,0.000031026102,0.000072395604,0.0000327571,0.0024908632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983669,0.00074540713,0.00006291703,0.00021919695,0.00024669408,0.00035878667],"domain_scores_gemma":[0.9969817,0.0021172038,0.00020278517,0.000104217455,0.0003674368,0.00022664407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032528932,0.0011634739,0.002846957,0.000659056,0.0005900419,0.0022505696,0.002587487,0.0015874141,0.0025064382],"category_scores_gemma":[0.005770502,0.0015288331,0.0012380878,0.0012646056,0.0009979744,0.002006797,0.0011648613,0.0019518527,0.00020682774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016856786,0.000054368746,0.00021505123,0.00002886101,0.000027401855,0.000057122896,0.000021699403,0.9913083,0.00030351646,0.0032289587,0.00024640936,0.0043398542],"study_design_scores_gemma":[0.0000046409123,0.0000126528275,0.00004444783,6.689491e-7,0.000004023847,0.000002540138,0.0000042715615,0.9992908,0.000038128295,0.0005723738,0.000023182663,0.0000022859224],"about_ca_topic_score_codex":0.012863312,"about_ca_topic_score_gemma":0.007762637,"teacher_disagreement_score":0.012863312,"about_ca_system_score_codex":0.0020222669,"about_ca_system_score_gemma":0.0017672823,"threshold_uncertainty_score":0.02557689},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017910149,0.0029400568,0.942175,0.002731955,0.0007003068,0.000118415264,0.00022099183,0.000525517,0.03267755],"genre_scores_gemma":[0.4637043,0.0054372335,0.47391438,0.0013430992,0.0018229114,0.00032494974,0.000890074,0.0010319522,0.051531173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852633,0.00054185267,0.00005256822,0.00018262868,0.0004604373,0.0002361532],"domain_scores_gemma":[0.99766845,0.0014175472,0.00008888453,0.00048130276,0.00022127251,0.00012250924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015581442,0.0012767671,0.001283729,0.0014901487,0.0010675417,0.0017185637,0.0019379708,0.0007295113,0.006941734],"category_scores_gemma":[0.0063061602,0.000513826,0.0019177244,0.001539342,0.0018757926,0.0030464109,0.0033854255,0.0075602885,0.0021823852],"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.00025948815,0.00023514262,0.00056683883,0.00053059,0.00008998284,0.00013733258,0.00040168813,0.061879855,0.0057392623,0.66980255,0.027149929,0.23320733],"study_design_scores_gemma":[0.00007469598,0.00007292822,0.0002730455,0.00005881227,0.00004873245,0.00015617511,0.000073449264,0.17079483,0.002879722,0.80505013,0.020488968,0.000028472972],"about_ca_topic_score_codex":0.0015629877,"about_ca_topic_score_gemma":0.0024648365,"teacher_disagreement_score":0.006941734,"about_ca_system_score_codex":0.0011991708,"about_ca_system_score_gemma":0.00093331735,"threshold_uncertainty_score":0.023222446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55800015,0.00089533924,0.40621096,0.0026546563,0.0000780053,0.0003334412,0.00018421703,0.00014921864,0.031494047],"genre_scores_gemma":[0.9894211,0.00022678004,0.007958246,0.00005789532,0.00001037238,0.00006205057,0.00003214594,0.000009276148,0.0022221184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981779,0.00083593134,0.00007061701,0.00029506368,0.00029005844,0.0003304806],"domain_scores_gemma":[0.99397004,0.0035781413,0.0011203436,0.00044678102,0.0005097794,0.0003749694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002561915,0.0006788617,0.0007187671,0.0005621749,0.0009508858,0.0021766506,0.0013075679,0.0018395599,0.006901942],"category_scores_gemma":[0.008473854,0.0004305454,0.0007461473,0.00072702015,0.0012201843,0.004487528,0.001984603,0.001444621,0.00037889264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004569661,0.00030407848,0.0073130056,0.00030522945,0.0001293662,0.0012137791,0.0010342499,0.6942514,0.00857028,0.24588513,0.0019679393,0.038568527],"study_design_scores_gemma":[0.000096524374,0.00017311108,0.0012742743,0.00005049113,0.000055750716,0.00018755939,0.0006500714,0.8702764,0.0013908414,0.12254416,0.0032517025,0.000049063572],"about_ca_topic_score_codex":0.0048293457,"about_ca_topic_score_gemma":0.0045114476,"teacher_disagreement_score":0.006901942,"about_ca_system_score_codex":0.0021848495,"about_ca_system_score_gemma":0.00249322,"threshold_uncertainty_score":0.02308935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021324992,0.00071894366,0.9116526,0.002896959,0.00085070304,0.000116084964,0.008763096,0.014584255,0.03909226],"genre_scores_gemma":[0.36022142,0.00086154573,0.516323,0.0011000679,0.00027794266,0.0003012088,0.02704829,0.0054009976,0.088465564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942774,0.000091003596,0.00003051019,0.00012868934,0.00021401241,0.00010805348],"domain_scores_gemma":[0.9985216,0.00054373126,0.00006622824,0.00028937793,0.0004713208,0.00010777313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010104924,0.001065466,0.00048580233,0.0012536616,0.0005744586,0.0021962079,0.001655129,0.001361197,0.059709053],"category_scores_gemma":[0.008433493,0.00048605216,0.0009844421,0.0015167984,0.00051007024,0.0022842644,0.0013471363,0.0021996903,0.018973585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035165294,0.00025292512,0.0037268784,0.00042693186,0.000073787436,0.00014084709,0.000093322335,0.33689475,0.003040435,0.0736179,0.25932992,0.32205066],"study_design_scores_gemma":[0.000027730368,0.000013267355,0.00039066092,0.000028151377,0.0000072511534,0.000020356929,0.000022073058,0.95011735,0.0019787436,0.030803666,0.016581737,0.000008982905],"about_ca_topic_score_codex":0.024040144,"about_ca_topic_score_gemma":0.040757902,"teacher_disagreement_score":0.059709053,"about_ca_system_score_codex":0.002265556,"about_ca_system_score_gemma":0.0024456924,"threshold_uncertainty_score":0.19974667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9770145,0.0002468787,0.0035788363,0.0011312395,0.000022718548,0.000026141282,0.000048343205,0.0000043827135,0.017926883],"genre_scores_gemma":[0.9996469,0.000025832516,0.00009902606,0.000024341018,0.00000605122,0.0000016725467,0.0000050230383,3.5705725e-7,0.00019083168],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985782,0.000561675,0.000040321578,0.00015968709,0.00026644956,0.00039365733],"domain_scores_gemma":[0.9950147,0.0022703276,0.0014893304,0.00029206503,0.0004107317,0.00052275334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016629694,0.00029662516,0.00035037997,0.0005345237,0.0009494215,0.0026826833,0.00050160993,0.0011805771,0.0035931484],"category_scores_gemma":[0.006027962,0.0001193005,0.00056153495,0.00059126155,0.0017242145,0.0016239601,0.0018541842,0.0011815813,0.00017059717],"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.0006492802,0.0009988773,0.6749429,0.00014090499,0.00032517198,0.004822449,0.0037950983,0.032330696,0.0045992215,0.22025469,0.0014570939,0.05568362],"study_design_scores_gemma":[0.00009536654,0.00096803,0.7072086,0.00012655817,0.00036025912,0.001205139,0.0144740045,0.092824094,0.0015679493,0.17265834,0.008315697,0.00019601094],"about_ca_topic_score_codex":0.006743664,"about_ca_topic_score_gemma":0.008722183,"teacher_disagreement_score":0.006743664,"about_ca_system_score_codex":0.0017008682,"about_ca_system_score_gemma":0.00086501654,"threshold_uncertainty_score":0.01340884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89494437,0.00015510038,0.04172554,0.0010700343,0.000018084344,0.00015649076,0.000024546342,0.000046063822,0.061859753],"genre_scores_gemma":[0.99563944,0.000033361313,0.0025532728,0.00004303348,0.000007051899,0.000019085142,0.0000072472744,0.0000037379705,0.0016937888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.997106,0.0013463574,0.000091784306,0.00034574643,0.00046801672,0.00064212526],"domain_scores_gemma":[0.99290943,0.0023328583,0.0018107622,0.00092038023,0.00045622757,0.0015704068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030558666,0.00025999625,0.00039626492,0.0005565863,0.0016561411,0.002346368,0.00081868644,0.0011709399,0.006570101],"category_scores_gemma":[0.005516573,0.00036746394,0.0005125536,0.0004982867,0.003903937,0.0031727355,0.003465544,0.0014981163,0.0004216064],"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.0009940065,0.0011371035,0.04479811,0.00027616427,0.0001296527,0.002092432,0.0043042167,0.08530626,0.017325103,0.77251035,0.0017025007,0.06942415],"study_design_scores_gemma":[0.0007497913,0.0019197667,0.06867035,0.0002540382,0.00013305935,0.001774804,0.010511373,0.30322325,0.011318888,0.55688316,0.044368453,0.00019320661],"about_ca_topic_score_codex":0.002530299,"about_ca_topic_score_gemma":0.004347942,"teacher_disagreement_score":0.006570101,"about_ca_system_score_codex":0.003063449,"about_ca_system_score_gemma":0.0032060016,"threshold_uncertainty_score":0.022227049},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26869205,0.0002725147,0.7238007,0.00077381055,0.000088711764,0.00017264532,0.0002458624,0.0001084996,0.005845166],"genre_scores_gemma":[0.9612181,0.00016704474,0.032774623,0.00008544114,0.000052163814,0.00020793735,0.00020472235,0.000033568253,0.005256372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962446,0.0020750717,0.00011911346,0.0005339563,0.00045910483,0.0005680748],"domain_scores_gemma":[0.96369696,0.030036736,0.0018047986,0.00075728295,0.0023696136,0.0013346095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00925853,0.0009344518,0.0027399892,0.0022058035,0.001269686,0.0023073996,0.0027881756,0.0019402308,0.0061086398],"category_scores_gemma":[0.031563684,0.0005709953,0.001521045,0.0014254657,0.0026987984,0.004280695,0.0022110434,0.0019126012,0.0003518882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003700547,0.0002175236,0.0034568813,0.00018072008,0.00017844657,0.00024176712,0.0005271235,0.66368175,0.0011168419,0.31570843,0.0017085905,0.012611873],"study_design_scores_gemma":[0.000009071326,0.000021588812,0.00015014474,0.000004200925,0.000007964858,0.0000063600296,0.000037213613,0.97559446,0.000055468692,0.024038559,0.000068507696,0.000006490469],"about_ca_topic_score_codex":0.014252267,"about_ca_topic_score_gemma":0.007449843,"teacher_disagreement_score":0.014252267,"about_ca_system_score_codex":0.002673867,"about_ca_system_score_gemma":0.0028126624,"threshold_uncertainty_score":0.04896432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81951654,0.00021035977,0.13928372,0.001298421,0.00002534012,0.00019528261,0.00018512204,0.00006633925,0.03921896],"genre_scores_gemma":[0.9921119,0.00010999473,0.0037964617,0.000035028115,0.0000072921885,0.000049341346,0.00002267654,0.0000073990527,0.0038598476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901927,0.000446385,0.000027206946,0.00013964533,0.00008909032,0.0002784775],"domain_scores_gemma":[0.9950682,0.002944079,0.0009639109,0.00020506805,0.0002617373,0.00055700843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017539698,0.0006479859,0.00064480584,0.00071281515,0.0011879359,0.003179783,0.0011469311,0.0017663866,0.011544745],"category_scores_gemma":[0.006519719,0.0004448661,0.0007288588,0.0006184216,0.0017690817,0.0044501326,0.0018126838,0.0013129034,0.00058039615],"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.000789097,0.0005876824,0.01532364,0.00030724052,0.00016456972,0.0021437474,0.0015139093,0.3694491,0.012601859,0.57152545,0.002301582,0.023292197],"study_design_scores_gemma":[0.00012330455,0.00028089504,0.0037141144,0.00007352887,0.000079671256,0.00039595724,0.0021940146,0.69137925,0.0022247387,0.29644164,0.0029972466,0.000095621544],"about_ca_topic_score_codex":0.0028336074,"about_ca_topic_score_gemma":0.002456234,"teacher_disagreement_score":0.011544745,"about_ca_system_score_codex":0.0016560025,"about_ca_system_score_gemma":0.001423258,"threshold_uncertainty_score":0.03862101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025574937,0.00035567136,0.96354705,0.00053736434,0.00016761069,0.00032163624,0.0003912031,0.0038624092,0.005242022],"genre_scores_gemma":[0.13706297,0.00016400329,0.8537911,0.0001853254,0.00012886056,0.00028641828,0.0011758724,0.00044211186,0.0067632953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876153,0.00029911636,0.0000985797,0.00022505138,0.0003514614,0.00026424558],"domain_scores_gemma":[0.9960813,0.0023888706,0.00015761892,0.00037570507,0.0007117968,0.00028486305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027237544,0.0015612347,0.0027216116,0.0026201124,0.0018653362,0.002767214,0.0030301418,0.0024822236,0.025912637],"category_scores_gemma":[0.008252722,0.0010494441,0.0009319196,0.00299257,0.0008945781,0.0032665918,0.0023091072,0.0026850125,0.0044561597],"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.00090508215,0.00043609797,0.0011421812,0.00012388219,0.00006202743,0.00014971232,0.00015182939,0.34599525,0.0022804132,0.014398342,0.023663983,0.6106912],"study_design_scores_gemma":[0.00013466644,0.000065805034,0.00014083221,0.000009558222,0.000011517537,0.00003712765,0.000041873205,0.9873789,0.0006181749,0.010146937,0.0014047266,0.000009963681],"about_ca_topic_score_codex":0.012469725,"about_ca_topic_score_gemma":0.015792867,"teacher_disagreement_score":0.025912637,"about_ca_system_score_codex":0.0017935537,"about_ca_system_score_gemma":0.0044939,"threshold_uncertainty_score":0.08668643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24652018,0.00347072,0.71085876,0.0040434245,0.00026580092,0.00009060902,0.00031714208,0.0002937239,0.03413975],"genre_scores_gemma":[0.95172143,0.0014856547,0.020013642,0.00045048163,0.00020361342,0.00011760126,0.00023816946,0.00011037527,0.025658935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886143,0.0005431323,0.000036558693,0.00016393067,0.0001486764,0.0002462858],"domain_scores_gemma":[0.9929367,0.004494262,0.0009659994,0.00030568006,0.00049200025,0.00080539915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004406715,0.0019168138,0.0030413102,0.0018812366,0.0011293535,0.004130501,0.002537319,0.0033772432,0.004905573],"category_scores_gemma":[0.014026405,0.0013732642,0.0025519938,0.0011718224,0.0030262019,0.004803861,0.003026144,0.003250507,0.0005432216],"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.00011639561,0.00010024546,0.0008905713,0.00011558402,0.0001311915,0.00021414841,0.00008541036,0.62726516,0.000794019,0.36345148,0.0020233586,0.004812386],"study_design_scores_gemma":[0.000023209284,0.00002381996,0.00026030416,0.000028709705,0.000027283972,0.000067256486,0.000021767455,0.85210127,0.00007539944,0.1470408,0.0003077192,0.000022362552],"about_ca_topic_score_codex":0.0036975949,"about_ca_topic_score_gemma":0.0022133042,"teacher_disagreement_score":0.004905573,"about_ca_system_score_codex":0.0025335636,"about_ca_system_score_gemma":0.001714564,"threshold_uncertainty_score":0.023305237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6779761,0.0004874267,0.28871158,0.004121999,0.00038268525,0.0022585206,0.0002319246,0.0008597676,0.024970029],"genre_scores_gemma":[0.97046095,0.00003849323,0.028453885,0.00010651831,0.00002377502,0.00017415498,0.000034251734,0.000028123033,0.0006797336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9352204,0.05220809,0.0017988519,0.0026145126,0.005129552,0.003028646],"domain_scores_gemma":[0.8855803,0.077674925,0.0059332633,0.017475672,0.010200133,0.0031357477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.068676524,0.0005270409,0.00082443544,0.0010047565,0.0021870795,0.004763783,0.0033247531,0.002232163,0.004232407],"category_scores_gemma":[0.14053378,0.00040164753,0.00071998156,0.0012273313,0.0024211223,0.0054086517,0.0052142553,0.002499972,0.00042439986],"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.0055402643,0.0038694802,0.040354144,0.0005385869,0.00028739785,0.00028594641,0.005323244,0.19679774,0.005612635,0.25835657,0.004368974,0.478665],"study_design_scores_gemma":[0.0014290818,0.005510266,0.029926345,0.00048006582,0.00039949748,0.00026039194,0.0051701725,0.67019504,0.012649331,0.25327012,0.020384088,0.00032569052],"about_ca_topic_score_codex":0.004303493,"about_ca_topic_score_gemma":0.0028916385,"teacher_disagreement_score":0.068676524,"about_ca_system_score_codex":0.0041409074,"about_ca_system_score_gemma":0.0094459355,"threshold_uncertainty_score":0.3632005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021045087,0.0014936104,0.9700294,0.0016939703,0.00010668663,0.00018856353,0.00024561887,0.00024598997,0.00495109],"genre_scores_gemma":[0.7504591,0.0025026908,0.22862884,0.0011208331,0.00050927844,0.0012630224,0.0006701128,0.00022624624,0.014619841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948619,0.002994131,0.00023369186,0.00086755556,0.0005582066,0.0004844857],"domain_scores_gemma":[0.9753871,0.020719215,0.0018121911,0.00065142976,0.0009729356,0.00045708273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010142263,0.0023408048,0.0047292174,0.001303307,0.0012194343,0.0039041669,0.0034970867,0.0057765124,0.0051148743],"category_scores_gemma":[0.029797085,0.0013727668,0.0014506709,0.002138016,0.0032180652,0.0044431207,0.0026544265,0.004905538,0.0012666851],"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.00023796181,0.00008320075,0.00085634354,0.00018240606,0.000091671696,0.000115762705,0.00008136694,0.90230423,0.00021875999,0.07896176,0.0019362974,0.014930161],"study_design_scores_gemma":[0.0000455011,0.000042163745,0.0001577987,0.000034885972,0.000015462776,0.000031040985,0.000016384769,0.947501,0.0001300568,0.051594328,0.00041529778,0.000016112343],"about_ca_topic_score_codex":0.0050224513,"about_ca_topic_score_gemma":0.0028466133,"teacher_disagreement_score":0.010142263,"about_ca_system_score_codex":0.0024790284,"about_ca_system_score_gemma":0.0024071753,"threshold_uncertainty_score":0.0536381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2583323,0.0027335412,0.6991733,0.002869914,0.00017928267,0.00013900554,0.00039177595,0.00036597787,0.03581495],"genre_scores_gemma":[0.9725212,0.0010752822,0.020145258,0.00016590965,0.00010435975,0.00006783284,0.00012143732,0.00007592645,0.0057228077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754554,0.00083508075,0.00011321373,0.00024555778,0.0007526045,0.00050796615],"domain_scores_gemma":[0.9925015,0.004496945,0.0008609414,0.0006192099,0.0008203636,0.0007009354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052237175,0.001433217,0.0023980264,0.0020821125,0.0007009613,0.0037314352,0.001623828,0.0021885254,0.0028708281],"category_scores_gemma":[0.020249492,0.00080235425,0.0011984286,0.00097269035,0.0029210823,0.0033614777,0.0031011382,0.0020764808,0.00040363194],"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.0002827301,0.000105228595,0.0007360478,0.00016887303,0.00012615682,0.00016933538,0.00012656391,0.2604365,0.0027938513,0.7193482,0.0015046981,0.014201764],"study_design_scores_gemma":[0.000082964165,0.00012026804,0.0005697641,0.00005276879,0.000042479274,0.00013811843,0.00006354778,0.49695197,0.0011415122,0.49986425,0.0009392421,0.000033179134],"about_ca_topic_score_codex":0.002128094,"about_ca_topic_score_gemma":0.00075494684,"teacher_disagreement_score":0.0052237175,"about_ca_system_score_codex":0.0033694457,"about_ca_system_score_gemma":0.0030467124,"threshold_uncertainty_score":0.027626038},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016167292,0.00020814709,0.97600335,0.00041061494,0.00003528874,0.00009232526,0.00023892122,0.00016630959,0.006677816],"genre_scores_gemma":[0.7529283,0.00071181357,0.23053004,0.00045715246,0.00014353853,0.0006076295,0.0005704194,0.000245018,0.013806077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933414,0.002867471,0.0005892189,0.0011598215,0.0016092742,0.00043277576],"domain_scores_gemma":[0.9881364,0.006419754,0.0016369616,0.0015359465,0.0018837772,0.00038708336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008330991,0.0016984029,0.0013069478,0.0013391364,0.00053192425,0.0027160095,0.0014213868,0.0025286519,0.006118717],"category_scores_gemma":[0.025713952,0.0004678453,0.0013157417,0.0011244322,0.0020184615,0.0043779383,0.0022161398,0.0021735304,0.0009634042],"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.00007273842,0.00007672692,0.0010418115,0.0002589119,0.00009219268,0.00017121993,0.00018228492,0.13083039,0.006742671,0.8072647,0.0018303283,0.051436104],"study_design_scores_gemma":[0.000023233242,0.00020170238,0.00083144894,0.0001016492,0.000033815613,0.00016407596,0.00010809796,0.43957755,0.0029722915,0.5506649,0.0052576233,0.00006358467],"about_ca_topic_score_codex":0.00069416425,"about_ca_topic_score_gemma":0.00036348577,"teacher_disagreement_score":0.008330991,"about_ca_system_score_codex":0.0017023247,"about_ca_system_score_gemma":0.0012926408,"threshold_uncertainty_score":0.04405898},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1939715,0.00015709788,0.80377305,0.00028457807,0.00003295954,0.00002864891,0.00011969148,0.00060193345,0.0010304765],"genre_scores_gemma":[0.9102065,0.00012808306,0.08770027,0.000041603504,0.00005146625,0.00004758965,0.00028591475,0.000043583637,0.0014949756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.00008636503,0.000027390153,0.000112995105,0.000059358666,0.000070208785],"domain_scores_gemma":[0.9958734,0.0032890406,0.0002652779,0.00012500223,0.0003181498,0.0001291141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001314277,0.00048630452,0.0008836498,0.000939823,0.0006323077,0.0015312866,0.0012915467,0.0010631203,0.0016269882],"category_scores_gemma":[0.006564075,0.00076785305,0.0007102607,0.0006448311,0.00079068757,0.001797266,0.00066934986,0.0012803472,0.00027728418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009006998,0.00007714615,0.0025083038,0.00003558356,0.000037635236,0.00002951078,0.00003134511,0.96585864,0.0011841776,0.0070183952,0.0002935445,0.022835547],"study_design_scores_gemma":[0.0000010764734,0.0000036379417,0.0001012003,7.863056e-7,0.0000014941136,0.0000025567697,0.000002069029,0.9974886,0.00013055677,0.002252681,0.0000134987,0.0000017447081],"about_ca_topic_score_codex":0.008787308,"about_ca_topic_score_gemma":0.0070454506,"teacher_disagreement_score":0.008787308,"about_ca_system_score_codex":0.0012359145,"about_ca_system_score_gemma":0.0019777685,"threshold_uncertainty_score":0.017472327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2136428,0.001621892,0.774471,0.0024467078,0.00020035364,0.00009727149,0.00044299694,0.0008755912,0.006201433],"genre_scores_gemma":[0.95845103,0.00020094369,0.035765935,0.00022995876,0.00007273508,0.00008145818,0.00029383885,0.000051928,0.0048520723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958605,0.00014744517,0.000015821568,0.00008990308,0.000061889026,0.000098865756],"domain_scores_gemma":[0.99776065,0.001631386,0.0001598628,0.00006553177,0.00024381443,0.00013871517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014930364,0.00082118943,0.0015339333,0.00040023087,0.00035393948,0.0008698572,0.0016336379,0.002161064,0.0037794616],"category_scores_gemma":[0.0044460893,0.0006542765,0.00050549605,0.0005129828,0.00092208484,0.001250069,0.0010317891,0.002346356,0.00032934322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087183005,0.000054586722,0.0003745793,0.000035318022,0.0000146516595,0.000025899344,0.000013529702,0.9850616,0.00019913785,0.0023532745,0.0007818945,0.0109983655],"study_design_scores_gemma":[0.0000048388583,0.0000056369113,0.000024942647,0.0000015465021,0.0000011567895,0.0000012170696,0.0000010712644,0.9991019,0.00002826628,0.00079948374,0.000029020719,9.205788e-7],"about_ca_topic_score_codex":0.019007634,"about_ca_topic_score_gemma":0.014834653,"teacher_disagreement_score":0.019007634,"about_ca_system_score_codex":0.001645509,"about_ca_system_score_gemma":0.002214743,"threshold_uncertainty_score":0.037793994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07969751,0.0061521656,0.80583084,0.007003139,0.00043494135,0.00013896232,0.00020552895,0.00021553221,0.100321405],"genre_scores_gemma":[0.7384208,0.003015159,0.23520772,0.0014211865,0.00047006458,0.00014831072,0.00016085824,0.00037914386,0.020776717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982913,0.00093125756,0.00005307287,0.00014058975,0.00036722067,0.0002164893],"domain_scores_gemma":[0.98377335,0.0138281975,0.0003395236,0.0007464453,0.00096007215,0.00035230708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005102178,0.00090031663,0.0015422256,0.0010822476,0.0013771285,0.002044959,0.0019388803,0.001930655,0.014616172],"category_scores_gemma":[0.03243265,0.00048067258,0.0013409774,0.001244752,0.0021243992,0.00527928,0.0019937807,0.0034007374,0.00090731017],"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.00024308184,0.00027266625,0.0013086689,0.0005060258,0.00008135399,0.00024245972,0.0005486681,0.18441081,0.0014898521,0.72291946,0.014616232,0.07336062],"study_design_scores_gemma":[0.00004927689,0.00021181027,0.00035246043,0.00013678396,0.000064035106,0.00018048167,0.00019450246,0.69538903,0.0007673635,0.29747018,0.0051620468,0.00002194148],"about_ca_topic_score_codex":0.003525197,"about_ca_topic_score_gemma":0.005919927,"teacher_disagreement_score":0.014616172,"about_ca_system_score_codex":0.0009960851,"about_ca_system_score_gemma":0.0018062012,"threshold_uncertainty_score":0.048895955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83728635,0.0010099922,0.082160436,0.015898837,0.0003194478,0.0001367426,0.00064374966,0.0002860924,0.062258378],"genre_scores_gemma":[0.993881,0.00016146868,0.0014314975,0.00015717822,0.000028320168,0.00001325719,0.000034471115,0.00001953897,0.0042732726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834585,0.00054736267,0.00006517246,0.00028807783,0.00011947903,0.00063401763],"domain_scores_gemma":[0.9900449,0.0070643853,0.0011946849,0.00031057987,0.0006414685,0.0007439796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036981006,0.00071413454,0.0029741076,0.00090492517,0.0011059996,0.005055319,0.0019516615,0.006146298,0.012526669],"category_scores_gemma":[0.015271746,0.001560852,0.0013493006,0.001077146,0.0025024,0.0054948297,0.0016163929,0.0045050317,0.0005796835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015752782,0.0008314142,0.0073609008,0.000309895,0.00027793087,0.0016340435,0.0005336713,0.5586898,0.0040830546,0.4033171,0.008937709,0.012449222],"study_design_scores_gemma":[0.00024547198,0.00019145182,0.0047839666,0.000059140923,0.00013643394,0.00024555603,0.0008390595,0.827723,0.0006906181,0.1630255,0.0019640895,0.000095701405],"about_ca_topic_score_codex":0.021012414,"about_ca_topic_score_gemma":0.016493062,"teacher_disagreement_score":0.021012414,"about_ca_system_score_codex":0.0056696846,"about_ca_system_score_gemma":0.006173999,"threshold_uncertainty_score":0.04190588},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003758262,0.002945987,0.9829638,0.0006043312,0.0006996266,0.00008764121,0.0003152619,0.00061321084,0.008011973],"genre_scores_gemma":[0.2930723,0.008777304,0.6651516,0.002690491,0.005354006,0.0015588662,0.0027231756,0.002904643,0.01776753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99045485,0.0021596919,0.0005338974,0.0013009743,0.0045290054,0.0010215029],"domain_scores_gemma":[0.9769911,0.016230842,0.0016056455,0.0019219939,0.0025762178,0.0006741729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011679137,0.005876635,0.0039657005,0.005486732,0.0016287791,0.007298914,0.0059423195,0.003331113,0.0073939306],"category_scores_gemma":[0.031822268,0.0019742767,0.003726413,0.004931279,0.0019955803,0.008255743,0.004318477,0.01048579,0.0021387516],"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.0009419034,0.00042534887,0.00096087373,0.0012625788,0.0004877907,0.00021026758,0.00025436873,0.5868696,0.012425624,0.19079776,0.028795606,0.17656831],"study_design_scores_gemma":[0.000043310094,0.00017716052,0.00027645292,0.00011890422,0.000073935065,0.000095494215,0.000016429176,0.9402539,0.0019453621,0.049469408,0.007482472,0.000047077134],"about_ca_topic_score_codex":0.0023504326,"about_ca_topic_score_gemma":0.0022193105,"teacher_disagreement_score":0.011679137,"about_ca_system_score_codex":0.0035669364,"about_ca_system_score_gemma":0.002531464,"threshold_uncertainty_score":0.06176597},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100290645,0.76299584,0.037634306,0.09130045,0.0079149995,0.00003680476,0.00040204765,0.00013176369,0.089554764],"genre_scores_gemma":[0.1346109,0.80488795,0.014545877,0.014240558,0.008238829,0.00007286265,0.00046441058,0.00021119628,0.02272754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986143,0.0005682912,0.00006648691,0.00024047591,0.000396274,0.0001140054],"domain_scores_gemma":[0.99618727,0.0023065112,0.00025073535,0.0003102878,0.0006623521,0.00028298027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030455668,0.0007966499,0.00086338236,0.0015695705,0.0012995277,0.0049469834,0.0013847735,0.002547543,0.007724598],"category_scores_gemma":[0.008263294,0.00042252662,0.00044983145,0.00370536,0.0049934965,0.012566025,0.0020257006,0.00431013,0.0020152233],"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.00013948689,0.0000793662,0.0012756648,0.001137882,0.00004039674,0.00014813,0.0007384361,0.0048750644,0.00031811275,0.67406327,0.041656137,0.27552816],"study_design_scores_gemma":[0.000008195112,0.000056927143,0.0007617127,0.0013928715,0.00001580855,0.00021395992,0.0007963287,0.0019495594,0.00015291202,0.3595442,0.6350683,0.00003922876],"about_ca_topic_score_codex":0.0038732453,"about_ca_topic_score_gemma":0.003779634,"teacher_disagreement_score":0.007724598,"about_ca_system_score_codex":0.002716034,"about_ca_system_score_gemma":0.0023877441,"threshold_uncertainty_score":0.025841415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.983595,0.00047905897,0.0014347003,0.0014153861,0.000050120725,0.000021198237,0.00022020903,0.000045949084,0.012738494],"genre_scores_gemma":[0.9986029,0.00009091497,0.000088770816,0.000031487463,0.0000132932355,0.0000040643226,0.00002537386,0.0000019766169,0.0011411794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99842924,0.0004356382,0.00007839757,0.0001649461,0.00020556457,0.0006862191],"domain_scores_gemma":[0.95547444,0.033601828,0.0036512278,0.0011075865,0.0023528684,0.0038120267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004478958,0.00025094885,0.00085698,0.00091043377,0.0009572027,0.003235042,0.0006381195,0.0023196186,0.01704376],"category_scores_gemma":[0.03920998,0.00021122918,0.0005464457,0.00062836014,0.0014064775,0.0025227412,0.001593313,0.0011790021,0.00075653085],"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.007116557,0.0020609542,0.3044795,0.0009151144,0.00042369682,0.0030177631,0.0011959086,0.3243314,0.014395388,0.22027956,0.008941746,0.11284242],"study_design_scores_gemma":[0.0013763069,0.0027152845,0.44733936,0.0002895066,0.0011132491,0.0011649227,0.0060103782,0.34151214,0.008637258,0.17477113,0.014860444,0.00021003865],"about_ca_topic_score_codex":0.0069366605,"about_ca_topic_score_gemma":0.00613708,"teacher_disagreement_score":0.01704376,"about_ca_system_score_codex":0.0022866977,"about_ca_system_score_gemma":0.003472251,"threshold_uncertainty_score":0.057017088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2852029,0.0012799344,0.6836497,0.0016472553,0.00027930926,0.0005148056,0.0014273009,0.0013407561,0.024658088],"genre_scores_gemma":[0.8155072,0.00047726074,0.16851158,0.0002540274,0.00007453428,0.00026725067,0.0009966481,0.00016208582,0.013749403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932694,0.00022041608,0.000025778849,0.00018315077,0.00007396517,0.00016984715],"domain_scores_gemma":[0.9993358,0.0003768415,0.000089296336,0.000041402334,0.00007185585,0.00008467189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000648495,0.0012039153,0.0012217672,0.0005058077,0.000612582,0.0013438833,0.0012202994,0.0014621217,0.005201538],"category_scores_gemma":[0.0014025925,0.0006611834,0.00089396216,0.0009271703,0.00047188837,0.0010820822,0.0008117561,0.0011196006,0.00047782378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018293038,0.000097883,0.00066540693,0.00014797591,0.000041307212,0.00033824248,0.000059223254,0.9649331,0.0015447757,0.007584431,0.0034485848,0.020956129],"study_design_scores_gemma":[0.000052733725,0.00011116718,0.00031639813,0.000011057532,0.000026276432,0.0001384472,0.00008734778,0.99049604,0.00079590967,0.0052399626,0.0027113678,0.000013235219],"about_ca_topic_score_codex":0.0073338095,"about_ca_topic_score_gemma":0.0073374896,"teacher_disagreement_score":0.0073338095,"about_ca_system_score_codex":0.001077632,"about_ca_system_score_gemma":0.001741981,"threshold_uncertainty_score":0.01740092},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012662144,0.000041923806,0.9863138,0.00006727531,0.00001800148,0.00008678632,0.0000069580688,0.00005180761,0.0007513916],"genre_scores_gemma":[0.49735457,0.00009724885,0.4997552,0.00006229561,0.000054650438,0.00052649796,0.0000345175,0.000061413506,0.0020536743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610054,0.0026683174,0.00014386217,0.00038573865,0.0005094562,0.00019208375],"domain_scores_gemma":[0.9901439,0.008048249,0.00035075634,0.00046789256,0.0007017331,0.00028739366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007997557,0.0008533733,0.0020566923,0.0013442521,0.001044596,0.0016464917,0.0025098012,0.0018696924,0.0032037941],"category_scores_gemma":[0.015106702,0.0006319221,0.0014990859,0.0011994124,0.0011423957,0.0032857256,0.0023158214,0.002012921,0.00021819171],"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.00043059984,0.00061875,0.0028197314,0.0002254818,0.00029983782,0.00030466283,0.00080321875,0.6629423,0.0041525485,0.14492105,0.00146429,0.18101756],"study_design_scores_gemma":[0.000025411962,0.000054695924,0.00012198893,0.0000075776697,0.00003106714,0.000025548601,0.000031146497,0.9830257,0.00026704845,0.016196659,0.00020194895,0.000011221039],"about_ca_topic_score_codex":0.0016270338,"about_ca_topic_score_gemma":0.0014332101,"teacher_disagreement_score":0.007997557,"about_ca_system_score_codex":0.0010656329,"about_ca_system_score_gemma":0.0017143674,"threshold_uncertainty_score":0.042295635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004863943,0.00020193541,0.99196917,0.00013250069,0.00004900572,0.00005581784,0.000102976934,0.00019387795,0.0024307831],"genre_scores_gemma":[0.24391514,0.00045737793,0.7485763,0.00039835024,0.00009570965,0.0004064674,0.0006336864,0.00039642677,0.005120558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991567,0.00032876822,0.00003357701,0.00016055678,0.00019396566,0.00012651522],"domain_scores_gemma":[0.99884784,0.0006637504,0.000114731716,0.000101081256,0.00016964207,0.000102835336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013232764,0.001382538,0.0013863266,0.0008486786,0.0004459902,0.001459581,0.0017552461,0.0013682741,0.0064702574],"category_scores_gemma":[0.0033872165,0.0006216022,0.0012714161,0.0011015686,0.0005538994,0.001413332,0.0015907115,0.0020470123,0.0008168856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008466791,0.00007724998,0.00027568388,0.0001307521,0.000027938997,0.00007606088,0.00005704112,0.9389787,0.0016586756,0.017408062,0.002157059,0.03906817],"study_design_scores_gemma":[0.0000069932485,0.00001839575,0.000027410008,0.0000088175775,0.0000035855044,0.000011247199,0.000009741097,0.9952023,0.00016747166,0.0036969879,0.0008432472,0.000003729608],"about_ca_topic_score_codex":0.004886384,"about_ca_topic_score_gemma":0.0042993654,"teacher_disagreement_score":0.0064702574,"about_ca_system_score_codex":0.0012604563,"about_ca_system_score_gemma":0.001726718,"threshold_uncertainty_score":0.021645188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08125142,0.000293989,0.88935846,0.0013378774,0.0001212064,0.00017096428,0.0001445836,0.00022781668,0.027093714],"genre_scores_gemma":[0.96329105,0.0003498309,0.028499201,0.00020539957,0.000050111128,0.00015902835,0.00003244223,0.000027960737,0.007385061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987086,0.0005135351,0.00003552396,0.00019651871,0.00027654757,0.0002692869],"domain_scores_gemma":[0.99801815,0.0014368019,0.00022795759,0.00006156743,0.0001404666,0.00011497286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019497798,0.0010542017,0.0012600836,0.0008199395,0.00045636704,0.0019168257,0.0018689868,0.002201247,0.006198228],"category_scores_gemma":[0.004940575,0.0005545674,0.0010633123,0.000497515,0.0022777943,0.0022938128,0.0011745056,0.0019835096,0.00027941572],"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.000079310026,0.00010432964,0.00044172158,0.00007619755,0.000054412125,0.00019027629,0.000114152535,0.7622679,0.001960108,0.22539826,0.00076126924,0.008552106],"study_design_scores_gemma":[0.000041878782,0.000088912915,0.0001557338,0.0000143988245,0.000026349968,0.000033254793,0.00005538363,0.9164422,0.0005190084,0.08170206,0.00089900487,0.000021751053],"about_ca_topic_score_codex":0.0060441634,"about_ca_topic_score_gemma":0.0036322055,"teacher_disagreement_score":0.006198228,"about_ca_system_score_codex":0.002751822,"about_ca_system_score_gemma":0.002207391,"threshold_uncertainty_score":0.020735145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9282667,0.0002726834,0.062349137,0.0004871372,0.000027897091,0.00024216353,0.000093124756,0.00009875919,0.008162508],"genre_scores_gemma":[0.9961958,0.000021193364,0.003457395,0.000011728557,0.000003704384,0.00003992148,0.000011891348,0.000006286106,0.00025217197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916372,0.0052628717,0.00027958097,0.00081956247,0.001268459,0.00073237193],"domain_scores_gemma":[0.95077175,0.040927134,0.003452078,0.0015494861,0.002120622,0.0011789718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0132873105,0.0009947328,0.001607854,0.0012482854,0.0005862145,0.0040552565,0.0013550874,0.0017423831,0.0018619159],"category_scores_gemma":[0.0451824,0.0005272791,0.00093854737,0.001067381,0.001217514,0.0026075023,0.0016996929,0.0016813371,0.00015253399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001774611,0.00081260316,0.04202365,0.0002534829,0.0008184409,0.00016018008,0.0004963622,0.8596273,0.0040947264,0.048858374,0.0005003855,0.04057986],"study_design_scores_gemma":[0.00010066574,0.00097108097,0.016541447,0.000038335307,0.00020352246,0.000032693228,0.00045054842,0.95611304,0.0030610028,0.02186429,0.00057999836,0.000043285927],"about_ca_topic_score_codex":0.0047505265,"about_ca_topic_score_gemma":0.0035148803,"teacher_disagreement_score":0.0132873105,"about_ca_system_score_codex":0.0031126917,"about_ca_system_score_gemma":0.002544075,"threshold_uncertainty_score":0.07027084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067975647,0.00052590336,0.9894622,0.00025518597,0.00004476456,0.00001741644,0.000044788216,0.00013178712,0.0027203304],"genre_scores_gemma":[0.5913108,0.0014576328,0.4005826,0.00020407116,0.0003260162,0.00020043884,0.00031585645,0.0004974937,0.005105082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952394,0.002701507,0.00021860388,0.0004928328,0.0010991554,0.00024849144],"domain_scores_gemma":[0.9663326,0.02868833,0.0014789285,0.0013527465,0.0018401088,0.0003072961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01162389,0.002097138,0.001440853,0.0016039639,0.00050608115,0.0034613078,0.0019293003,0.0026114204,0.0027689964],"category_scores_gemma":[0.055168454,0.00097426475,0.0013947025,0.0017059068,0.002083983,0.0035201067,0.0023175185,0.002621184,0.00056426204],"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.00013859573,0.00004168333,0.00035407458,0.00013172922,0.000068167465,0.00015091039,0.00007485433,0.89375573,0.0015617341,0.07971866,0.000954444,0.02304937],"study_design_scores_gemma":[0.0000089227915,0.000027495538,0.00011579378,0.000032054955,0.0000139346985,0.00007259823,0.000013682911,0.94536537,0.00083950354,0.05307567,0.00041581297,0.000019138863],"about_ca_topic_score_codex":0.0007589991,"about_ca_topic_score_gemma":0.0006591672,"teacher_disagreement_score":0.01162389,"about_ca_system_score_codex":0.001090937,"about_ca_system_score_gemma":0.00095553574,"threshold_uncertainty_score":0.061473727},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46162507,0.0013444854,0.5283552,0.0006227851,0.000094443574,0.00016654225,0.0003845645,0.0003884338,0.007018444],"genre_scores_gemma":[0.97659135,0.00021072553,0.021984367,0.000036943344,0.0000146220755,0.00002370208,0.0001372621,0.00002307151,0.000977893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964666,0.00009050642,0.000021073045,0.00007432298,0.00007413645,0.00009328772],"domain_scores_gemma":[0.9987608,0.0006877762,0.00025308787,0.00004977672,0.00014626565,0.00010229761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097537873,0.00074377976,0.0011299396,0.0006505703,0.00032545353,0.0011836896,0.00080015755,0.0007911322,0.0016669346],"category_scores_gemma":[0.0026286968,0.00065482483,0.00039611064,0.00059011363,0.00049699744,0.0011654787,0.00040227312,0.000933143,0.00021608721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008069114,0.000030471097,0.0006427019,0.000042299882,0.000009494579,0.00004780637,0.000022175509,0.9882585,0.0009997536,0.0018201971,0.0003084494,0.0077373465],"study_design_scores_gemma":[0.0000053086887,0.000021042475,0.00019964887,0.000003968342,0.0000043596847,0.0000061318856,0.000010445312,0.9985079,0.00022265498,0.0009166366,0.0000981857,0.0000035919497],"about_ca_topic_score_codex":0.010713187,"about_ca_topic_score_gemma":0.010996148,"teacher_disagreement_score":0.010713187,"about_ca_system_score_codex":0.0012876691,"about_ca_system_score_gemma":0.0020722058,"threshold_uncertainty_score":0.021301687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8914681,0.0001624231,0.036814418,0.00068965455,0.000021305192,0.00007673128,0.000112282105,0.00006612077,0.07058898],"genre_scores_gemma":[0.99590755,0.000022040524,0.00093936134,0.000016270023,0.000004783301,0.0000108346385,0.000023723098,0.0000031449092,0.003072361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979693,0.00053830206,0.00009305839,0.00030338636,0.00036307992,0.0007328718],"domain_scores_gemma":[0.9894225,0.0053206068,0.0015873457,0.0021273815,0.0009240112,0.0006181908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020422516,0.00032921328,0.000466673,0.0005147252,0.0011906986,0.0038870547,0.00082606316,0.0015769498,0.017044423],"category_scores_gemma":[0.007581065,0.00041721374,0.0005424662,0.0006528735,0.001754759,0.006841208,0.00365726,0.0009709306,0.00071007904],"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.000815765,0.00017627119,0.02080914,0.00018530867,0.0001316603,0.0010531675,0.0025683877,0.026655061,0.010522298,0.8956638,0.0020563654,0.039362747],"study_design_scores_gemma":[0.00017043634,0.0006060591,0.02030204,0.00020677662,0.0002224389,0.0007936671,0.0087420335,0.13892986,0.0134964995,0.8024552,0.014005146,0.000069732465],"about_ca_topic_score_codex":0.0019371926,"about_ca_topic_score_gemma":0.0013530595,"teacher_disagreement_score":0.017044423,"about_ca_system_score_codex":0.0010477653,"about_ca_system_score_gemma":0.0019035826,"threshold_uncertainty_score":0.057019293},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054350633,0.0003713598,0.92883945,0.0013536118,0.00005883125,0.00027345496,0.00037331012,0.00020095806,0.014178534],"genre_scores_gemma":[0.85206544,0.00046882502,0.14233735,0.00014418128,0.00004182598,0.00027457016,0.00025420025,0.0000802332,0.0043333843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998429,0.0007176851,0.00004601354,0.00020412126,0.00021393009,0.00038924566],"domain_scores_gemma":[0.997682,0.0015223403,0.00023964111,0.00020239186,0.00015797252,0.00019570021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026922838,0.0011460836,0.001453811,0.00092931057,0.0009677593,0.0026645444,0.0016515754,0.0018647832,0.008277871],"category_scores_gemma":[0.0075360197,0.0008629601,0.0012637711,0.0017346506,0.0017789267,0.004651548,0.0019438539,0.0023898897,0.0005305879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050431772,0.00005825602,0.00031979178,0.00007371052,0.00002212497,0.00005496325,0.00008440789,0.8575259,0.0004359826,0.130763,0.0013419966,0.009269455],"study_design_scores_gemma":[0.000020306921,0.00003860286,0.00014323634,0.00002035295,0.00001143303,0.000025504642,0.00013949751,0.87620366,0.00028673466,0.12152567,0.0015717001,0.0000132314435],"about_ca_topic_score_codex":0.014942046,"about_ca_topic_score_gemma":0.015754135,"teacher_disagreement_score":0.014942046,"about_ca_system_score_codex":0.0047601108,"about_ca_system_score_gemma":0.006359616,"threshold_uncertainty_score":0.034537196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9671888,0.00039551884,0.004651096,0.0001598376,0.00006409501,0.00007386964,0.00079286465,0.00021975783,0.026454298],"genre_scores_gemma":[0.99024886,0.00013116123,0.002283847,0.000027653161,0.000022878905,0.000015524922,0.0007248702,0.000024283385,0.0065209423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988985,0.00007990828,0.000078307654,0.000109767374,0.00059019116,0.00024331437],"domain_scores_gemma":[0.9939075,0.0014124413,0.0010854984,0.00068096485,0.0019456171,0.00096790114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013342516,0.00039174047,0.00045041667,0.0026919753,0.00078863406,0.0036214706,0.0006364523,0.0004823934,0.009280027],"category_scores_gemma":[0.0038470728,0.000406434,0.00035926915,0.0017763062,0.00036381563,0.0022498362,0.0011113881,0.0005401786,0.0021355788],"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.011240708,0.0014048136,0.35953715,0.0004861678,0.00022427994,0.0021264136,0.0023819588,0.024506556,0.0602317,0.016501214,0.0063832123,0.5149759],"study_design_scores_gemma":[0.00015915482,0.008058189,0.77548647,0.00021455935,0.00042706451,0.0014490478,0.010026126,0.08896555,0.06645511,0.012712354,0.035758782,0.00028749323],"about_ca_topic_score_codex":0.003264579,"about_ca_topic_score_gemma":0.0066800597,"teacher_disagreement_score":0.009280027,"about_ca_system_score_codex":0.00118345,"about_ca_system_score_gemma":0.0018378717,"threshold_uncertainty_score":0.031044781},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007902415,0.0005918694,0.9712455,0.0011841209,0.00009456769,0.000092033646,0.000058394744,0.000042687643,0.018788388],"genre_scores_gemma":[0.6754412,0.0020180317,0.3089305,0.00063867227,0.00047636678,0.0006745505,0.00010848035,0.00012596896,0.011586299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99203694,0.0050028856,0.00028757978,0.00088905846,0.0012775286,0.00050593895],"domain_scores_gemma":[0.98352456,0.012360866,0.0014572176,0.0013031849,0.00083874917,0.00051534537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008793706,0.0021602889,0.0012729779,0.0015191567,0.0017768042,0.004312806,0.0033048356,0.0022208008,0.006174353],"category_scores_gemma":[0.028504245,0.00091042684,0.0015144626,0.0017363689,0.0060434816,0.0061821057,0.00402627,0.005808906,0.000754634],"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.000028949156,0.00001797002,0.00014868978,0.00006288349,0.000023268622,0.00003730516,0.00021348264,0.055048868,0.0003030007,0.93788576,0.00059103995,0.0056386245],"study_design_scores_gemma":[0.000014233981,0.000022525352,0.000052369964,0.000030293082,0.0000131867355,0.000025202766,0.000053896547,0.12789528,0.00019689812,0.86930364,0.0023774377,0.000015049044],"about_ca_topic_score_codex":0.0020147217,"about_ca_topic_score_gemma":0.0019145018,"teacher_disagreement_score":0.008793706,"about_ca_system_score_codex":0.0037552353,"about_ca_system_score_gemma":0.0022620654,"threshold_uncertainty_score":0.046506166},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008710541,0.062084645,0.8799161,0.028237795,0.0011139703,0.00007044008,0.00010084139,0.0003285921,0.019437049],"genre_scores_gemma":[0.30309114,0.07616769,0.60656035,0.0043660384,0.0036235051,0.00027483396,0.00016844156,0.00034748466,0.005400465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552685,0.003013583,0.00017567039,0.00028444428,0.00090286,0.00009657058],"domain_scores_gemma":[0.9737154,0.02317371,0.0005104151,0.0014484177,0.0008921005,0.00026003085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008791786,0.0014450847,0.0025183212,0.0016611528,0.0006389195,0.0066359905,0.0023007714,0.0032975916,0.003228531],"category_scores_gemma":[0.022317402,0.0007167342,0.0013697018,0.0019044535,0.007076254,0.01040911,0.003398101,0.0075300564,0.00080834236],"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.0001519796,0.00016753637,0.001126784,0.001236942,0.0002500434,0.00006054384,0.00022798181,0.17724697,0.00072007964,0.59654284,0.0068673305,0.21540105],"study_design_scores_gemma":[0.000032766133,0.000055984045,0.00021989133,0.0003281648,0.000031011197,0.000030280433,0.000096239004,0.32780215,0.00026135985,0.6546447,0.016454335,0.000043058808],"about_ca_topic_score_codex":0.004383943,"about_ca_topic_score_gemma":0.0039050444,"teacher_disagreement_score":0.008791786,"about_ca_system_score_codex":0.0015809761,"about_ca_system_score_gemma":0.0024289836,"threshold_uncertainty_score":0.046495974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015483256,0.00032087282,0.9780724,0.0004094032,0.000033255434,0.00005730515,0.00011675242,0.00008400537,0.0054227933],"genre_scores_gemma":[0.78061694,0.0012443678,0.20861034,0.00019429615,0.00011025345,0.00034060807,0.0003262228,0.00005360855,0.008503387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979983,0.0008484529,0.00010310595,0.000428048,0.00046258222,0.00015950124],"domain_scores_gemma":[0.99751043,0.0014617774,0.00035025706,0.00012363907,0.00041348548,0.00014035632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023741222,0.0012666682,0.0011051886,0.0018909259,0.0010077001,0.0024258844,0.0022425565,0.0019094442,0.003649609],"category_scores_gemma":[0.005656716,0.0005176293,0.0018132075,0.0025269745,0.001401405,0.004321716,0.0015202812,0.002013865,0.00046790863],"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.000062616586,0.000038284274,0.0010206505,0.00011936067,0.000096807715,0.0003863076,0.00042263712,0.5980738,0.0008377631,0.37963998,0.0011965934,0.018105198],"study_design_scores_gemma":[0.000008316915,0.000015242177,0.00010854542,0.000008418445,0.000016741436,0.00004206277,0.00006464616,0.9028889,0.00011088756,0.09589557,0.000826379,0.000014327826],"about_ca_topic_score_codex":0.010509968,"about_ca_topic_score_gemma":0.007451232,"teacher_disagreement_score":0.010509968,"about_ca_system_score_codex":0.0027586743,"about_ca_system_score_gemma":0.0013834949,"threshold_uncertainty_score":0.020897567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112128094,0.000735192,0.87376237,0.00073803146,0.00008513193,0.00023698961,0.000206613,0.00033988626,0.011767706],"genre_scores_gemma":[0.8444917,0.00019612633,0.14931145,0.0001984827,0.000024164212,0.00031300454,0.00025568184,0.00005745716,0.005151867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993722,0.00026716464,0.000021657956,0.00012333067,0.00008659788,0.00012902688],"domain_scores_gemma":[0.99876547,0.00077791006,0.000105693245,0.000045118533,0.00016534301,0.00014039759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013033443,0.00086894963,0.0015293922,0.000494885,0.00083408906,0.0012707212,0.0016047423,0.001605719,0.0054190014],"category_scores_gemma":[0.0025071024,0.0005886517,0.0008207721,0.0005993273,0.0007078403,0.001158035,0.0017023984,0.00095673866,0.00035213752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006698389,0.00003953516,0.0003583933,0.00003005632,0.000018996332,0.00006641788,0.000026018373,0.990551,0.00028888855,0.0028548562,0.00054585404,0.0051529948],"study_design_scores_gemma":[0.000010269319,0.000017358414,0.00003504236,0.000001908183,0.000004059718,0.0000054060984,0.000012665024,0.9991881,0.000040256156,0.0005605586,0.00012242995,0.0000018965919],"about_ca_topic_score_codex":0.014591865,"about_ca_topic_score_gemma":0.013206364,"teacher_disagreement_score":0.014591865,"about_ca_system_score_codex":0.0012764715,"about_ca_system_score_gemma":0.0020315284,"threshold_uncertainty_score":0.029013872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13117702,0.0003996748,0.8488131,0.00125322,0.00012252457,0.00010188621,0.00030340135,0.00014327264,0.017685954],"genre_scores_gemma":[0.92685616,0.00033313478,0.062125452,0.00014323043,0.000055189033,0.00014035379,0.00016752425,0.00005451408,0.010124539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947494,0.00020792577,0.000023711233,0.00009883356,0.00009233673,0.000102280974],"domain_scores_gemma":[0.9991153,0.0005754066,0.000103743514,0.00006834054,0.00006969921,0.000067517234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095769664,0.00087293715,0.0010129953,0.00055194786,0.0005284159,0.0013868614,0.0012848942,0.0017882839,0.002668662],"category_scores_gemma":[0.003653318,0.00042728428,0.0007789243,0.0006348632,0.0012419826,0.0024302283,0.0013766984,0.00084449106,0.00016231427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073519346,0.00002597005,0.00032842671,0.000054935095,0.000011548102,0.00014879527,0.00006277519,0.9188518,0.0005974872,0.07317722,0.0009785854,0.0056888447],"study_design_scores_gemma":[0.000011085701,0.000016504137,0.00005992633,0.000006859919,0.000003458584,0.000031185522,0.00003556889,0.9806999,0.00021008325,0.018258225,0.00066019886,0.000007053129],"about_ca_topic_score_codex":0.005847884,"about_ca_topic_score_gemma":0.0026645218,"teacher_disagreement_score":0.005847884,"about_ca_system_score_codex":0.0017185949,"about_ca_system_score_gemma":0.00072453055,"threshold_uncertainty_score":0.012469351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6674012,0.00028276184,0.3276968,0.00041517385,0.000015975122,0.00004290203,0.00012914078,0.000073995,0.0039419592],"genre_scores_gemma":[0.99468416,0.00007582377,0.004733189,0.000009868824,0.0000036743495,0.000009875915,0.000026577813,0.000009452494,0.00044743964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994573,0.00024814438,0.000028244642,0.00009316489,0.00006766471,0.00010546188],"domain_scores_gemma":[0.9930494,0.005349206,0.0010504416,0.0002095012,0.00019095685,0.00015053985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024195046,0.0006006872,0.0009745149,0.0005599521,0.00026574818,0.0017266531,0.00070541026,0.0010814797,0.0011431517],"category_scores_gemma":[0.01228483,0.0005675077,0.00071961223,0.00042819823,0.0012665306,0.0018589976,0.0010290458,0.0008812156,0.00007547681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032185035,0.000014477148,0.0014249835,0.000014772347,0.000019294095,0.000073308816,0.000024447332,0.989481,0.0007883274,0.006499746,0.00004927625,0.0015782337],"study_design_scores_gemma":[0.000003313478,0.000020465859,0.0007833475,0.000005001533,0.0000070343813,0.000015165152,0.000019994686,0.9925564,0.00027534165,0.0062647215,0.000040872445,0.000008405222],"about_ca_topic_score_codex":0.0066480273,"about_ca_topic_score_gemma":0.0037183103,"teacher_disagreement_score":0.0066480273,"about_ca_system_score_codex":0.001328145,"about_ca_system_score_gemma":0.0010184606,"threshold_uncertainty_score":0.013218701},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014660432,0.000029543164,0.9979468,0.000026456422,0.000008066013,0.000023890218,0.000007865141,0.0000613171,0.00043007339],"genre_scores_gemma":[0.058073293,0.00012630316,0.94026214,0.000042313804,0.000026830987,0.00018786623,0.000074249096,0.00012725056,0.0010797102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998302,0.000759845,0.00011462649,0.00024907128,0.0004805807,0.000093916475],"domain_scores_gemma":[0.99537426,0.0031484563,0.00020055765,0.00035140972,0.00086615,0.00005911496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040778574,0.0014344485,0.0018772485,0.0015754919,0.00082097814,0.0020762703,0.0017126488,0.0015030683,0.0032746799],"category_scores_gemma":[0.012349924,0.00089995435,0.001722946,0.001900958,0.001314128,0.0020670737,0.003098589,0.0025595387,0.0011794369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013341928,0.00017941254,0.0009655482,0.0003908716,0.00013258935,0.0001520404,0.0003996731,0.55255085,0.00905927,0.07551193,0.0018965055,0.35862783],"study_design_scores_gemma":[0.000013967227,0.00003811502,0.00009577163,0.0000195102,0.00001614912,0.00003630598,0.00002372061,0.98414904,0.0011602424,0.013231778,0.0012026393,0.000012697381],"about_ca_topic_score_codex":0.004546073,"about_ca_topic_score_gemma":0.0037309495,"teacher_disagreement_score":0.004546073,"about_ca_system_score_codex":0.00071119174,"about_ca_system_score_gemma":0.002999655,"threshold_uncertainty_score":0.021565974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7034912,0.0010557274,0.043144397,0.021699782,0.00033006648,0.00053321035,0.000106909276,0.00009244077,0.22954617],"genre_scores_gemma":[0.9920704,0.00018598283,0.0034147552,0.001206211,0.000051116218,0.000074673364,0.00001177301,0.000010505921,0.002974528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9795775,0.010450848,0.00086449576,0.0018014846,0.0041915006,0.0031141979],"domain_scores_gemma":[0.8980208,0.058733247,0.026559748,0.0021689634,0.010795936,0.0037213492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028404122,0.00039231,0.0005336974,0.0016704364,0.0034209318,0.00768432,0.0018986182,0.008034518,0.004982553],"category_scores_gemma":[0.06391982,0.00038423255,0.0009548817,0.0012061915,0.005168807,0.007152399,0.0029501868,0.0057235807,0.0005200139],"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.00044340963,0.002047774,0.07300813,0.00045902195,0.00017842895,0.0012801328,0.0060632117,0.036080457,0.008964427,0.82039255,0.0059550074,0.045127384],"study_design_scores_gemma":[0.0011510031,0.0049246787,0.12758136,0.0011577505,0.0004966213,0.0009084528,0.062974505,0.13513437,0.011908489,0.5396944,0.11334252,0.00072574755],"about_ca_topic_score_codex":0.009169238,"about_ca_topic_score_gemma":0.0096684955,"teacher_disagreement_score":0.028404122,"about_ca_system_score_codex":0.008584868,"about_ca_system_score_gemma":0.015273107,"threshold_uncertainty_score":0.15021712},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030771706,0.0005378582,0.96139127,0.00062858075,0.000043892283,0.00008163905,0.00020060399,0.0004504768,0.005893982],"genre_scores_gemma":[0.72494906,0.0006192854,0.2655484,0.00043626738,0.000083169325,0.0004214312,0.0006464006,0.00029642848,0.006999513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963987,0.00014758648,0.000014361401,0.00006566685,0.00006419256,0.00006818693],"domain_scores_gemma":[0.9982692,0.0012204696,0.00016264721,0.00008754934,0.0001804552,0.000079642174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094629225,0.0010348975,0.0013235209,0.00057658483,0.00049711275,0.0013183916,0.0014637469,0.0015641422,0.0045201443],"category_scores_gemma":[0.004565349,0.000604493,0.0010391086,0.0007404061,0.0007601673,0.0010825276,0.0014950729,0.0015368119,0.0006263094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031440308,0.000030850286,0.0005007477,0.000059548907,0.000015570555,0.000053858683,0.000041354786,0.98445374,0.00028575133,0.0051322696,0.0011557158,0.008239165],"study_design_scores_gemma":[0.0000035752594,0.000005404183,0.000033171666,0.0000056706094,0.0000021809774,0.0000052913692,0.000009978022,0.9975879,0.0000598505,0.0020975745,0.0001875557,0.0000018088474],"about_ca_topic_score_codex":0.015339032,"about_ca_topic_score_gemma":0.013055988,"teacher_disagreement_score":0.015339032,"about_ca_system_score_codex":0.0013420935,"about_ca_system_score_gemma":0.0019228808,"threshold_uncertainty_score":0.030499458},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037252273,0.0003656924,0.95655984,0.00011967799,0.00011042226,0.000059519556,0.00056240347,0.0036278078,0.0013423262],"genre_scores_gemma":[0.39013463,0.00021841712,0.5969451,0.00008209685,0.00012070482,0.00014677123,0.0030969868,0.0008828668,0.008372458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988663,0.00037433932,0.00009425111,0.00032487945,0.00020646144,0.00013373229],"domain_scores_gemma":[0.9966612,0.0016977114,0.00013539601,0.0005982057,0.00081186416,0.00009560712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025248842,0.0012122829,0.0012908716,0.0011989892,0.0005860986,0.001138153,0.001784936,0.0015449844,0.0063759233],"category_scores_gemma":[0.006937232,0.0007840116,0.0013697662,0.0013789803,0.00032197573,0.0019873013,0.0013334189,0.0022439333,0.0034624182],"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.0007730379,0.00025794964,0.0032809463,0.00019573458,0.00029771676,0.00015329577,0.00011962733,0.3735689,0.0080381585,0.0029317238,0.0053746635,0.60500824],"study_design_scores_gemma":[0.000007703337,0.000025333782,0.00035887983,0.0000076190677,0.000021416434,0.000012168062,0.0000072427606,0.9965198,0.0013456243,0.0011512049,0.000536704,0.0000063559482],"about_ca_topic_score_codex":0.0035232527,"about_ca_topic_score_gemma":0.0067128516,"teacher_disagreement_score":0.0063759233,"about_ca_system_score_codex":0.00035996528,"about_ca_system_score_gemma":0.0007293671,"threshold_uncertainty_score":0.021329522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0780677,0.001631456,0.91091096,0.00043637134,0.00012137134,0.000052532923,0.000055511067,0.00014615821,0.00857807],"genre_scores_gemma":[0.75781703,0.0007862641,0.22958598,0.00018066671,0.00013074224,0.000245875,0.00014507926,0.00012030431,0.010987973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954516,0.0002561738,0.000014351825,0.000047741567,0.00010988433,0.00002674657],"domain_scores_gemma":[0.9985483,0.0011179787,0.000090162444,0.00005453203,0.0001423717,0.000046608056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015788722,0.00052936823,0.0009464032,0.001013753,0.0004903046,0.0008314042,0.0013158345,0.0013713915,0.0017023878],"category_scores_gemma":[0.0036549675,0.0005268114,0.00057977805,0.0010513614,0.00083996035,0.0011658291,0.0008570371,0.0008425211,0.00021671219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006119815,0.000047085425,0.00028745068,0.000035121135,0.000037030808,0.00002861273,0.000029938397,0.96556485,0.00048238374,0.017767414,0.000575454,0.015083504],"study_design_scores_gemma":[0.000007828188,0.000015446676,0.00004783832,0.000003267977,0.000004366411,0.00000564031,0.0000042192514,0.9947351,0.000054071916,0.004932925,0.00018681669,0.0000025220313],"about_ca_topic_score_codex":0.005620745,"about_ca_topic_score_gemma":0.0052536554,"teacher_disagreement_score":0.005620745,"about_ca_system_score_codex":0.0009325418,"about_ca_system_score_gemma":0.00057998585,"threshold_uncertainty_score":0.01117605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009077621,0.0003165095,0.97899014,0.0004067832,0.00012814326,0.00014632955,0.000244429,0.0010227778,0.009667419],"genre_scores_gemma":[0.08561472,0.00027329812,0.89950556,0.0003177645,0.000073467454,0.00040279562,0.00060242333,0.0002847738,0.012925188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999413,0.0001663736,0.000022819751,0.00012083177,0.00018256245,0.0000943546],"domain_scores_gemma":[0.99923134,0.00043542226,0.000042421096,0.000054526306,0.00017847093,0.000057848603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010522673,0.001015063,0.0017828142,0.0010251416,0.0007671041,0.0011594025,0.002050127,0.0023196628,0.012629052],"category_scores_gemma":[0.002272898,0.0009805061,0.0008154254,0.002055254,0.00065105443,0.0012012635,0.0014858482,0.0020304546,0.0028180869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003888906,0.00032683474,0.00060918357,0.00019506464,0.0000808446,0.00008867204,0.00010686732,0.69574076,0.0036271915,0.023211569,0.021700747,0.25392342],"study_design_scores_gemma":[0.00009324921,0.000071158924,0.00013018092,0.000016884567,0.000010806492,0.000025394693,0.00001942553,0.99170566,0.0006136476,0.0046161516,0.0026869967,0.0000104821065],"about_ca_topic_score_codex":0.009753138,"about_ca_topic_score_gemma":0.010771034,"teacher_disagreement_score":0.012629052,"about_ca_system_score_codex":0.0012303465,"about_ca_system_score_gemma":0.0025973418,"threshold_uncertainty_score":0.042248428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22425385,0.00083086186,0.7719176,0.000176755,0.00015980839,0.00023569725,0.00012710974,0.0013554997,0.0009428746],"genre_scores_gemma":[0.9469185,0.00015872227,0.0516731,0.00005050732,0.00006080446,0.00010018576,0.000095263735,0.000046846806,0.00089603453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947876,0.00016697778,0.000041856023,0.00010764499,0.00015427082,0.000050536753],"domain_scores_gemma":[0.9976277,0.0016142811,0.00017376812,0.00016235322,0.00031527062,0.00010667152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016213568,0.00055387116,0.001221275,0.00046476093,0.0004369669,0.0006517174,0.0010267827,0.00057206,0.0013333516],"category_scores_gemma":[0.0025708864,0.00042626355,0.00051451405,0.0005330139,0.0005331905,0.0008624714,0.0006008418,0.00055152265,0.00014975927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006725532,0.0006905128,0.0033176998,0.00060032,0.00013759,0.0003029068,0.0002390036,0.5174093,0.10945354,0.0058945008,0.0019908857,0.35323817],"study_design_scores_gemma":[0.000056063906,0.0003619351,0.0007490399,0.000006694136,0.000020328642,0.000026971093,0.000010228933,0.98779976,0.009571635,0.0011554203,0.00022713421,0.000014745475],"about_ca_topic_score_codex":0.0017148922,"about_ca_topic_score_gemma":0.0014703395,"teacher_disagreement_score":0.0017148922,"about_ca_system_score_codex":0.0005861614,"about_ca_system_score_gemma":0.0007181512,"threshold_uncertainty_score":0.008574605},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06295289,0.0009183363,0.9257965,0.0010083381,0.00011514482,0.00012512937,0.00010674015,0.00025741814,0.008719483],"genre_scores_gemma":[0.92912346,0.00035902203,0.064979315,0.00020997725,0.000105983396,0.00022679262,0.000110928646,0.000055305205,0.0048293015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990017,0.00046133526,0.000043277912,0.0001734051,0.00015584618,0.00016445479],"domain_scores_gemma":[0.9917549,0.0069625475,0.00040229014,0.00012390895,0.00043984325,0.00031657674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003165425,0.0013459489,0.002438929,0.0008158435,0.00041237727,0.0017024032,0.0020078917,0.0034235874,0.0050344365],"category_scores_gemma":[0.010083459,0.0009959694,0.0007183761,0.00076366187,0.0014747931,0.0016694766,0.0014784384,0.0024508808,0.00036994426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006250474,0.00005117929,0.0002064966,0.00002936259,0.000022983922,0.000031330597,0.000013539503,0.99017906,0.00008962479,0.003240057,0.00027128714,0.005802527],"study_design_scores_gemma":[0.000013875128,0.000013703974,0.000025218978,0.0000035567698,0.00000399516,0.0000028715392,0.0000019275826,0.9986665,0.000021465394,0.0012102933,0.000034870325,0.0000018530205],"about_ca_topic_score_codex":0.009478574,"about_ca_topic_score_gemma":0.0058323885,"teacher_disagreement_score":0.009478574,"about_ca_system_score_codex":0.0015517791,"about_ca_system_score_gemma":0.0018225106,"threshold_uncertainty_score":0.01884681},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121738635,0.0017006154,0.8573455,0.0050801556,0.0001402114,0.00016428714,0.0005174578,0.00022428275,0.013088799],"genre_scores_gemma":[0.90311176,0.0029352363,0.08221266,0.0007331369,0.00028157432,0.000327239,0.00049027696,0.00021222567,0.009695878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953862,0.002643558,0.00023081238,0.00073567306,0.00037140216,0.0006323819],"domain_scores_gemma":[0.8970472,0.09213126,0.0042101084,0.0020466154,0.002502768,0.0020620632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0151550695,0.0014399093,0.0040387604,0.001656395,0.001241069,0.005394751,0.0036920705,0.0036480213,0.008291783],"category_scores_gemma":[0.09205625,0.0022129177,0.0023372464,0.001618055,0.004845826,0.013087749,0.0028976996,0.0077548954,0.000605192],"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.0003331675,0.000137005,0.001525702,0.00022962847,0.000105876934,0.0001728635,0.00031643125,0.19616617,0.00069542386,0.78847677,0.0016420285,0.010198909],"study_design_scores_gemma":[0.000063075495,0.000044489076,0.00043142444,0.000065646964,0.000043102697,0.000060366412,0.00005831405,0.5289915,0.00026428243,0.46939427,0.0005433239,0.00004014679],"about_ca_topic_score_codex":0.008890183,"about_ca_topic_score_gemma":0.005866067,"teacher_disagreement_score":0.0151550695,"about_ca_system_score_codex":0.0049858973,"about_ca_system_score_gemma":0.0049417447,"threshold_uncertainty_score":0.08014858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32997793,0.0010463021,0.6319707,0.0015704326,0.00009629822,0.00078264717,0.00016240419,0.00038681834,0.034006465],"genre_scores_gemma":[0.97143954,0.00033405924,0.02184639,0.00010875227,0.00004452428,0.00011686179,0.000035390367,0.000030017487,0.0060445247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971379,0.0014430807,0.000109185865,0.00048448535,0.00054002105,0.00028522534],"domain_scores_gemma":[0.9938299,0.003701989,0.0010245333,0.00043574357,0.00066867616,0.00033917397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002662396,0.0012526482,0.0012100097,0.00086376007,0.0006457489,0.003518821,0.0023938934,0.0022291297,0.0031743934],"category_scores_gemma":[0.011898018,0.00092654896,0.00111602,0.0005877807,0.0011875203,0.0058961115,0.0013944568,0.0015448285,0.00070298463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006966464,0.0009334124,0.016143553,0.00038621202,0.00028117132,0.0018547374,0.0011039885,0.64853,0.0128561845,0.17525153,0.0029393346,0.13902321],"study_design_scores_gemma":[0.00006196815,0.00039732587,0.0026902342,0.00003511758,0.000108246844,0.0003972069,0.00025979377,0.95056146,0.0013547661,0.04161912,0.0024346926,0.00008013648],"about_ca_topic_score_codex":0.0037453992,"about_ca_topic_score_gemma":0.0033930822,"teacher_disagreement_score":0.0037453992,"about_ca_system_score_codex":0.0019596852,"about_ca_system_score_gemma":0.0012159876,"threshold_uncertainty_score":0.014218569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17984785,0.0017561438,0.8126979,0.00060100417,0.0002986284,0.000063671956,0.0006744981,0.0014934427,0.0025669038],"genre_scores_gemma":[0.9315486,0.000619256,0.063147694,0.00017611048,0.00015354682,0.00009311966,0.001117849,0.00005280005,0.0030910638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996959,0.00007512882,0.000020924286,0.00008301192,0.00006177894,0.000063242485],"domain_scores_gemma":[0.9994578,0.00023964996,0.000031112824,0.00004034917,0.00018983346,0.00004129019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011360688,0.00077909546,0.0013419624,0.00078996766,0.000525173,0.0008350931,0.0014393096,0.0009212761,0.0013947005],"category_scores_gemma":[0.0014826215,0.000416792,0.001061842,0.0007388445,0.00017818548,0.0015060216,0.00079525117,0.0011444412,0.00037727805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021956839,0.00021151196,0.0054676794,0.0000361962,0.00029241893,0.00010431482,0.000036465863,0.86946195,0.0017726164,0.0011494954,0.0024466314,0.11880126],"study_design_scores_gemma":[0.0000015068556,0.000008386694,0.00020084674,0.0000014293123,0.000012537417,0.0000037119923,0.0000016525015,0.9994497,0.000075336284,0.0002080909,0.00003475244,0.000002199824],"about_ca_topic_score_codex":0.018557448,"about_ca_topic_score_gemma":0.018288285,"teacher_disagreement_score":0.018557448,"about_ca_system_score_codex":0.00051312,"about_ca_system_score_gemma":0.0008046604,"threshold_uncertainty_score":0.03689891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07832021,0.0009486749,0.9104376,0.0017916356,0.00016995896,0.0001419512,0.0013592835,0.00048179776,0.0063489564],"genre_scores_gemma":[0.8684619,0.0011056446,0.11627622,0.00030715193,0.00019078056,0.00029027485,0.0016783158,0.00020746532,0.011482301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987589,0.00048901344,0.000049092665,0.00036520656,0.00017664793,0.0001611937],"domain_scores_gemma":[0.99612445,0.0023646434,0.00043654055,0.00029061432,0.00044880924,0.0003348704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017524451,0.0010509223,0.0020258403,0.0022396967,0.0014578389,0.0025511612,0.004531922,0.0026546184,0.0054215],"category_scores_gemma":[0.006557735,0.00076616096,0.0015330687,0.0030371377,0.001574562,0.004657784,0.002099782,0.0020506168,0.00066078495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090363676,0.00004870052,0.0011593087,0.00009475606,0.000100960264,0.00016860002,0.00016862171,0.899238,0.00041729622,0.088874176,0.002431106,0.0072080945],"study_design_scores_gemma":[0.000005878437,0.0000059943677,0.00010713326,0.0000040843197,0.000011755659,0.00001337525,0.00002697166,0.97814435,0.00002554507,0.021388633,0.00026039055,0.0000058122573],"about_ca_topic_score_codex":0.021961462,"about_ca_topic_score_gemma":0.017855635,"teacher_disagreement_score":0.021961462,"about_ca_system_score_codex":0.0024631792,"about_ca_system_score_gemma":0.0015756149,"threshold_uncertainty_score":0.043667257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51388603,0.00038163346,0.42424232,0.002010375,0.00017675472,0.00055660016,0.00054757524,0.0005221096,0.057676524],"genre_scores_gemma":[0.9848049,0.00008087351,0.008345712,0.000106788066,0.000043893077,0.00009543726,0.00005228807,0.000021896105,0.0064482265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971481,0.0011276845,0.0001050666,0.00056460197,0.0005151565,0.0005393115],"domain_scores_gemma":[0.9930791,0.0034307702,0.0014412502,0.0009570702,0.0004807653,0.00061109016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029953853,0.00077226106,0.0013280767,0.00050141534,0.0006421535,0.0021405576,0.0018851623,0.0015745949,0.012665646],"category_scores_gemma":[0.011885182,0.0006380277,0.0012239115,0.000505339,0.0023357447,0.0032398568,0.0014449973,0.0023258107,0.00089572533],"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.0010574344,0.00060883036,0.0071647842,0.0003525008,0.0001697652,0.0008881658,0.0003875971,0.26940048,0.0073987823,0.6660559,0.0060342858,0.04048141],"study_design_scores_gemma":[0.00025133174,0.0004990898,0.0036181898,0.000046180823,0.00008900899,0.000408418,0.00018308888,0.76818717,0.0014312457,0.22094865,0.0042347726,0.000102796155],"about_ca_topic_score_codex":0.0026502234,"about_ca_topic_score_gemma":0.0019883239,"teacher_disagreement_score":0.012665646,"about_ca_system_score_codex":0.0017314696,"about_ca_system_score_gemma":0.0015044515,"threshold_uncertainty_score":0.042370856},"labels":[],"label_agreement":null}]}