{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":518,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":518,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"bfe3ee414a5f","filters":{"venue":"European Journal of Operational Research"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Operations research; Computer science; Class (philosophy); Management science; Economics; Mathematics; Artificial intelligence","authors":[{"name":"S.K. Goyal","is_ca":true},{"name":"Bibhas C. Giri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1881618412603019,"gpt":0.352647981333951,"spread":0.1644861400736492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00192149,0.00107756,0.001343873,0.0009957729,0.0003464459,0.002349064,0.003668833,0.001875952,0.003048052],"category_scores_gemma":[0.008864759,0.0008144085,0.0009671117,0.002919722,0.0008976989,0.003384086,0.001005221,0.00212131,0.0007799526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001604962,"about_ca_system_score_gemma":0.001020245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01013055,"about_ca_topic_score_gemma":0.006605583,"domain_scores_codex":[0.9992167,0.0003198084,0.00005797196,0.0001357205,0.0002096525,0.00006016729],"domain_scores_gemma":[0.9963038,0.002158324,0.0003242451,0.0002881608,0.0007338681,0.0001916104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006708822,0.00005748219,0.003313936,0.0002852758,0.00004450665,0.00005599238,0.00007253275,0.9323059,0.0004728421,0.02297058,0.002328621,0.03802532],"study_design_scores_gemma":[0.00000428141,0.00001196226,0.0002345872,0.00002282153,0.00001188018,0.00002372817,0.00001781959,0.9883477,0.0001713091,0.005947135,0.005199169,0.000007715569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.09073818,0.05333001,0.8233829,0.006057473,0.0008504832,0.00006496329,0.0009278007,0.001060295,0.02358791],"genre_scores_gemma":[0.6940849,0.07842223,0.2112013,0.001129954,0.00196304,0.0001526562,0.001643318,0.000665213,0.01073742],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.01013055,"threshold_uncertainty_score":0.02014315,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Emrah Demir","is_ca":false},{"name":"Tolga Bektaş","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2809694111096483,"gpt":0.4583880352755617,"spread":0.1774186241659133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156379,0.001321058,0.001735485,0.005998771,0.0004269598,0.001753352,0.00113892,0.00145531,0.005366675],"category_scores_gemma":[0.0020117,0.0005075224,0.0008908835,0.009379076,0.000609913,0.002812937,0.0009788438,0.001257524,0.001327742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008968684,"about_ca_system_score_gemma":0.002773257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002683111,"about_ca_topic_score_gemma":0.006162234,"domain_scores_codex":[0.9994923,0.00007671532,0.00009497248,0.000105695,0.0001850166,0.00004528142],"domain_scores_gemma":[0.998394,0.0008607074,0.0002522702,0.00003327733,0.0003977258,0.00006194428],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008922174,0.0001163628,0.0005385164,0.07510833,0.0001756864,0.0001720024,0.000146109,0.0007591808,0.001511767,0.004816981,0.03005559,0.8865103],"study_design_scores_gemma":[0.00001104699,0.0001326523,0.001823508,0.01714453,0.0003596037,0.000491646,0.0002675742,0.0001476707,0.0005397338,0.002268158,0.9767722,0.00004166627],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0001700347,0.9983507,0.0001349177,0.0002487487,0.0002130477,0.000004367124,0.00003684134,0.000004246558,0.0008369556],"genre_scores_gemma":[0.0006979461,0.9986131,0.0001516104,0.0001316999,0.0001394431,0.000002900488,0.00003085138,9.991206e-7,0.0002313984],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.005998771,"threshold_uncertainty_score":0.01795334,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Haldun Aytuğ","is_ca":false},{"name":"Mark Lawley","is_ca":false},{"name":"Kenneth N. McKay","is_ca":true},{"name":"S. Mohan","is_ca":false},{"name":"Reha Uzsoy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09072389035271536,"gpt":0.3721100444108805,"spread":0.2813861540581651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002689952,0.001569033,0.003120237,0.001422948,0.0003169354,0.001857364,0.003263416,0.001393842,0.001946406],"category_scores_gemma":[0.005003673,0.0008271651,0.0009760881,0.004372417,0.0004686022,0.002851693,0.0006943055,0.0008845903,0.001632564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006056383,"about_ca_system_score_gemma":0.002137439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002691658,"about_ca_topic_score_gemma":0.002554046,"domain_scores_codex":[0.998867,0.0002133728,0.0001490813,0.0002326582,0.0004668511,0.00007101437],"domain_scores_gemma":[0.9967361,0.001941691,0.0003989408,0.0001761263,0.0006855953,0.00006144402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001265431,0.0001149365,0.0005049134,0.007752009,0.0001433938,0.0001226445,0.00005877026,0.03872589,0.002574176,0.004736467,0.004385877,0.9407544],"study_design_scores_gemma":[0.0003201226,0.001684978,0.00320841,0.007171081,0.0009001149,0.00299598,0.0005971355,0.1540639,0.02003781,0.05134459,0.7573865,0.0002894418],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.004383896,0.8596275,0.1306061,0.0006440697,0.000562795,0.00008207488,0.0001190773,0.0004578643,0.00351662],"genre_scores_gemma":[0.01848115,0.8893847,0.08910875,0.0002241207,0.0007420481,0.00008397051,0.0002827272,0.000105494,0.001587004],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003263416,"threshold_uncertainty_score":0.01422602,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yao Chen","is_ca":false},{"name":"Wade D. Cook","is_ca":true},{"name":"Ning Li","is_ca":false},{"name":"Joe Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2300218538597624,"gpt":0.5026539069179089,"spread":0.2726320530581465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008856982,0.001727261,0.002657036,0.00123203,0.0005292393,0.003264512,0.001826054,0.001298628,0.003352653],"category_scores_gemma":[0.01192776,0.001091759,0.002524666,0.001774285,0.0008975155,0.00227166,0.001723095,0.002215054,0.0005691899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001132566,"about_ca_system_score_gemma":0.001856097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002612803,"about_ca_topic_score_gemma":0.002909058,"domain_scores_codex":[0.9941509,0.003542511,0.0003195842,0.0004819201,0.001086856,0.0004181296],"domain_scores_gemma":[0.9916844,0.006285316,0.0002822428,0.0005924089,0.001039452,0.000116177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00014595,0.0001568606,0.000518473,0.0002438243,0.0002629828,0.00008647557,0.0001023683,0.8492067,0.001813922,0.08548076,0.0006537546,0.06132792],"study_design_scores_gemma":[0.00001655442,0.00005153775,0.0002450213,0.00001853716,0.00004951485,0.00001933237,0.00001371161,0.9720896,0.000826993,0.02592831,0.0007255547,0.00001520196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005124043,0.0001437062,0.9934772,0.00003493681,0.00001515885,0.00002760394,0.00003262875,0.00003192593,0.00111283],"genre_scores_gemma":[0.3483987,0.0006208992,0.6440487,0.00008210448,0.0000722822,0.0004969015,0.0003654183,0.0001294154,0.005785643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008856982,"threshold_uncertainty_score":0.04684079,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Emrah Demir","is_ca":false},{"name":"Tolga Bektaş","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05395561392824383,"gpt":0.3389584209137308,"spread":0.285002806985487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002420792,0.002405648,0.002477805,0.001791399,0.0007872169,0.002849477,0.003178787,0.004031653,0.006984025],"category_scores_gemma":[0.005601871,0.001199315,0.001398995,0.003383814,0.001244307,0.002678829,0.00319794,0.002138967,0.0007963873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001393581,"about_ca_system_score_gemma":0.001491334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005830547,"about_ca_topic_score_gemma":0.004017903,"domain_scores_codex":[0.9981685,0.0007624555,0.00006950404,0.0003578064,0.0004095543,0.0002322332],"domain_scores_gemma":[0.9986581,0.0007399572,0.0001690614,0.00008055095,0.0001875661,0.0001647003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001415132,0.0001276169,0.0007990171,0.0003277379,0.0001976243,0.000258419,0.00004820657,0.939626,0.0008330254,0.03295912,0.003271437,0.02141039],"study_design_scores_gemma":[0.00003743989,0.0000614118,0.0003247724,0.00002406453,0.00004262643,0.0001037606,0.00003596187,0.9708263,0.0002617823,0.02613928,0.002125346,0.00001723691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05013501,0.001895422,0.9198974,0.002020563,0.0003503021,0.0001884931,0.001474586,0.000251848,0.02378626],"genre_scores_gemma":[0.6640889,0.002712347,0.2841935,0.0007964784,0.0003761773,0.0006376082,0.002470524,0.0004013222,0.04432303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006984025,"threshold_uncertainty_score":0.02336389,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jean‐François Bérubé","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04206008863009993,"gpt":0.3738648753142147,"spread":0.3318047866841148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002498216,0.001429116,0.001607025,0.00112514,0.0007269044,0.00173239,0.002371296,0.001733195,0.01277348],"category_scores_gemma":[0.00884157,0.000889109,0.001107194,0.002972861,0.0007759946,0.002111061,0.001945668,0.002659932,0.001359859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001210297,"about_ca_system_score_gemma":0.002945293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01435725,"about_ca_topic_score_gemma":0.01297794,"domain_scores_codex":[0.9990018,0.0003052712,0.00004569917,0.0001101817,0.0004429368,0.00009409199],"domain_scores_gemma":[0.9966415,0.002164544,0.0001444886,0.0002427477,0.0006888226,0.0001179092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005764779,0.0001049845,0.0001805803,0.0001467184,0.00003864543,0.0001001316,0.00004323487,0.8668613,0.0006560219,0.02926165,0.004168845,0.09838021],"study_design_scores_gemma":[0.00001227003,0.00001088652,0.00002322567,0.00000776283,0.000004349203,0.00001372532,0.0000055614,0.9932218,0.0001113591,0.005817772,0.0007666122,0.000004720997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002274459,0.0001928415,0.9927012,0.0001454015,0.00008042557,0.00008175117,0.00008088601,0.0002240746,0.004218854],"genre_scores_gemma":[0.08274314,0.0003698262,0.9106433,0.0002105441,0.00009494962,0.0003224225,0.0002423971,0.00035586,0.005017666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01435725,"threshold_uncertainty_score":0.04273158,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gianpaolo Ghiani","is_ca":false},{"name":"Francesca Guerriero","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Roberto Musmanno","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06723250682678367,"gpt":0.3664937950685185,"spread":0.2992612882417349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001152663,0.00127267,0.0009910634,0.0007300333,0.0004562833,0.002255522,0.00203316,0.001260512,0.002978391],"category_scores_gemma":[0.00256635,0.0006201495,0.0006349612,0.002077117,0.001198607,0.002961275,0.0008503335,0.001742818,0.0007712969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001132238,"about_ca_system_score_gemma":0.0009728298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00228749,"about_ca_topic_score_gemma":0.002134189,"domain_scores_codex":[0.9995027,0.0001733819,0.00002404743,0.0001016265,0.0001511651,0.00004705205],"domain_scores_gemma":[0.9994654,0.0002637976,0.00006433149,0.00007034973,0.0001083509,0.00002778932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008676443,0.00007247207,0.0001797079,0.0002652623,0.00004172522,0.00004443572,0.00007751678,0.6362897,0.002135038,0.2363766,0.005538374,0.1188925],"study_design_scores_gemma":[0.00001523792,0.00001721805,0.00004151029,0.00001373466,0.000009864872,0.00003387509,0.00001749931,0.8948182,0.0005795049,0.1006011,0.003844366,0.00000783382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00269512,0.002241594,0.9915507,0.0004664412,0.0001044712,0.0000163522,0.00002312279,0.0001309557,0.002771316],"genre_scores_gemma":[0.2404726,0.00939317,0.7371466,0.0002968661,0.0006543234,0.0002336223,0.0001727692,0.0003271434,0.01130302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002978391,"threshold_uncertainty_score":0.009963691,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wade D. Cook","is_ca":true},{"name":"Joe Zhu","is_ca":false},{"name":"Gongbing Bi","is_ca":false},{"name":"Feng Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1442268597334244,"gpt":0.4682453511546586,"spread":0.3240184914212342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004432111,0.001546355,0.001333419,0.002019499,0.0004796252,0.002412351,0.001305569,0.0008491219,0.007646102],"category_scores_gemma":[0.01249563,0.0004936452,0.001382038,0.002787008,0.0007294383,0.002488,0.001526948,0.00187556,0.001206347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001384447,"about_ca_system_score_gemma":0.001364209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001688099,"about_ca_topic_score_gemma":0.00173823,"domain_scores_codex":[0.9974681,0.001373963,0.0001030499,0.0003166487,0.0005638395,0.000174327],"domain_scores_gemma":[0.9953415,0.003027366,0.0002628241,0.0005784864,0.0006890509,0.0001008041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009472919,0.0001304457,0.0005509964,0.0001675204,0.0001316347,0.00004306491,0.00006820433,0.4511439,0.00133173,0.4125405,0.003748746,0.1300485],"study_design_scores_gemma":[0.00001212131,0.00003042513,0.000244942,0.00002913957,0.00004285683,0.0000364779,0.0000173588,0.8088687,0.0009000586,0.1851007,0.004705583,0.00001171387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002908058,0.000116481,0.9925305,0.00006180489,0.00002761435,0.00003238361,0.0001410526,0.0000616279,0.004120479],"genre_scores_gemma":[0.252845,0.0008438129,0.7336642,0.0001487296,0.0001684945,0.0006501816,0.0008482262,0.0003127425,0.01051866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007646102,"threshold_uncertainty_score":0.0255788,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Bissan Ghaddar","is_ca":true},{"name":"Joe Naoum‐Sawaya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1663939795343459,"gpt":0.419157855783111,"spread":0.2527638762487652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002055928,0.0009878018,0.00197059,0.001588276,0.0006079655,0.001694996,0.001017577,0.0008694271,0.001545851],"category_scores_gemma":[0.006068901,0.000378515,0.001351564,0.002215904,0.0004106692,0.000996097,0.001000061,0.00155312,0.0008774838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000385556,"about_ca_system_score_gemma":0.0008474047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001984419,"about_ca_topic_score_gemma":0.001214832,"domain_scores_codex":[0.9983757,0.000409257,0.0002392928,0.0003257564,0.0004719881,0.0001779189],"domain_scores_gemma":[0.9976291,0.001463502,0.0001318974,0.0002164189,0.0004922058,0.00006692272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004845104,0.0003820201,0.003168726,0.0001858675,0.0001489553,0.0002319706,0.0001217206,0.06664678,0.01312678,0.001792119,0.004220436,0.90949],"study_design_scores_gemma":[0.00002789967,0.0001355412,0.00172061,0.00001470188,0.00003634662,0.0001038553,0.00006211396,0.9876072,0.005692884,0.003630239,0.0009483383,0.00002022718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05966457,0.0006229279,0.935925,0.0003282488,0.00013573,0.0001865414,0.0004026274,0.002148289,0.0005860858],"genre_scores_gemma":[0.5725841,0.0004020119,0.4228747,0.0001069926,0.0001843228,0.0005388892,0.001549163,0.00009620753,0.001663637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002055928,"threshold_uncertainty_score":0.0108729,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Data envelopment analysis; Efficiency; Econometrics; Statistics; Multivariate statistics; Computer science; Variables; Mathematics","authors":[{"name":"Larry Jenkins","is_ca":true},{"name":"Murray Anderson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3616397145239165,"gpt":0.5072767616607607,"spread":0.1456370471368443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009094912,0.001435574,0.002416208,0.002614834,0.001270737,0.001821446,0.001893435,0.0009635712,0.002985334],"category_scores_gemma":[0.03765511,0.0009835318,0.002851793,0.005176704,0.001749327,0.003127074,0.003154591,0.004296262,0.0004881556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001133857,"about_ca_system_score_gemma":0.003643824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003389893,"about_ca_topic_score_gemma":0.00448198,"domain_scores_codex":[0.991448,0.004843442,0.0005415097,0.000467257,0.002416004,0.0002837409],"domain_scores_gemma":[0.9771701,0.01636687,0.001150575,0.002735557,0.002307603,0.0002694165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000226243,0.0002830068,0.001623563,0.0003664841,0.0003542857,0.00009968235,0.000191705,0.3033845,0.006878286,0.2993822,0.002731593,0.3844784],"study_design_scores_gemma":[0.000031583,0.0001107704,0.001265665,0.00004868272,0.00009842689,0.00006398014,0.000044543,0.8304985,0.003787659,0.1590288,0.004951179,0.00007029464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001976267,0.0001012575,0.9974687,0.00009287397,0.00002172231,0.00001696281,0.00002825433,0.00005470192,0.00023921],"genre_scores_gemma":[0.06419094,0.0004418551,0.9336475,0.00008145832,0.0001375773,0.0002693967,0.0001512093,0.0001346017,0.0009454257],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009094912,"threshold_uncertainty_score":0.04809904,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Joint (building); Computer science; Quality (philosophy); Mathematical optimization; Operations research; Mathematical economics; Economics; Mathematics; Engineering","authors":[{"name":"Moutaz Khouja","is_ca":false},{"name":"Suresh Kumar Goyal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2120009324741855,"gpt":0.3912949006372418,"spread":0.1792939681630563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001490663,0.0008458755,0.001248847,0.004373229,0.0004219876,0.001821253,0.001347029,0.00149907,0.003341798],"category_scores_gemma":[0.005952799,0.0006951324,0.0006414292,0.01180207,0.0008701825,0.002981245,0.0008583001,0.001137422,0.0009637865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002354844,"about_ca_system_score_gemma":0.005533359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006885053,"about_ca_topic_score_gemma":0.01389486,"domain_scores_codex":[0.9991236,0.000142355,0.00018102,0.0001583442,0.000345234,0.00004933968],"domain_scores_gemma":[0.9956787,0.002311306,0.0006440713,0.0000891231,0.001178143,0.00009861999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008881213,0.00008191446,0.0008649123,0.02182843,0.00009755657,0.0001932678,0.00009594798,0.002130475,0.0002935957,0.008736163,0.04044476,0.9251442],"study_design_scores_gemma":[0.00002112991,0.00009154427,0.003971475,0.01577129,0.0002526748,0.001255032,0.0002363297,0.0007247223,0.0004464999,0.005653024,0.9715368,0.00003952672],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0003280648,0.9971256,0.0005011072,0.0005306322,0.0001415032,0.000005929823,0.00004326879,0.000004654366,0.001319271],"genre_scores_gemma":[0.002061884,0.9966079,0.0005543284,0.0001973893,0.0001823604,0.000006345814,0.00006305603,0.000001855175,0.0003249775],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006885053,"threshold_uncertainty_score":0.01708567,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Imran Maqsood","is_ca":true},{"name":"Guohe Huang","is_ca":true},{"name":"Julian Scott Yeomans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05360354090258693,"gpt":0.3331294540138367,"spread":0.2795259131112497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738169,0.0008804271,0.001584888,0.0005154666,0.0005095386,0.001342703,0.001455482,0.002562485,0.003655615],"category_scores_gemma":[0.002561499,0.0005455163,0.0007265814,0.0006206831,0.0009111766,0.000932808,0.001176892,0.001206251,0.0001594085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00181711,"about_ca_system_score_gemma":0.002396693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01141888,"about_ca_topic_score_gemma":0.008098065,"domain_scores_codex":[0.9993997,0.0002207231,0.00002301832,0.0001139221,0.0001126508,0.0001300411],"domain_scores_gemma":[0.999042,0.0006266131,0.00008200818,0.00002521434,0.0001404834,0.00008362572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006211951,0.00003453995,0.0001292663,0.00002249245,0.00001197115,0.00003874098,0.00002216184,0.9921249,0.0004403236,0.004121895,0.0001259497,0.002865616],"study_design_scores_gemma":[0.0000128948,0.0000325521,0.00003811872,0.000002275638,0.000005779189,0.000003005541,0.000003842295,0.9987912,0.0001064754,0.0009371903,0.00006373288,0.00000293706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1896365,0.0001809347,0.7984065,0.0005846329,0.000056642,0.0002166288,0.0002404689,0.0002556407,0.01042192],"genre_scores_gemma":[0.9531546,0.00008842484,0.04306694,0.00004699967,0.00001370335,0.0001847271,0.00009302066,0.00002357248,0.00332791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01141888,"threshold_uncertainty_score":0.02270484,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nabila Azi","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06359111993787328,"gpt":0.3323522610403489,"spread":0.2687611411024756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487884,0.001258173,0.002036127,0.00103484,0.0009845992,0.001666775,0.002606223,0.002307818,0.007029866],"category_scores_gemma":[0.004315475,0.001147106,0.001221938,0.001800454,0.0009736504,0.002542959,0.001932048,0.001597118,0.0008752876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001955867,"about_ca_system_score_gemma":0.004140304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01419672,"about_ca_topic_score_gemma":0.01386775,"domain_scores_codex":[0.9991114,0.000167688,0.00004631195,0.0002125901,0.0002832191,0.0001787585],"domain_scores_gemma":[0.9985691,0.000911638,0.00009627333,0.0001431073,0.0002047463,0.00007501143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001563863,0.0001157026,0.0002842391,0.0001227311,0.00004515421,0.00007079786,0.00007073577,0.8553041,0.001014554,0.01712256,0.002945725,0.1227473],"study_design_scores_gemma":[0.00005834566,0.00002738369,0.00006027841,0.000007411865,0.00001217564,0.00002494432,0.00001474179,0.9895362,0.0001779637,0.009289299,0.0007844,0.000006894368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009460258,0.0002856512,0.9856397,0.0001988297,0.0001207305,0.0001080652,0.0001019637,0.0005628989,0.003521799],"genre_scores_gemma":[0.1395732,0.0003111245,0.8550409,0.000143575,0.00009920709,0.0003588284,0.0002407567,0.0001525176,0.004079866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01419672,"threshold_uncertainty_score":0.02822816,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Philippe Grangier","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Fabien Lehuédé","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0590928165349166,"gpt":0.340670755225449,"spread":0.2815779386905324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001270712,0.0006153531,0.001586115,0.0007224252,0.0004777396,0.0008293975,0.001830282,0.001663534,0.002531434],"category_scores_gemma":[0.004022388,0.0005950771,0.0006216469,0.000804402,0.0007424799,0.00138904,0.00149802,0.0009332791,0.00021199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008120207,"about_ca_system_score_gemma":0.001187538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008650142,"about_ca_topic_score_gemma":0.006238843,"domain_scores_codex":[0.9996347,0.000179651,0.00001333913,0.00007105825,0.00006215325,0.00003895683],"domain_scores_gemma":[0.9984167,0.001204434,0.0001253429,0.00004367632,0.0001250717,0.00008477541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007383151,0.0000328002,0.00022999,0.00003670752,0.00002226797,0.00003157435,0.00002343311,0.9837168,0.0002465935,0.005921503,0.0007885314,0.008875942],"study_design_scores_gemma":[0.000008346438,0.0000125384,0.00002111799,0.000001753705,0.000001853495,0.000002897996,0.000004361815,0.9990014,0.00001861384,0.0008315084,0.00009424696,0.000001352883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04585023,0.0006483452,0.9476935,0.0005380745,0.0001193924,0.00009318136,0.00009830478,0.0001235402,0.004835544],"genre_scores_gemma":[0.7330157,0.000500758,0.2581994,0.0001907303,0.0001108746,0.0003763909,0.000275901,0.0001000386,0.007230172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008650142,"threshold_uncertainty_score":0.01719964,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Suresh Kumar Goyal","is_ca":true},{"name":"Fassil Nebebe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.115056820812557,"gpt":0.3257794824584556,"spread":0.2107226616458986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008359932,0.0008743273,0.002385431,0.002234894,0.001641473,0.004610962,0.001866956,0.002629636,0.006435443],"category_scores_gemma":[0.01462176,0.001819371,0.001268871,0.001296724,0.002047924,0.003821386,0.001642871,0.002432636,0.0006822532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005076495,"about_ca_system_score_gemma":0.006743016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005252684,"about_ca_topic_score_gemma":0.003492133,"domain_scores_codex":[0.9971099,0.001302587,0.0001133064,0.0005059761,0.0003338506,0.0006343249],"domain_scores_gemma":[0.9869937,0.009871657,0.0008253539,0.0004656946,0.001222956,0.0006207387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009483639,0.0002597018,0.003174155,0.000163264,0.00009733313,0.0004117942,0.0001308371,0.9009678,0.004278921,0.07446492,0.001531409,0.01357153],"study_design_scores_gemma":[0.0001345598,0.0002346606,0.002128328,0.00003056222,0.00005328209,0.00008820376,0.0001511821,0.9712266,0.002541829,0.0224043,0.0009630907,0.00004348554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7801834,0.0004168359,0.1864807,0.00157914,0.00008354003,0.0009848342,0.000503931,0.0002964924,0.02947109],"genre_scores_gemma":[0.9762278,0.0001318265,0.02119835,0.0000608103,0.00003700736,0.0001122752,0.0001046951,0.00003125178,0.00209591],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008359932,"threshold_uncertainty_score":0.0442121,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Junsong Bian","is_ca":false},{"name":"Guoqing Zhang","is_ca":true},{"name":"Guanghui Zhou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04526066025482519,"gpt":0.2637256614478679,"spread":0.2184650011930427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002957941,0.0002467659,0.000801901,0.0007716608,0.0005627954,0.003003348,0.0008577016,0.003139229,0.02389867],"category_scores_gemma":[0.01175736,0.0002564095,0.0009102707,0.0005937715,0.001636523,0.002330599,0.000974605,0.002225907,0.0007253319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002297059,"about_ca_system_score_gemma":0.002446298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007510389,"about_ca_topic_score_gemma":0.01084141,"domain_scores_codex":[0.9979364,0.0004814752,0.00008885584,0.0003035835,0.0003499997,0.0008397701],"domain_scores_gemma":[0.9809057,0.01269248,0.003445528,0.0005666743,0.0009069626,0.001482685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.02698617,0.004356684,0.5401096,0.001181641,0.001112551,0.004407331,0.001635241,0.02620693,0.008929906,0.3010726,0.01465996,0.06934144],"study_design_scores_gemma":[0.002269111,0.006864971,0.8374462,0.0003786366,0.003658297,0.001951144,0.00761231,0.03121699,0.006835749,0.07538503,0.02622977,0.0001518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9343236,0.001029593,0.001097479,0.003249105,0.0001764758,0.0000934245,0.0004340938,0.00005279909,0.05954342],"genre_scores_gemma":[0.9967248,0.00007336382,0.00006847553,0.000235092,0.00004002424,0.000008148496,0.00004878586,0.000004544565,0.00279672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02389867,"threshold_uncertainty_score":0.07994896,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nicola Bianchessi","is_ca":false},{"name":"Jean-François Cordeau","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Vincent Raymond","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1788735015970575,"gpt":0.3574932122903898,"spread":0.1786197106933323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00273459,0.001322198,0.002299937,0.002245018,0.001631493,0.002140605,0.003574549,0.003092211,0.006056732],"category_scores_gemma":[0.005393454,0.00117523,0.00129806,0.002511152,0.001428203,0.002582256,0.001875993,0.001514819,0.0005639451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002682146,"about_ca_system_score_gemma":0.003639635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01738094,"about_ca_topic_score_gemma":0.01811421,"domain_scores_codex":[0.9984481,0.0007203065,0.00006294274,0.0001524596,0.0001890209,0.0004271535],"domain_scores_gemma":[0.9949351,0.004034214,0.0002570135,0.0001555671,0.000279647,0.0003384587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002565166,0.0001731832,0.0005847174,0.00009484463,0.00007654091,0.0001229613,0.0001064491,0.9610607,0.0005060172,0.005641003,0.002267185,0.02910992],"study_design_scores_gemma":[0.00009271952,0.00007815172,0.0001610715,0.00001234568,0.00002325126,0.00002629103,0.00006040035,0.9950837,0.0001775424,0.003795087,0.0004760407,0.00001346866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.137945,0.001801533,0.8433081,0.001117613,0.0003058233,0.000739044,0.0005097807,0.0008049468,0.01346826],"genre_scores_gemma":[0.5954022,0.0004316312,0.3997822,0.0003042816,0.0001128265,0.0003909431,0.0004543288,0.0001569223,0.002964687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01738094,"threshold_uncertainty_score":0.03455955,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chandra K. Jaggi","is_ca":false},{"name":"S.K. Goyal","is_ca":true},{"name":"Satish K. Goel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1167070718986254,"gpt":0.3446620012063871,"spread":0.2279549293077617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005953955,0.001165181,0.003330399,0.001246228,0.0008733323,0.005699797,0.00238946,0.004413465,0.006339108],"category_scores_gemma":[0.01498873,0.002815001,0.001550122,0.001687085,0.001625861,0.003876641,0.001545763,0.002899557,0.000651786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003236712,"about_ca_system_score_gemma":0.00313543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008876984,"about_ca_topic_score_gemma":0.005844979,"domain_scores_codex":[0.9978679,0.0007780342,0.000168207,0.0003967194,0.0002206893,0.0005684641],"domain_scores_gemma":[0.9889621,0.008268659,0.0008618261,0.0003866584,0.0008667461,0.0006540297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001508087,0.0001732342,0.001161341,0.0001487036,0.00007110108,0.0004638458,0.0001530288,0.974309,0.001799657,0.01340261,0.000797221,0.006012116],"study_design_scores_gemma":[0.0001301458,0.0001963717,0.0008790278,0.0000227212,0.00006038111,0.00006906085,0.0001315866,0.9872777,0.001035809,0.009792536,0.0003487325,0.00005587675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8258374,0.0008764397,0.1528527,0.002258465,0.0002628636,0.0003457119,0.001013427,0.0003750548,0.01617791],"genre_scores_gemma":[0.9900383,0.0001461647,0.006607761,0.00004814745,0.00002234909,0.00002865616,0.0001013025,0.00002678414,0.002980689],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008876984,"threshold_uncertainty_score":0.03148788,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Válerie Bélanger","is_ca":true},{"name":"Ángel Ruiz","is_ca":true},{"name":"Pere Llorens Soriano","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1135363571816246,"gpt":0.3555186643399212,"spread":0.2419823071582966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001707807,0.001012761,0.0005805306,0.0009148111,0.0002447916,0.002565857,0.001938808,0.001101633,0.002733105],"category_scores_gemma":[0.005977947,0.0005843416,0.0007696669,0.003273596,0.0006284311,0.002703333,0.0005281037,0.001788372,0.0003763472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002600824,"about_ca_system_score_gemma":0.001462204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01836804,"about_ca_topic_score_gemma":0.01927513,"domain_scores_codex":[0.9992754,0.0002508359,0.00004853697,0.0001754816,0.0001628966,0.00008702594],"domain_scores_gemma":[0.9968837,0.001696244,0.0006737334,0.0001066133,0.0005296385,0.0001100888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007153944,0.00006737901,0.005013952,0.0001715651,0.00006698485,0.00003375561,0.00005550952,0.9378769,0.0002647733,0.024385,0.002825708,0.02916694],"study_design_scores_gemma":[0.00001085164,0.0000461382,0.003309931,0.00006116243,0.00004739649,0.00004723662,0.0001618745,0.9671192,0.000419314,0.01849598,0.01025553,0.00002529795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.2960495,0.0491324,0.5843014,0.02255533,0.000941706,0.00009125991,0.003021142,0.0003946248,0.04351262],"genre_scores_gemma":[0.9046386,0.03032193,0.05072455,0.0006818547,0.0006508314,0.00007788889,0.00209505,0.0001738212,0.01063545],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.01836804,"threshold_uncertainty_score":0.03652227,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yao Chen","is_ca":false},{"name":"Wade D. Cook","is_ca":true},{"name":"Joe Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.275618365468491,"gpt":0.4997166474752832,"spread":0.2240982820067922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006130347,0.001462554,0.00230585,0.002246705,0.000822785,0.002985232,0.001183209,0.00206923,0.004378427],"category_scores_gemma":[0.01344626,0.0008717166,0.002478442,0.001925612,0.001328321,0.002166565,0.002135445,0.002461246,0.0006051712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00264295,"about_ca_system_score_gemma":0.002578813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004415187,"about_ca_topic_score_gemma":0.002690722,"domain_scores_codex":[0.9980446,0.001048816,0.0001054603,0.0001841355,0.0003670588,0.0002500195],"domain_scores_gemma":[0.9897473,0.009077789,0.0002911101,0.0002674068,0.0005071607,0.0001093514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005024859,0.00007197703,0.0004517343,0.0001826768,0.00008270548,0.0000916789,0.00008296523,0.8695496,0.001025404,0.1095796,0.0002956456,0.01853589],"study_design_scores_gemma":[0.000009392304,0.00001652337,0.0001488698,0.00002373815,0.00001759575,0.00001539065,0.00002264665,0.9498711,0.0005347426,0.04887791,0.0004538992,0.000008225674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01934753,0.0004627361,0.9748443,0.0001539181,0.0000162217,0.00006448981,0.00008074084,0.00003707943,0.004993035],"genre_scores_gemma":[0.6828755,0.001209668,0.3092186,0.00008896059,0.00005397915,0.0005657395,0.0003265248,0.0001098529,0.005551184],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006130347,"threshold_uncertainty_score":0.03242081,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Desheng Wu","is_ca":true},{"name":"Yidong Zhang","is_ca":false},{"name":"Dexiang Wu","is_ca":true},{"name":"David L. Olson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3715824838578539,"gpt":0.5019066362398276,"spread":0.1303241523819737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004825699,0.001749971,0.002092206,0.002924142,0.001309054,0.003341038,0.002614747,0.002696812,0.003141398],"category_scores_gemma":[0.009129907,0.001527018,0.0032866,0.002909882,0.001658704,0.003562785,0.002033802,0.002131623,0.0002257921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002004106,"about_ca_system_score_gemma":0.001489481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004310765,"about_ca_topic_score_gemma":0.003975403,"domain_scores_codex":[0.9973677,0.001664425,0.0001040269,0.0002002677,0.0005381402,0.0001254556],"domain_scores_gemma":[0.9942345,0.004985363,0.0002570293,0.00009911443,0.000288252,0.0001357399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007433409,0.0000779932,0.0002984586,0.0001620725,0.0001480546,0.0001971884,0.0001044883,0.9158629,0.0004012757,0.07002663,0.0003809622,0.01226572],"study_design_scores_gemma":[0.000009572382,0.00002661004,0.00006946839,0.00001978552,0.00002631739,0.00002658797,0.0000202115,0.9686334,0.00009458492,0.03087687,0.0001810826,0.00001552616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01262938,0.0005958822,0.9828266,0.0003275042,0.00003646769,0.00005961774,0.00004628255,0.0000418436,0.00343649],"genre_scores_gemma":[0.6697042,0.001304706,0.3236784,0.0001021941,0.0001484829,0.0005121295,0.00009120299,0.00004970652,0.004408991],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004825699,"threshold_uncertainty_score":0.02552104,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ignacio Castillo","is_ca":true},{"name":"F. J. Kampas","is_ca":false},{"name":"János D. Pintér","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06645379157372057,"gpt":0.3199350637391034,"spread":0.2534812721653829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002288688,0.001496621,0.002159904,0.001551784,0.001009292,0.001530688,0.001009919,0.002973553,0.004043082],"category_scores_gemma":[0.008170557,0.0008286542,0.001138772,0.003175569,0.001660617,0.002135972,0.001186076,0.001394404,0.000452593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008151306,"about_ca_system_score_gemma":0.0007508816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004928314,"about_ca_topic_score_gemma":0.003095678,"domain_scores_codex":[0.9991973,0.0004043184,0.00003012327,0.00008670658,0.0002072615,0.00007426747],"domain_scores_gemma":[0.9932154,0.005539591,0.0002713137,0.0003518969,0.0005145399,0.0001073212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001074314,0.0000622254,0.00024363,0.0001154952,0.00002159303,0.00002613732,0.00006429801,0.9674754,0.0006909333,0.009277369,0.0008670857,0.0210484],"study_design_scores_gemma":[0.00001182811,0.00002874025,0.00007914774,0.000005557499,0.000007055618,0.000009645873,0.00001417991,0.9957048,0.0004998952,0.003373653,0.000260182,0.000005212161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1629211,0.00416053,0.8096317,0.0006025602,0.0001910787,0.00009194262,0.0001370642,0.0004998751,0.02176426],"genre_scores_gemma":[0.6680851,0.001560792,0.3245576,0.000111094,0.000114584,0.0002186179,0.0002060502,0.0003230049,0.004823097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004928314,"threshold_uncertainty_score":0.01352543,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Trade credit; Expiration; Period (music); Business; Finance; Expiration date; Economics; Medicine","authors":[{"name":"Jiang Wu","is_ca":false},{"name":"Liang‐Yuh Ouyang","is_ca":false},{"name":"Leopoldo Eduardo Cárdenas‐Barrón","is_ca":false},{"name":"Suresh Kumar Goyal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1076970169518836,"gpt":0.3142374156106111,"spread":0.2065403986587274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941829,0.001127825,0.002159376,0.001377301,0.0005187124,0.002554896,0.001946184,0.002287039,0.004844706],"category_scores_gemma":[0.01644514,0.001184068,0.0008527329,0.0009781986,0.001421155,0.00309992,0.001284611,0.001631635,0.0002675948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002180936,"about_ca_system_score_gemma":0.002469065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002892191,"about_ca_topic_score_gemma":0.001840095,"domain_scores_codex":[0.999056,0.0003380604,0.00005769104,0.0001496864,0.0000806801,0.0003180002],"domain_scores_gemma":[0.9806883,0.01291347,0.002464635,0.0006481517,0.00104119,0.002244204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003961548,0.0004547118,0.006406956,0.0004139268,0.0001022583,0.00052089,0.0001674529,0.9251102,0.007544784,0.02731789,0.002895384,0.02510397],"study_design_scores_gemma":[0.0002262571,0.0003648991,0.004138925,0.00005639734,0.00006505207,0.0001160338,0.0000914585,0.9767198,0.001144216,0.01675179,0.0002679198,0.00005726657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8341775,0.001274414,0.1562334,0.001130846,0.0001366585,0.0003058029,0.000555555,0.0004183734,0.005767544],"genre_scores_gemma":[0.9919092,0.0002243032,0.00617763,0.00004356563,0.00003678477,0.00005063355,0.0000934122,0.00002741316,0.001437158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004941829,"threshold_uncertainty_score":0.02613527,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Juan Du","is_ca":false},{"name":"Wade D. Cook","is_ca":true},{"name":"Joe Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1909925153001464,"gpt":0.4596566418996745,"spread":0.2686641265995281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006259898,0.001343114,0.002217841,0.002027179,0.0007395452,0.003510279,0.001779489,0.001302155,0.004689499],"category_scores_gemma":[0.01384652,0.0008259329,0.001790652,0.004190842,0.0009879383,0.002901136,0.001080748,0.001677267,0.0003687954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00381112,"about_ca_system_score_gemma":0.002117684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00633793,"about_ca_topic_score_gemma":0.004414212,"domain_scores_codex":[0.9963831,0.002024823,0.000152996,0.0003356621,0.0008029111,0.0003004618],"domain_scores_gemma":[0.9943282,0.004239299,0.000264445,0.0004278687,0.0006724627,0.00006778233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000661158,0.00004361094,0.0002883424,0.00004994177,0.00007392947,0.00002319533,0.00001837165,0.9498647,0.0003871177,0.03217543,0.0002650965,0.01674418],"study_design_scores_gemma":[0.000008260832,0.00001896019,0.0002601611,0.000008578224,0.00003004661,0.00001480769,0.000009759692,0.9887683,0.0003291797,0.01023426,0.0003098947,0.000007797798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03651746,0.0004073645,0.9534393,0.0001465349,0.00005698258,0.000117308,0.0001244406,0.00009535519,0.009095264],"genre_scores_gemma":[0.7943534,0.0004472447,0.1994078,0.00007296517,0.00004939585,0.0003411966,0.0001971324,0.0001165428,0.005014393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00633793,"threshold_uncertainty_score":0.03310591,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Steffen Jørgensen","is_ca":false},{"name":"Sihem Taboubi","is_ca":true},{"name":"Georges Zaccour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05521878976130972,"gpt":0.3122879218777673,"spread":0.2570691321164575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003996021,0.0007899412,0.001166884,0.001481927,0.001298552,0.003704212,0.001165955,0.003824976,0.02157535],"category_scores_gemma":[0.0156212,0.001031888,0.001469262,0.001124224,0.00264329,0.00312377,0.004108403,0.001802297,0.002378137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007045261,"about_ca_system_score_gemma":0.001194926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001588757,"about_ca_topic_score_gemma":0.001874964,"domain_scores_codex":[0.9973054,0.0009285421,0.0001347885,0.0003030221,0.0005761321,0.0007521284],"domain_scores_gemma":[0.9793971,0.01045335,0.004268494,0.002015372,0.001308793,0.002556821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0101161,0.009479906,0.6806835,0.0007991127,0.0008366024,0.007536024,0.006235175,0.00289989,0.03953755,0.02825927,0.007641245,0.2059756],"study_design_scores_gemma":[0.001117019,0.002908833,0.9040934,0.0003354122,0.001581875,0.008265406,0.007751907,0.00372755,0.007768819,0.05650288,0.005770508,0.0001764062],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9577348,0.0006494033,0.001273372,0.001679398,0.00005220667,0.00005997706,0.00006306588,0.00006354754,0.03842429],"genre_scores_gemma":[0.9975497,0.0001881858,0.0003786919,0.0002475187,0.00004454876,0.00001710807,0.00003945488,0.00001165942,0.001523061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02157535,"threshold_uncertainty_score":0.07217675,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Erhan Erkut","is_ca":false},{"name":"Avraam Karagiannidis","is_ca":false},{"name":"G. Perkoulidis","is_ca":false},{"name":"Stevanus A. Tjandra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1282017273757428,"gpt":0.3490702394681768,"spread":0.220868512092434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001336371,0.0007778654,0.001506933,0.0008143868,0.0007208909,0.002230612,0.002916819,0.002599023,0.003325199],"category_scores_gemma":[0.003010169,0.0008710561,0.001211885,0.001282527,0.0009541484,0.001832301,0.001405685,0.001149034,0.0004195541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005192362,"about_ca_system_score_gemma":0.003166633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1343245,"about_ca_topic_score_gemma":0.06979929,"domain_scores_codex":[0.9989957,0.000396692,0.00005353559,0.0002533771,0.00006657278,0.0002340032],"domain_scores_gemma":[0.9984316,0.0007873429,0.0002477163,0.0001137516,0.000276985,0.0001425773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004542233,0.00002696692,0.0007950706,0.000008604592,0.00001713146,0.00007490654,0.00002186044,0.9961082,0.00007878397,0.001333846,0.0001561319,0.001332999],"study_design_scores_gemma":[0.00001247464,0.00001896495,0.0002960716,0.000002340811,0.000009364905,0.0000173613,0.00004823705,0.9986576,0.00004506344,0.0007470666,0.0001376769,0.000007751142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9023828,0.0003249372,0.08293791,0.001054571,0.00008388028,0.0001733013,0.001043573,0.0003466223,0.01165245],"genre_scores_gemma":[0.9913809,0.00008408909,0.004768383,0.00002392899,0.00000956304,0.00004313646,0.0002150497,0.00002215595,0.003452774],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1343245,"threshold_uncertainty_score":0.2670854,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nabila Azi","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04058463769978288,"gpt":0.3074463557067402,"spread":0.2668617180069573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132371,0.001289555,0.001951057,0.0009746955,0.0009848352,0.00171052,0.002708444,0.002278733,0.008048504],"category_scores_gemma":[0.003659507,0.001147398,0.001045897,0.00182503,0.0008915251,0.002729199,0.001808724,0.001551142,0.001151789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002011374,"about_ca_system_score_gemma":0.003878652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01323682,"about_ca_topic_score_gemma":0.01418545,"domain_scores_codex":[0.999301,0.000115055,0.00003689505,0.0001890019,0.000212418,0.0001456471],"domain_scores_gemma":[0.998852,0.0006885885,0.00007975671,0.0001354485,0.0001705318,0.00007362712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002103763,0.0001384842,0.0002853409,0.0001494117,0.00004617949,0.00007480589,0.00007722002,0.8304458,0.001340003,0.01454211,0.003738595,0.1489516],"study_design_scores_gemma":[0.00006707618,0.00002626333,0.00005937284,0.000007432403,0.00001290571,0.00002445599,0.00001533708,0.9908285,0.0002385243,0.007896526,0.0008164599,0.000007215675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01169219,0.0003341401,0.9822271,0.0002124082,0.0001178216,0.0001177053,0.0001187926,0.0008793896,0.004300313],"genre_scores_gemma":[0.1207095,0.0002652044,0.8745915,0.0001081728,0.00007728751,0.0002700959,0.0002246951,0.0001692811,0.003584363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01323682,"threshold_uncertainty_score":0.02692491,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Debing Ni","is_ca":false},{"name":"Kevin Li","is_ca":true},{"name":"Tang Xiao-wo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04416915676319654,"gpt":0.3388783040624034,"spread":0.2947091472992068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004421528,0.0004942926,0.0009556754,0.0007015256,0.001634024,0.004911338,0.001806537,0.002703464,0.01154026],"category_scores_gemma":[0.01542755,0.0005518324,0.0008767091,0.001219549,0.004108794,0.00803681,0.002424096,0.002283203,0.0003391613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003727649,"about_ca_system_score_gemma":0.003510207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01136981,"about_ca_topic_score_gemma":0.007413245,"domain_scores_codex":[0.9972076,0.001510639,0.0001058458,0.0002375716,0.000449512,0.0004888717],"domain_scores_gemma":[0.9902255,0.00698995,0.0008590785,0.0004745131,0.0008273314,0.0006235504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009576445,0.000156148,0.00152189,0.00004814954,0.00003537272,0.0002118602,0.0009329807,0.0866509,0.0004053271,0.8993598,0.000983341,0.009598609],"study_design_scores_gemma":[0.00004973574,0.00004180508,0.001230069,0.00002998544,0.00001972609,0.00005178777,0.001143182,0.1616331,0.000143371,0.8335544,0.002078181,0.00002452719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6300988,0.001105073,0.2271018,0.009050663,0.0001231224,0.0002141173,0.0001567403,0.00005533463,0.1320943],"genre_scores_gemma":[0.992073,0.0002398229,0.003176797,0.00006132932,0.00003579564,0.0000303989,0.00001679164,0.00001030149,0.004355627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01154026,"threshold_uncertainty_score":0.03860605,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Guido Perboli","is_ca":false},{"name":"Mariangela Rosano","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1453678605602083,"gpt":0.3406096048827289,"spread":0.1952417443225206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193291,0.001020709,0.001082463,0.001984313,0.0006873626,0.002619959,0.002427827,0.002159532,0.00323533],"category_scores_gemma":[0.004484534,0.0006482305,0.001569842,0.002037165,0.00111072,0.002567996,0.001359908,0.001289355,0.0004395774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001501317,"about_ca_system_score_gemma":0.002000321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007090699,"about_ca_topic_score_gemma":0.005152061,"domain_scores_codex":[0.998679,0.0005557247,0.0001420395,0.000161897,0.0003416727,0.000119707],"domain_scores_gemma":[0.9975828,0.001491045,0.0002217129,0.0002932058,0.0002897573,0.0001214854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003811718,0.0001301789,0.003465947,0.0001213582,0.00004765716,0.00005522105,0.0001346879,0.9393535,0.0006745664,0.03972715,0.0004304429,0.01582119],"study_design_scores_gemma":[0.000008792657,0.00002807732,0.00024356,0.00003333657,0.000009607599,0.00002784264,0.00004744991,0.9822059,0.0003480923,0.01500002,0.002039956,0.000007385972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1214328,0.005149934,0.8419654,0.001333744,0.0001059911,0.0005277491,0.0008096448,0.000852023,0.02782248],"genre_scores_gemma":[0.7600656,0.009026036,0.2218895,0.0002049419,0.0001148625,0.0006950725,0.001304844,0.0001453324,0.006553821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007090699,"threshold_uncertainty_score":0.01409882,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Ceyda Oǧuz","is_ca":false},{"name":"Nenad Mladenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08025433142720256,"gpt":0.3410985650891733,"spread":0.2608442336619707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736926,0.0008301538,0.003002594,0.001455303,0.000692285,0.001005691,0.002259236,0.002132658,0.005082293],"category_scores_gemma":[0.005496563,0.001117479,0.0007747776,0.001546649,0.0008964784,0.001560992,0.001032269,0.001226062,0.0003656876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001422858,"about_ca_system_score_gemma":0.001535914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01453596,"about_ca_topic_score_gemma":0.008811629,"domain_scores_codex":[0.9993406,0.0003547737,0.00002252047,0.00008319335,0.0001222562,0.0000767167],"domain_scores_gemma":[0.99691,0.002618438,0.00011102,0.00006617737,0.0002104449,0.00008396016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001505104,0.00006879581,0.0002147895,0.00004493601,0.00002954055,0.0000184621,0.00002586605,0.9726474,0.0002124197,0.005855035,0.001407223,0.01932514],"study_design_scores_gemma":[0.00001537608,0.00001195463,0.00003256955,0.000002077694,0.000002541467,0.000002136363,0.000003065305,0.9983625,0.00003280494,0.001452992,0.00008025747,0.000001693972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08224071,0.0008870762,0.9090352,0.0005031067,0.0001412064,0.0001594927,0.0002329579,0.0004175109,0.006382729],"genre_scores_gemma":[0.6495849,0.0003470926,0.337894,0.0001780919,0.000112355,0.0005142509,0.0005183826,0.0001782345,0.01067268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01453596,"threshold_uncertainty_score":0.02890271,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Bintong Chen","is_ca":false},{"name":"Jing Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1063444822412994,"gpt":0.3308322412738877,"spread":0.2244877590325883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004063727,0.0001967555,0.0003387701,0.0005429338,0.001158572,0.00467768,0.0008914745,0.005036979,0.05206613],"category_scores_gemma":[0.03378291,0.0002704263,0.0004319802,0.0004816263,0.001893368,0.01174054,0.0009103488,0.004130993,0.005859455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001164452,"about_ca_system_score_gemma":0.003853278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003822312,"about_ca_topic_score_gemma":0.006918406,"domain_scores_codex":[0.9981273,0.0007791758,0.00008724745,0.0002200904,0.0003615344,0.0004248052],"domain_scores_gemma":[0.9774538,0.0127362,0.002278398,0.0006853367,0.002293516,0.004552814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00222881,0.003357029,0.04614738,0.000516838,0.0001296631,0.000834215,0.001161319,0.00173146,0.001156362,0.1093957,0.2855012,0.5478401],"study_design_scores_gemma":[0.001143561,0.0009315582,0.08028774,0.001965587,0.0004937791,0.002775742,0.0280868,0.0239949,0.00472848,0.481511,0.373572,0.0005089284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.1715394,0.006032404,0.01070674,0.652784,0.005794094,0.0001810455,0.0007343753,0.0004273093,0.1518006],"genre_scores_gemma":[0.9311782,0.003030868,0.006904008,0.03011911,0.003539736,0.0001069494,0.0001777668,0.0001916292,0.02475172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05206613,"threshold_uncertainty_score":0.1741785,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Witold Pedrycz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0866097097615769,"gpt":0.3643384741984717,"spread":0.2777287644368948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008552919,0.00106186,0.002893732,0.002092038,0.001046319,0.007346964,0.002484374,0.002473074,0.001619824],"category_scores_gemma":[0.02609897,0.001085374,0.001760639,0.003380392,0.004656323,0.01122691,0.004275339,0.004546077,0.0002285413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002883321,"about_ca_system_score_gemma":0.002750769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003045953,"about_ca_topic_score_gemma":0.002264515,"domain_scores_codex":[0.9939453,0.003462161,0.0004851677,0.0005839762,0.001145444,0.0003779978],"domain_scores_gemma":[0.9843449,0.01094717,0.001567157,0.001721828,0.000830272,0.0005886028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008175981,0.00007516066,0.0007712887,0.0001848776,0.00009678212,0.00009529474,0.0003248024,0.2814933,0.0005950874,0.6963155,0.0005496852,0.01941644],"study_design_scores_gemma":[0.00001122545,0.00001444498,0.0001267642,0.00004290543,0.0000215186,0.00001489838,0.00005941306,0.3753076,0.0001388808,0.6236694,0.0005763431,0.00001668238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01935681,0.001198288,0.9733176,0.002711203,0.00008339616,0.00005318264,0.00007574495,0.00006850854,0.003135231],"genre_scores_gemma":[0.6872383,0.002124365,0.3085821,0.0003121546,0.0002734595,0.0002080138,0.0001188817,0.00005585475,0.001086803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008552919,"threshold_uncertainty_score":0.04523271,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mehran Hojati","is_ca":true},{"name":"C. R. Bector","is_ca":true},{"name":"K. Smimou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2072447309299977,"gpt":0.4825660956785808,"spread":0.275321364748583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177334,0.000965386,0.00125359,0.001246928,0.0008438363,0.0009602394,0.001336153,0.001003904,0.01073142],"category_scores_gemma":[0.005699618,0.0006000695,0.001205499,0.001229655,0.0005485203,0.0009422159,0.001242606,0.001557086,0.004086187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000387429,"about_ca_system_score_gemma":0.0008224894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001650842,"about_ca_topic_score_gemma":0.002601694,"domain_scores_codex":[0.9990535,0.0002339496,0.00006433514,0.0001572529,0.0004440231,0.00004692626],"domain_scores_gemma":[0.9986026,0.0006169717,0.00006004825,0.0002698526,0.0003936951,0.00005692937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002394687,0.00009580946,0.000463862,0.0003586551,0.0001643426,0.0002325668,0.0001741609,0.04279163,0.04969999,0.08646255,0.00921721,0.8100997],"study_design_scores_gemma":[0.0001646742,0.0002186086,0.001135988,0.000060015,0.0001618397,0.0007316059,0.0000485309,0.8034006,0.03606191,0.1049505,0.05291694,0.0001487512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004099342,0.00003781535,0.9986896,0.00001691395,0.00004290949,0.00001656468,0.00002601682,0.0004289828,0.0003312152],"genre_scores_gemma":[0.01744389,0.00007435701,0.9790813,0.00004498902,0.00006103087,0.0001264705,0.00009052041,0.0002396226,0.00283778],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01073142,"threshold_uncertainty_score":0.03590024,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Center (category theory); Computer science; Basis (linear algebra); Mathematical optimization; Mathematics","authors":[{"name":"Bahar Y. Kara","is_ca":true},{"name":"Barbaros Ç. Tansel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1222070768181107,"gpt":0.3048564898713042,"spread":0.1826494130531935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002293633,0.001450946,0.002863787,0.001172554,0.00166837,0.003383515,0.003160276,0.003768501,0.01948681],"category_scores_gemma":[0.01206146,0.0008416694,0.00096286,0.003239425,0.002409424,0.005733372,0.00259365,0.002846617,0.001140195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002217941,"about_ca_system_score_gemma":0.002219887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006656541,"about_ca_topic_score_gemma":0.004916525,"domain_scores_codex":[0.9987844,0.0005793259,0.000032547,0.0002426739,0.0001289976,0.0002321742],"domain_scores_gemma":[0.9930373,0.005689116,0.0003302439,0.0002246817,0.0003081296,0.0004104903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007706261,0.000343986,0.0009874278,0.0006380197,0.0001464286,0.0003345594,0.0001877964,0.5992621,0.0006134968,0.3125309,0.04286423,0.04132052],"study_design_scores_gemma":[0.0002108331,0.00009564629,0.0004347675,0.0000641301,0.00004498947,0.00009379409,0.0001756809,0.5885045,0.0002031011,0.406094,0.004047556,0.00003110459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.190446,0.005691886,0.6681255,0.01330405,0.000921463,0.0004701609,0.002080834,0.0004929288,0.1184672],"genre_scores_gemma":[0.8359264,0.005070942,0.1130783,0.001162962,0.001399268,0.000404962,0.001564352,0.000373651,0.04101919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01948681,"threshold_uncertainty_score":0.0651899,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jardar Andersen","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Marielle Christiansen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07081002622745247,"gpt":0.2960951960183646,"spread":0.2252851697909122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001946759,0.0009301162,0.001142409,0.0008133182,0.000876674,0.002262322,0.001865532,0.001459625,0.003026203],"category_scores_gemma":[0.00461632,0.0007793345,0.0009375567,0.001155791,0.001173651,0.002309432,0.001690487,0.001102849,0.0003142432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002209295,"about_ca_system_score_gemma":0.001760062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004516282,"about_ca_topic_score_gemma":0.003474354,"domain_scores_codex":[0.9983449,0.0007060647,0.0000684707,0.0003434786,0.0002792016,0.0002578816],"domain_scores_gemma":[0.9983291,0.0007769468,0.00025121,0.0001442906,0.0003045982,0.0001938557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001018728,0.00004079671,0.0003767621,0.00005974642,0.00003713559,0.0001264102,0.00009455192,0.9161177,0.001699947,0.06499919,0.0009130621,0.01543271],"study_design_scores_gemma":[0.00001284896,0.00003153759,0.00005362003,0.000004638451,0.00001476569,0.00002409259,0.00002727716,0.9805234,0.0003157693,0.01817816,0.0008087743,0.000005174807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03302404,0.0001849194,0.9598702,0.0004204664,0.00007358287,0.0001031003,0.00005832765,0.0001116574,0.006153758],"genre_scores_gemma":[0.7793605,0.0004221737,0.2104954,0.0001111368,0.0001320489,0.0002520162,0.0001349154,0.00009975779,0.008991967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004516282,"threshold_uncertainty_score":0.0160296,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jaydeep Balakrishnan","is_ca":true},{"name":"Chun Hung Cheng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08361112438579654,"gpt":0.3795534717682478,"spread":0.2959423473824513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002168883,0.001019009,0.002563736,0.002073807,0.0003475832,0.002283088,0.002322451,0.002044934,0.002430159],"category_scores_gemma":[0.002940617,0.0005899947,0.0007780794,0.006696786,0.0007374447,0.002702135,0.0006877056,0.001131675,0.0006295692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001255609,"about_ca_system_score_gemma":0.002315947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003561587,"about_ca_topic_score_gemma":0.004985556,"domain_scores_codex":[0.999442,0.0001392242,0.0000657738,0.00009363635,0.0002219625,0.0000373217],"domain_scores_gemma":[0.9965385,0.002513461,0.0003681144,0.00006331666,0.0004548602,0.00006169628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008311633,0.0001092407,0.0005470871,0.01460468,0.0001884699,0.0002698658,0.00008894929,0.01986426,0.0004636352,0.01496451,0.01053652,0.9382796],"study_design_scores_gemma":[0.00007127244,0.0005560815,0.003283058,0.01384527,0.0007048627,0.002356301,0.0006831226,0.01811242,0.001270751,0.06164176,0.8973093,0.0001658609],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0003371159,0.9953437,0.00272582,0.0005247766,0.0001332564,0.00000461277,0.00001421145,0.000007140025,0.0009092694],"genre_scores_gemma":[0.003298367,0.9942176,0.001812729,0.0001177634,0.000297657,0.000007949224,0.00002013453,0.000002117026,0.0002257376],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003561587,"threshold_uncertainty_score":0.01147026,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Duygu Taş","is_ca":false},{"name":"Michel Gendreau","is_ca":true},{"name":"Nico Dellaert","is_ca":false},{"name":"Tom Van Woensel","is_ca":false},{"name":"A.G. de Kok","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0456891675178521,"gpt":0.283754516223337,"spread":0.2380653487054849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002227426,0.001777419,0.003032842,0.001685669,0.0008603832,0.002359447,0.002135268,0.002327176,0.007808977],"category_scores_gemma":[0.004826684,0.002139206,0.001609329,0.003161117,0.001068289,0.002124749,0.001035353,0.002371244,0.0006829102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001675913,"about_ca_system_score_gemma":0.002632581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02602662,"about_ca_topic_score_gemma":0.02033593,"domain_scores_codex":[0.9992379,0.0004150089,0.00002453174,0.00007869059,0.0001317599,0.0001121153],"domain_scores_gemma":[0.9965795,0.002684309,0.0001999322,0.00009778872,0.0003018586,0.0001366735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003696611,0.0000424131,0.0001047805,0.00003489635,0.00002287332,0.00002126586,0.00001047421,0.986632,0.0001008536,0.005091954,0.0008438043,0.007057686],"study_design_scores_gemma":[0.000005065704,0.000005279317,0.00001712792,0.000002057459,0.000004573476,0.000001584827,0.000002332317,0.9981806,0.00002572265,0.001693776,0.00005991833,0.000002019187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02293464,0.0005552556,0.9698696,0.0004978057,0.0001577542,0.0001609586,0.0003005606,0.0002909069,0.005232517],"genre_scores_gemma":[0.5619608,0.001162199,0.4219353,0.0003247141,0.0003844227,0.0005866552,0.0007192476,0.0004102636,0.01251641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02602662,"threshold_uncertainty_score":0.05175024,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Amina Lamghari","is_ca":true},{"name":"Roussos Dimitrakopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.162049171885197,"gpt":0.332156140681703,"spread":0.170106968796506,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007771757,0.0007309887,0.0009314505,0.00103393,0.0005101531,0.0007711051,0.001337802,0.001091795,0.001951143],"category_scores_gemma":[0.001356178,0.000441985,0.000902543,0.001305914,0.0005268294,0.0007199023,0.0007318273,0.0008616101,0.0003085833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006690128,"about_ca_system_score_gemma":0.0009608105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002026479,"about_ca_topic_score_gemma":0.002316471,"domain_scores_codex":[0.9996119,0.0001830265,0.00001180347,0.00004120764,0.0001117108,0.00004046986],"domain_scores_gemma":[0.9996789,0.0001778615,0.00003810802,0.00002490819,0.00005797825,0.00002216591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003083932,0.00002980428,0.0001819131,0.00005329121,0.00003623624,0.00005146741,0.00004626943,0.9482554,0.00102838,0.008679517,0.0006415469,0.04096528],"study_design_scores_gemma":[0.00001401458,0.0000406997,0.00006671838,0.00001206804,0.00001011473,0.00002991472,0.00001431909,0.993686,0.0003184596,0.004783816,0.001017719,0.000006031824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.021858,0.0006795732,0.972674,0.0001473119,0.00003334561,0.00009802484,0.00007111247,0.0001939543,0.004244789],"genre_scores_gemma":[0.3922819,0.0009182584,0.6027646,0.0001460375,0.00006646769,0.0004614441,0.0002811766,0.0001309152,0.002949337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002026479,"threshold_uncertainty_score":0.006527245,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wade D. Cook","is_ca":true},{"name":"Joe Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3869024093103371,"gpt":0.4902033584011331,"spread":0.103300949090796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008097582,0.001156851,0.002019088,0.005425698,0.00136185,0.004448023,0.0006395031,0.001320051,0.001124019],"category_scores_gemma":[0.02598039,0.0005503073,0.001240338,0.007604678,0.001283867,0.004104895,0.001285151,0.001495258,0.0005116289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001743551,"about_ca_system_score_gemma":0.002340842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003105462,"about_ca_topic_score_gemma":0.002443904,"domain_scores_codex":[0.9929764,0.003123965,0.0009842237,0.0003576547,0.002101057,0.0004566671],"domain_scores_gemma":[0.986809,0.009822457,0.0007837156,0.0009245856,0.001517975,0.0001422089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007103205,0.0005827323,0.04864179,0.001021832,0.0002835555,0.0002427471,0.001340363,0.2490652,0.01708942,0.09081315,0.001415761,0.5887931],"study_design_scores_gemma":[0.00005251962,0.0002553914,0.01764197,0.0003001894,0.0001644586,0.0001462931,0.00139321,0.8276859,0.02720392,0.1196062,0.005438889,0.0001111091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2622699,0.0007677678,0.730796,0.0003424432,0.00005298093,0.0003425838,0.0004384345,0.0001884265,0.004801488],"genre_scores_gemma":[0.7471093,0.0005174163,0.2503249,0.00006299846,0.00002239471,0.0003814208,0.0005190661,0.00005247243,0.00101002],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008097582,"threshold_uncertainty_score":0.04282463,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Aleksandar Ilić","is_ca":false},{"name":"Dragan Urošević","is_ca":false},{"name":"Jack Brimberg","is_ca":true},{"name":"Nenad Mladenović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0700874788475297,"gpt":0.332055878703394,"spread":0.2619683998558643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008015652,0.0005145624,0.001296083,0.0005841932,0.0004511792,0.0006697837,0.001415023,0.001230864,0.004839835],"category_scores_gemma":[0.001996186,0.0004525371,0.000680071,0.0008517081,0.0004735493,0.0009271491,0.001076197,0.000853754,0.0003818134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000576792,"about_ca_system_score_gemma":0.001077635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004553854,"about_ca_topic_score_gemma":0.005584544,"domain_scores_codex":[0.9997188,0.0001224142,0.000007752389,0.00005762469,0.00005767291,0.00003568572],"domain_scores_gemma":[0.9995934,0.0002769111,0.00002752536,0.00002228058,0.0000558957,0.00002397151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001037264,0.00006023739,0.0003129237,0.00005486289,0.00002827443,0.00003371933,0.00002920523,0.9431621,0.0005754609,0.01651345,0.002323933,0.03680208],"study_design_scores_gemma":[0.00001221743,0.00001690064,0.0000319933,0.000002769955,0.000002670504,0.000005337599,0.000005364155,0.9961385,0.0000576608,0.003430197,0.0002946707,0.000001763954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02081314,0.000248023,0.973523,0.0002304035,0.0000596605,0.00006312429,0.00007842104,0.0001813682,0.004802836],"genre_scores_gemma":[0.3903462,0.0002717018,0.599603,0.0001686459,0.0000890161,0.0004362645,0.0003085149,0.0001632803,0.008613482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004839835,"threshold_uncertainty_score":0.01619089,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gianpaolo Ghiani","is_ca":true},{"name":"Gennaro Improta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05034688933492008,"gpt":0.338411005547141,"spread":0.2880641162122209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004425964,0.000672682,0.0007895409,0.0005710435,0.0004008546,0.0009751372,0.0009720969,0.0006032168,0.006784406],"category_scores_gemma":[0.001443175,0.0002785555,0.0009456636,0.0008124398,0.0005744863,0.001114481,0.001779941,0.001479114,0.001454778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004983805,"about_ca_system_score_gemma":0.0009009123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002035799,"about_ca_topic_score_gemma":0.001906887,"domain_scores_codex":[0.9995272,0.0001632264,0.00001540095,0.00008590648,0.0001569709,0.00005142995],"domain_scores_gemma":[0.9997302,0.0001050797,0.00002337485,0.00006757418,0.00005496389,0.00001891477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001280366,0.0001607797,0.0003111708,0.0001630509,0.00003595514,0.000220181,0.0001546044,0.4028613,0.008460804,0.3459192,0.01143516,0.2301499],"study_design_scores_gemma":[0.00002828399,0.00005062977,0.0001026028,0.00001035366,0.00001215631,0.00009224717,0.00004568243,0.8436435,0.001070769,0.1445699,0.01036471,0.000009145508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0115436,0.0000924649,0.977957,0.0001852637,0.0001096265,0.00007476847,0.0001308551,0.0002246613,0.009681741],"genre_scores_gemma":[0.3352959,0.0005052867,0.6417032,0.0001931097,0.0001728309,0.0003048018,0.000958873,0.0006463806,0.02021956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006784406,"threshold_uncertainty_score":0.02269614,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jianjun Zhang","is_ca":true},{"name":"John Hodgson","is_ca":true},{"name":"Erhan Erkut","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.6070050088753729,"gpt":0.5414467475301,"spread":0.06555826134527287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001802134,0.0006613491,0.0004638839,0.003196789,0.0004516287,0.001950721,0.0004714761,0.0007811807,0.001753646],"category_scores_gemma":[0.00652743,0.0003407233,0.0005502719,0.001538612,0.0004760154,0.001972943,0.0008388087,0.000338527,0.0001923336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001184424,"about_ca_system_score_gemma":0.0008704255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01085302,"about_ca_topic_score_gemma":0.007749612,"domain_scores_codex":[0.9988536,0.0006675462,0.00006345164,0.00006180441,0.0002996621,0.00005395279],"domain_scores_gemma":[0.9952598,0.003776382,0.0003225752,0.0001673021,0.0003795789,0.00009434636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008112107,0.0002804758,0.0844503,0.0001807397,0.0003905591,0.0004590703,0.0005731422,0.7978824,0.00502935,0.01266667,0.001407211,0.09586897],"study_design_scores_gemma":[0.00004027337,0.0001529909,0.008327268,0.00002697305,0.00009244083,0.0001279507,0.0007035939,0.9756551,0.00271703,0.01033558,0.001791318,0.00002941594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8755109,0.0003640021,0.110732,0.0006528137,0.00002982579,0.0001537238,0.0008003213,0.0009461551,0.01081026],"genre_scores_gemma":[0.9527315,0.0001890102,0.04594186,0.00002266642,0.000007497422,0.00004701269,0.0002843172,0.00001922412,0.0007568086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01085302,"threshold_uncertainty_score":0.02157968,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Klaas De Brucker","is_ca":false},{"name":"Cathy Macharis","is_ca":false},{"name":"Alain Verbeke","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09652732781226708,"gpt":0.3090058861997092,"spread":0.2124785583874421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02225267,0.002146976,0.002770976,0.005956544,0.003744008,0.008278591,0.003632323,0.004023905,0.003941609],"category_scores_gemma":[0.03173722,0.001019112,0.003013164,0.004539397,0.007623122,0.00546768,0.005101367,0.003631942,0.0001925536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006347093,"about_ca_system_score_gemma":0.006376709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00522873,"about_ca_topic_score_gemma":0.006656693,"domain_scores_codex":[0.9738936,0.02010802,0.0007668217,0.0006959084,0.003602207,0.0009334058],"domain_scores_gemma":[0.9722343,0.02373527,0.001314942,0.0004488873,0.001536144,0.0007304145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001594366,0.0002645683,0.001240875,0.0008180264,0.000656052,0.0007659956,0.002106417,0.3745312,0.001325859,0.5757454,0.002164868,0.04022129],"study_design_scores_gemma":[0.00005146167,0.0001540763,0.0005451089,0.0002793122,0.0001056932,0.0001050986,0.001645375,0.3861866,0.0003761321,0.6069303,0.003535513,0.00008526287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05938285,0.003720464,0.8937389,0.007792603,0.0003190855,0.0005988539,0.0001026186,0.00005402076,0.03429065],"genre_scores_gemma":[0.7402937,0.001462571,0.2538873,0.0003897468,0.0002168316,0.0007280725,0.00006484218,0.0000451967,0.002911712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02225267,"threshold_uncertainty_score":0.1176847,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Güneş Erdoğan","is_ca":false},{"name":"Roberto Wolfler Calvo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04100789879994455,"gpt":0.3139234970845028,"spread":0.2729155982845583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427465,0.001651725,0.003135295,0.001094597,0.0009996325,0.002576089,0.004268704,0.003270947,0.01430807],"category_scores_gemma":[0.006155384,0.001545399,0.001284815,0.002596118,0.00136181,0.003572435,0.001928034,0.001930654,0.0008952108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00154111,"about_ca_system_score_gemma":0.001103972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008203829,"about_ca_topic_score_gemma":0.004026738,"domain_scores_codex":[0.9985263,0.0005720516,0.00006754851,0.0003171882,0.0001555443,0.000361379],"domain_scores_gemma":[0.9971389,0.001796531,0.0002842386,0.0001715677,0.0001876543,0.0004211538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009077007,0.0002491221,0.001349925,0.0004868222,0.0001433228,0.0008738261,0.0001466529,0.9144664,0.001160782,0.04907617,0.01014359,0.02099573],"study_design_scores_gemma":[0.0001496234,0.0001789207,0.00072284,0.00005602707,0.00007045225,0.0002882339,0.0003494945,0.9333266,0.0004833049,0.06160408,0.002723155,0.00004737746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4982372,0.00262185,0.4432317,0.004110514,0.000538248,0.000416897,0.003577412,0.0005347474,0.04673145],"genre_scores_gemma":[0.9492027,0.001008583,0.02805887,0.0002314858,0.0002299304,0.0001448869,0.001456584,0.0001823351,0.01948466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01430807,"threshold_uncertainty_score":0.04786527,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alexandra Anderluh","is_ca":false},{"name":"Pamela C. Nolz","is_ca":false},{"name":"Vera Hemmelmayr","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03837452215620379,"gpt":0.3206628979252961,"spread":0.2822883757690923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182273,0.001153801,0.001380804,0.0007591521,0.0005266886,0.001637418,0.001162423,0.001889631,0.003626472],"category_scores_gemma":[0.002163673,0.0006287568,0.001054285,0.001086125,0.0009342845,0.001000863,0.001393628,0.0009172422,0.0002340026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001384487,"about_ca_system_score_gemma":0.001134155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007944125,"about_ca_topic_score_gemma":0.004357611,"domain_scores_codex":[0.9993674,0.0002996234,0.00001936974,0.0001180063,0.00007046558,0.0001250896],"domain_scores_gemma":[0.9990051,0.0007015099,0.0001079724,0.00003308398,0.00006320101,0.00008905303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003045245,0.00002136959,0.0001867107,0.00003271592,0.00001730861,0.00006361082,0.00001567096,0.9957562,0.0002730497,0.001598389,0.0001325615,0.001871965],"study_design_scores_gemma":[0.0000171978,0.00004446587,0.0001703756,0.000005641816,0.000008957925,0.00001646322,0.00003461104,0.9975252,0.000197695,0.001769186,0.0002045752,0.000005600388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4991572,0.001230317,0.4778867,0.001063426,0.0001212594,0.0002243973,0.0005500294,0.0002107951,0.01955579],"genre_scores_gemma":[0.9404747,0.0002421558,0.05453027,0.00009688156,0.00002519721,0.0001427942,0.0001877068,0.00004760841,0.00425266],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007944125,"threshold_uncertainty_score":0.01579577,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Xiaosheng Qin","is_ca":true},{"name":"Guohe Huang","is_ca":true},{"name":"Guangming Zeng","is_ca":false},{"name":"A. Chakma","is_ca":true},{"name":"Yuefei Huang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07461369782545231,"gpt":0.3359253354396741,"spread":0.2613116376142218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009461318,0.0007582093,0.001394889,0.0004931333,0.0005380872,0.001543774,0.00155439,0.002249078,0.001970347],"category_scores_gemma":[0.001770077,0.0005568152,0.0006421271,0.0008286293,0.0008881408,0.001224781,0.0007674942,0.001021422,0.0001885341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750176,"about_ca_system_score_gemma":0.001256914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01878803,"about_ca_topic_score_gemma":0.01001161,"domain_scores_codex":[0.9995906,0.0001206354,0.00002070786,0.0001179888,0.00009657128,0.00005353009],"domain_scores_gemma":[0.9994677,0.0002768359,0.00009445997,0.0000174441,0.0001108954,0.00003264169],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002293439,0.00001264438,0.0001073689,0.00001212603,0.00000998324,0.0000245869,0.00001316695,0.9964395,0.0002732441,0.001796207,0.00007068886,0.001217572],"study_design_scores_gemma":[0.0000040161,0.000008175844,0.00004092619,9.210684e-7,0.000003458122,0.000002108377,0.000001909762,0.9994864,0.00004027643,0.0003713552,0.00003801427,0.000002357895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2160724,0.0005660449,0.7698765,0.0007370088,0.0001017848,0.0001114537,0.000471974,0.0003072726,0.01175551],"genre_scores_gemma":[0.9835204,0.0001670397,0.01296374,0.00003644593,0.00001792521,0.00008342889,0.00008625537,0.00001384625,0.00311083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01878803,"threshold_uncertainty_score":0.03735739,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ivan Contreras","is_ca":true},{"name":"Elena Fernández","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2199906032158702,"gpt":0.3099742105751759,"spread":0.08998360735930577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003600362,0.002175563,0.002399969,0.002185388,0.001074868,0.004964595,0.004391588,0.003881328,0.006975885],"category_scores_gemma":[0.009465502,0.001609956,0.002683094,0.00378803,0.003498279,0.01004871,0.003176273,0.002838476,0.0007406379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002799632,"about_ca_system_score_gemma":0.001922961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004114726,"about_ca_topic_score_gemma":0.00386048,"domain_scores_codex":[0.9969792,0.00152318,0.0001256876,0.0004316384,0.0007351318,0.000205185],"domain_scores_gemma":[0.996214,0.00236153,0.0003220138,0.000412862,0.0005016503,0.0001879613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001595446,0.00002614684,0.0002789084,0.0001457196,0.00004188119,0.00009337852,0.00009045595,0.2367933,0.0002357117,0.7493966,0.001904033,0.01097787],"study_design_scores_gemma":[0.00001678888,0.00001935832,0.00009603314,0.00003373032,0.00003140784,0.00008585922,0.00004346838,0.3076145,0.0001109156,0.6869152,0.005017954,0.00001475354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004742991,0.0009425532,0.9795169,0.0006177516,0.00007431735,0.00003642167,0.00009622187,0.00003463231,0.01393828],"genre_scores_gemma":[0.4740341,0.01112611,0.4748285,0.0007619328,0.001335654,0.0005561656,0.0006652795,0.0002918807,0.0364003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006975885,"threshold_uncertainty_score":0.02333665,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Desheng Wu","is_ca":true},{"name":"Opher Baron","is_ca":true},{"name":"Oded Berman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1046317168021848,"gpt":0.3038569881112279,"spread":0.1992252713090432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01253297,0.001723049,0.005159454,0.001915751,0.004191265,0.01146233,0.004012282,0.009665674,0.02375801],"category_scores_gemma":[0.03871337,0.002910829,0.00224734,0.00367854,0.007057961,0.01115225,0.00449731,0.006230338,0.001432638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004779301,"about_ca_system_score_gemma":0.002353288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005043904,"about_ca_topic_score_gemma":0.003084652,"domain_scores_codex":[0.9935244,0.003757061,0.0002500348,0.000668202,0.0006426991,0.001157683],"domain_scores_gemma":[0.9311821,0.06201204,0.002173178,0.0008112616,0.001040168,0.002781357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009302402,0.0001827684,0.0008656255,0.0001904642,0.0001153262,0.0009342102,0.0008132702,0.3689617,0.0005841214,0.6171581,0.002224179,0.00704009],"study_design_scores_gemma":[0.0002218743,0.000140794,0.0002315473,0.0000634813,0.00005646021,0.0001249729,0.0005905003,0.3727974,0.0001401084,0.6242839,0.001270045,0.00007894742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4663244,0.004414423,0.374289,0.0115665,0.0006246548,0.0003478051,0.0003590837,0.0002250121,0.1418491],"genre_scores_gemma":[0.9632721,0.001110418,0.01010859,0.0002677075,0.0002811019,0.0001410207,0.0001079807,0.00004813106,0.02466291],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02375801,"threshold_uncertainty_score":0.0794785,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yue Zhang","is_ca":true},{"name":"Oded Berman","is_ca":true},{"name":"Vedat Verter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.218172015007648,"gpt":0.3461847430738333,"spread":0.1280127280661853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005878089,0.0008050047,0.001423418,0.001436497,0.0007713965,0.001700372,0.00230238,0.001384705,0.004341298],"category_scores_gemma":[0.02449271,0.001105177,0.0007014474,0.001036192,0.0006817481,0.003258108,0.001483853,0.001076026,0.0001574585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002362559,"about_ca_system_score_gemma":0.002532745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01232165,"about_ca_topic_score_gemma":0.0167355,"domain_scores_codex":[0.9970989,0.001625361,0.0001162066,0.0003411631,0.0004033199,0.0004150167],"domain_scores_gemma":[0.9833162,0.01184247,0.0009175965,0.0006960082,0.002484165,0.0007435556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001713824,0.000162003,0.004134394,0.00004142692,0.0000491629,0.00004012111,0.00007007209,0.964283,0.0003574026,0.004145124,0.00038305,0.02616292],"study_design_scores_gemma":[0.00001546455,0.0000485122,0.0003129546,0.000003810333,0.00002351315,0.000007466946,0.00001908811,0.9975128,0.0001460606,0.001769998,0.0001339599,0.000006265304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2024093,0.0002130227,0.7904627,0.0006041968,0.0001422782,0.0003883382,0.0001429262,0.0005280508,0.005109208],"genre_scores_gemma":[0.9523724,0.00003303329,0.0467275,0.00004059213,0.00002345717,0.00006469257,0.00004792949,0.00003443577,0.0006560285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01232165,"threshold_uncertainty_score":0.03108668,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Juan Du","is_ca":false},{"name":"Yao Chen","is_ca":false},{"name":"Wade D. Cook","is_ca":true},{"name":"Joe Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3824778200704557,"gpt":0.4825757472755606,"spread":0.100097927205105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005373893,0.001159975,0.001265476,0.001159929,0.000765305,0.002140265,0.002752939,0.002927804,0.004161282],"category_scores_gemma":[0.01149995,0.0007040845,0.00109389,0.001465384,0.001238974,0.003160475,0.001152211,0.00128464,0.0004362753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002284535,"about_ca_system_score_gemma":0.001660876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004107223,"about_ca_topic_score_gemma":0.002944316,"domain_scores_codex":[0.996172,0.002491225,0.0001199258,0.0004230368,0.0004218574,0.00037195],"domain_scores_gemma":[0.9930395,0.00535867,0.0004488771,0.0003985706,0.0004477463,0.0003066353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001976664,0.0001860861,0.0008694624,0.00004550357,0.00005731245,0.00008690312,0.00008489179,0.8854045,0.002406932,0.1024682,0.0004355927,0.007756971],"study_design_scores_gemma":[0.00001909024,0.00006825507,0.0002095652,0.00000383839,0.00001225119,0.00001515434,0.00001294715,0.9845243,0.0001814852,0.01481265,0.0001283303,0.00001214334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08999046,0.00007732824,0.904378,0.0001874338,0.00003291309,0.0001773843,0.0001701738,0.0001017474,0.004884572],"genre_scores_gemma":[0.8429445,0.00009407508,0.1529035,0.0000598256,0.00002514083,0.0003382357,0.0001781402,0.00002217454,0.003434415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005373893,"threshold_uncertainty_score":0.02842021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}