{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":270,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":270,"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"},"query_hash":"19c8beb56947","filters":{"venue":"Computers & Operations Research"}},"results":[{"id":"W2146004814","doi":"10.1016/j.cor.2012.04.007","title":"An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":506,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; HEC Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Vehicle routing problem; Heuristic; Computer science; Context (archaeology); Routing (electronic design automation); Mathematical optimization; Scheme (mathematics); Local search (optimization); Operations research; Mathematics; Algorithm; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1379065368142567,"gpt":0.4106109157336956,"spread":0.2727043789194389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005336909,0.0002004346,0.0002567739,0.0004512585,0.0006191744,0.0003329168,0.0004045558,0.0001375909,0.00001972439],"category_scores_gemma":[0.0004932036,0.0002246528,0.00004742201,0.001078597,0.00008663005,0.0005865743,0.0001635103,0.0008237339,0.00001964844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004621042,"about_ca_system_score_gemma":0.0001261678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001375854,"about_ca_topic_score_gemma":0.0001258552,"domain_scores_codex":[0.9967758,0.0007623157,0.0004546292,0.0003579623,0.0004530255,0.001196257],"domain_scores_gemma":[0.9979612,0.0008102485,0.00001676131,0.0004467932,0.0005009957,0.0002640025],"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.00001261619,0.0001860996,0.004961028,0.0000481864,0.00001818827,0.000001804453,0.002791628,0.9776144,0.001865091,0.006767613,0.0000601808,0.005673167],"study_design_scores_gemma":[0.000775975,0.0001259052,0.002555204,0.00007293684,0.000005972256,0.000003625648,0.0005354655,0.9942925,0.001231782,0.0001154608,0.00004849716,0.0002366983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08073785,0.0001538169,0.9171859,0.00008696344,0.0002556024,0.0009390454,0.00002967819,0.0002236864,0.000387467],"genre_scores_gemma":[0.7870376,0.00001019352,0.2123972,0.00002266471,0.0002913105,0.00009660565,0.0000605962,0.0000586258,0.00002520809],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7062997,"threshold_uncertainty_score":0.9161075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023174570","doi":"10.1016/s0305-0548(01)00079-x","title":"The generalized maximal covering location problem","year":2002,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":267,"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":"Mathematical optimization; Mathematics; Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.1076327661472703,"gpt":0.3121708075387171,"spread":0.2045380413914468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001043079,0.0001074117,0.00008330039,0.0002379476,0.001778427,0.001282862,0.0004824893,0.00003214612,0.0004915124],"category_scores_gemma":[0.0001117429,0.00008527086,0.00004020044,0.00109892,0.0001182822,0.0007714204,0.0003217788,0.0001873885,0.002476043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007869191,"about_ca_system_score_gemma":0.00001780357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631616,"about_ca_topic_score_gemma":0.001625547,"domain_scores_codex":[0.9984741,0.00005733887,0.000276895,0.0002785132,0.0005316911,0.0003814932],"domain_scores_gemma":[0.9988638,0.00003356748,0.00001107425,0.0004110598,0.0006619788,0.00001853686],"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.00001682448,0.0001931562,0.0002610095,0.0001190478,0.0000477383,0.00000320722,0.0003031653,0.4434383,0.0002474943,0.292831,0.1952841,0.06725499],"study_design_scores_gemma":[0.0002015294,0.000007007908,0.0006068758,0.00001158466,0.000003595227,4.925378e-7,0.0001135308,0.7532041,0.0000115147,0.0002519984,0.2454966,0.00009111533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.375014,0.002669606,0.3284765,0.1461392,0.004563447,0.006603507,0.000006502227,0.001161029,0.1353662],"genre_scores_gemma":[0.9885798,0.0001653865,0.001742857,0.0008820195,0.0006789409,0.0002138064,0.00003741152,0.00001864797,0.00768115],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6135658,"threshold_uncertainty_score":0.9997539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118885592","doi":"10.1016/j.cor.2010.08.008","title":"Optimal production planning for a multi-product closed loop system with uncertain demand and return","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":260,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remanufacturing; Computer science; Production planning; Mathematical optimization; Profit (economics); Lagrangian relaxation; Production (economics); Product (mathematics); New product development; Sensitivity (control systems); Manufacturing engineering; Economics; Mathematics; Business; Microeconomics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.06755306623288285,"gpt":0.3369112819890617,"spread":0.2693582157561789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002068937,0.0001831873,0.0001841286,0.0006585855,0.001211287,0.001236583,0.0003046724,0.00005441403,0.000009591996],"category_scores_gemma":[0.0003303743,0.0001561168,0.00002859753,0.0007790645,0.0001831228,0.0009387278,0.0003058264,0.0003838289,0.00001380019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009001173,"about_ca_system_score_gemma":0.00008258642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004386646,"about_ca_topic_score_gemma":0.0002321062,"domain_scores_codex":[0.9981347,0.00004922753,0.0002303658,0.0006543995,0.0004078167,0.0005234322],"domain_scores_gemma":[0.9983658,0.00007453153,0.00004108446,0.0004482547,0.001038894,0.00003147309],"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.0009112435,0.0006105893,0.01690069,0.00593138,0.0003935832,0.0002157733,0.002595217,0.8204342,0.01177912,0.06385969,0.04871679,0.02765176],"study_design_scores_gemma":[0.001085653,0.00004923093,0.001939738,0.0001272276,0.00002652615,0.00001411139,0.004422567,0.9815158,0.0002410212,0.00001802118,0.01031299,0.0002471019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8031119,0.0001067625,0.1888032,0.003499587,0.0006363708,0.003336676,0.000002220174,0.0002047526,0.0002985439],"genre_scores_gemma":[0.9456424,0.000002247574,0.05089966,0.00009515723,0.001656659,0.0004595273,0.00006707312,0.00004350546,0.001133786],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1610816,"threshold_uncertainty_score":0.9998002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2233419640","doi":"10.1016/j.cor.2015.06.001","title":"Time-dependent routing problems: A review","year":2015,"lang":"en","type":"review","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Tree traversal; Arc routing; Computer science; Time horizon; Routing (electronic design automation); Graph traversal; Arc (geometry); Point (geometry); Graph; Vehicle routing problem; Point of interest; Field (mathematics); Operations research; Node (physics); Mathematical optimization; Algorithm; Artificial intelligence; Theoretical computer science; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1917023661751183,"gpt":0.4491348750788929,"spread":0.2574325089037747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007057812,0.0004816455,0.001596091,0.0006263035,0.0003507756,0.0004139046,0.001069125,0.0003117438,0.0001748317],"category_scores_gemma":[0.0005357014,0.0004447872,0.0002595306,0.001914478,0.0001104723,0.0002242421,0.0004819832,0.001600495,0.002103906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008609124,"about_ca_system_score_gemma":0.0007726791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001144982,"about_ca_topic_score_gemma":0.000004378861,"domain_scores_codex":[0.9944676,0.002036219,0.001108988,0.0006078926,0.001026964,0.0007523395],"domain_scores_gemma":[0.9972813,0.0004623408,0.00005084805,0.001038014,0.0008611045,0.0003063548],"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":[1.445715e-7,0.00001969172,3.531519e-8,0.02285389,0.00009426305,0.000008361607,0.00009095002,0.2189155,3.479218e-7,0.00004302849,0.02378195,0.7341918],"study_design_scores_gemma":[0.00007107875,0.00002023852,1.201e-8,0.03641974,0.00008586357,0.00004334818,0.00000423964,0.3131282,2.660809e-7,0.000002805845,0.6499253,0.0002989029],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[8.2169e-8,0.916354,0.07774267,0.00006758,0.0003270125,0.002510461,0.00002898513,0.0005473095,0.002421875],"genre_scores_gemma":[2.6264e-7,0.9533417,0.04361435,0.00003161877,0.0003353702,0.0005362658,0.0003041401,0.0001906635,0.001645615],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.7338929,"threshold_uncertainty_score":0.9998004,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093938881","doi":"10.1016/j.cor.2005.07.028","title":"A survey of local search methods for graph coloring","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":228,"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; Polytechnique Montréal","funders":"","keywords":"Tabu search; Guided Local Search; Graph coloring; Local search (optimization); Subroutine; Hill climbing; Computer science; Graph; Best-first search; Search algorithm; Population; Algorithm; Theoretical computer science; Mathematics; Beam search","retraction":null,"screen_n_in":null,"score":{"opus":0.6028806549559134,"gpt":0.6204365109072726,"spread":0.01755585595135922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.03987959,0.0001061691,0.0003110932,0.001178522,0.0009291568,0.0004448867,0.001156224,0.000089184,0.0001008538],"category_scores_gemma":[0.007091647,0.00008799877,0.0001326412,0.003612599,0.000509034,0.0002938495,0.0003210583,0.000369373,0.0001407365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009347255,"about_ca_system_score_gemma":0.0006432793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001005838,"about_ca_topic_score_gemma":0.001109309,"domain_scores_codex":[0.9941718,0.002748713,0.0006888993,0.0005418283,0.001268763,0.0005800097],"domain_scores_gemma":[0.9819053,0.01260223,0.00003065868,0.0007641717,0.004492865,0.0002048149],"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.00004800273,0.0001932364,0.0008828058,0.000005634548,0.00004459967,4.172672e-7,0.0006966123,0.5652843,0.001056091,0.008909879,0.005769648,0.4171088],"study_design_scores_gemma":[0.0003970499,0.0001547829,0.01003353,0.00001437136,0.000004260797,0.000002526248,0.0003638064,0.9777556,0.004060922,0.0007542822,0.006355638,0.0001032204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06557914,0.0004059875,0.9314085,0.001610263,0.0002479519,0.0004363914,0.00003427382,0.00002884782,0.0002486258],"genre_scores_gemma":[0.6215419,0.00001062241,0.3775587,0.00003077658,0.0000847902,0.00005108972,0.00001519141,0.000009483661,0.0006974062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5559627,"threshold_uncertainty_score":0.988646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046064436","doi":"10.1016/j.cor.2011.09.021","title":"A parallel iterated tabu search heuristic for vehicle routing problems","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":228,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Vehicle routing problem; Mathematical optimization; Heuristics; Guided Local Search; Iterated local search; Heuristic; Incremental heuristic search; Computer science; Mathematics; Algorithm; Routing (electronic design automation); Beam search; Search algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1569513745849268,"gpt":0.3647560928907695,"spread":0.2078047183058427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002038768,0.0001780172,0.0002093331,0.000365653,0.0006431495,0.0003258364,0.0004535939,0.0001111405,0.00008561829],"category_scores_gemma":[0.0002343324,0.0001880436,0.000061921,0.0009754251,0.0001066457,0.0002747878,0.0001419686,0.000486211,0.00009185354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001513525,"about_ca_system_score_gemma":0.0001107444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009551538,"about_ca_topic_score_gemma":0.00002618815,"domain_scores_codex":[0.9977123,0.0003910021,0.0004068328,0.0003716707,0.0003763614,0.0007418652],"domain_scores_gemma":[0.9982624,0.0003662044,0.00001069451,0.0004249707,0.0007500992,0.0001856425],"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.00001339827,0.00006269795,0.0002516045,0.00008537772,0.00004262885,0.000004245191,0.004324763,0.9836853,0.002419654,0.002487828,0.001021521,0.005600997],"study_design_scores_gemma":[0.0005721003,0.0001062344,0.0006363356,0.0000645438,0.000005495867,0.0000060164,0.000159777,0.9959787,0.001814357,0.00009570843,0.0003570467,0.000203668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05789894,0.0001190231,0.9386768,0.0001218253,0.0002329527,0.00112147,0.00001480464,0.0004387395,0.001375399],"genre_scores_gemma":[0.6178319,0.00002273211,0.3813332,0.00002637081,0.0001144234,0.0002337872,0.00004544564,0.00006357762,0.000328603],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5599329,"threshold_uncertainty_score":0.7668197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2518264398","doi":"10.1016/j.cor.2016.04.006","title":"Mixed Integer Programming models for job shop scheduling: A computational analysis","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":227,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Computer science; Integer programming; Mathematical optimization; Job shop scheduling; Constraint programming; Scheduling (production processes); Thread (computing); Algorithm; Mathematics; Stochastic programming; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.09631262454021754,"gpt":0.3475213637295705,"spread":0.251208739189353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723783,0.0001485048,0.000211808,0.0007972874,0.0003874926,0.0003312967,0.000302719,0.00009061415,0.00004010692],"category_scores_gemma":[0.0001250638,0.0001200769,0.0001426622,0.001388751,0.0001008869,0.0003245107,0.00006962584,0.0001817374,0.0000403669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000149867,"about_ca_system_score_gemma":0.000100558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001014391,"about_ca_topic_score_gemma":0.00003668995,"domain_scores_codex":[0.9984047,0.00009321433,0.0003243129,0.0003318324,0.000413781,0.0004321886],"domain_scores_gemma":[0.9982091,0.0004668038,0.0000101366,0.0002740523,0.000880199,0.0001597537],"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.000006133778,0.00002984155,0.00005099462,0.00001240367,0.0002623694,9.689685e-7,0.0002539449,0.9694018,0.00006396375,0.006348775,0.0003582722,0.02321048],"study_design_scores_gemma":[0.0004904989,0.00003662791,0.00004857717,0.00003272866,0.00003484332,0.000001801701,0.0001168956,0.9981953,0.00011483,0.0004449724,0.0003134753,0.0001694757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01325295,0.0001190073,0.9846722,0.0008133823,0.0002434711,0.0004563302,0.0000236761,0.0002947579,0.0001241942],"genre_scores_gemma":[0.4467854,0.00001400285,0.5525792,0.00001782939,0.0001156574,0.0001851392,0.00006203312,0.00002586773,0.0002148157],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4335325,"threshold_uncertainty_score":0.4896596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066938616","doi":"10.1016/j.cor.2011.12.020","title":"The inventory-routing problem with transshipment","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":223,"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":"Transshipment (information security); Heuristics; Computer science; Routing (electronic design automation); Heuristic; Mathematical optimization; Vehicle routing problem; Operations research; Vendor; Mathematics; Artificial intelligence; Computer network; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.06979017429723672,"gpt":0.3511868917928779,"spread":0.2813967174956412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002393495,0.0001039133,0.00008633692,0.000105526,0.0009079303,0.0002988587,0.0002855948,0.00004244746,0.00001730778],"category_scores_gemma":[0.00004038697,0.00007341956,0.00002380578,0.0005582574,0.0001084318,0.0002489009,0.00005436141,0.0003919371,0.00004652292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001527745,"about_ca_system_score_gemma":0.00005506209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001557463,"about_ca_topic_score_gemma":0.00003143677,"domain_scores_codex":[0.9983196,0.0003595218,0.0001984838,0.0001279234,0.0004113899,0.000583084],"domain_scores_gemma":[0.9991331,0.0002472355,0.000006193519,0.0002906797,0.0001777901,0.0001450555],"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.000004168483,0.0000292196,0.001379685,0.00001941666,0.00003940437,7.729826e-7,0.003002525,0.9705636,0.0004481125,0.006649754,0.001307361,0.01655599],"study_design_scores_gemma":[0.0002307841,0.00003880764,0.0006829118,0.00004090447,0.000004431152,0.000008355743,0.0003324506,0.9893927,0.001153179,0.00001701065,0.007964102,0.0001343835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06259394,0.0005069739,0.9302346,0.0009336831,0.0003023884,0.0006789585,0.000001534408,0.0003158418,0.004432096],"genre_scores_gemma":[0.8431851,0.00004499146,0.1561055,0.00002337655,0.0001886723,0.0001104605,0.000006437398,0.00003645412,0.0002989571],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7805912,"threshold_uncertainty_score":0.6983158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898596225","doi":"10.1016/j.cor.2019.02.014","title":"Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":223,"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":"Queueing theory; Queue; Computer science; Routing (electronic design automation); Driving range; Mathematical optimization; Range (aeronautics); Vehicle routing problem; Electric vehicle; Real-time computing; Operations research; Computer network; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02591518657302665,"gpt":0.3053319213757771,"spread":0.2794167348027504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001673946,0.0001922823,0.0002150257,0.0004744199,0.0007489278,0.0003936524,0.0003342939,0.00008463378,0.0003381362],"category_scores_gemma":[0.00008380647,0.0001915354,0.00003790381,0.00135567,0.00003736503,0.0003958799,0.0001797515,0.0005810003,0.0009533035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005432068,"about_ca_system_score_gemma":0.0001351946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003973213,"about_ca_topic_score_gemma":0.00001960436,"domain_scores_codex":[0.9974753,0.0004232343,0.0003595921,0.000414703,0.0006268561,0.0007003626],"domain_scores_gemma":[0.9984662,0.0005128519,0.00002394586,0.0004189369,0.0004405675,0.0001375057],"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.00000674798,0.00002098146,0.0006798281,0.0000343381,0.00004046729,0.000004093844,0.0007394503,0.9518307,0.04030866,0.0006799344,0.0005243851,0.005130447],"study_design_scores_gemma":[0.0004359278,0.00008416899,0.0001729758,0.00009556508,0.000006737724,0.00001727045,0.0001219363,0.9890069,0.009575532,0.00001826519,0.0002315737,0.0002331214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6349245,0.0001317459,0.3514293,0.0004851723,0.0001325544,0.001299422,0.000008947652,0.0008688053,0.01071965],"genre_scores_gemma":[0.8395916,0.00001969944,0.1559525,0.00003064341,0.00009105218,0.00007748371,0.00005136432,0.00009348511,0.004092123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2046672,"threshold_uncertainty_score":0.9998246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094868816","doi":"10.1016/s0305-0548(03)00105-9","title":"A maximal covering location model in the presence of partial coverage","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":204,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministère de la Défense Nationale","keywords":"Range (aeronautics); Critical distance; Location model; Mathematics; Mathematical optimization; Computer science; Relaxation (psychology); Point (geometry); Critical point (mathematics); Facility location problem; Operations research; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0979631742138741,"gpt":0.3302778174341114,"spread":0.2323146432202373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00174992,0.00007846038,0.00008905997,0.0002867352,0.0002614273,0.0002506494,0.0003765842,0.00002744306,0.0000795657],"category_scores_gemma":[0.0003126193,0.00006628128,0.00002832066,0.001121702,0.00008305041,0.0006857045,0.0001222811,0.0001653197,0.00009776569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003845003,"about_ca_system_score_gemma":0.00007130734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001472631,"about_ca_topic_score_gemma":0.0009185302,"domain_scores_codex":[0.998668,0.000100931,0.0002703628,0.0002143501,0.0005044003,0.0002419644],"domain_scores_gemma":[0.9992455,0.0000444872,0.00001164592,0.0003432737,0.0003464365,0.000008618636],"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.000008346792,0.0001192924,0.0004863178,0.00006123893,0.000004240262,0.00000101971,0.0003126462,0.837729,0.0001090905,0.1586629,0.001663393,0.0008425049],"study_design_scores_gemma":[0.0002291022,0.000008572278,0.001770872,0.00002156957,0.000002912331,3.31448e-7,0.0003441564,0.9918988,0.00006115522,0.0006745743,0.004916969,0.00007095445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.535714,0.0000720993,0.4495085,0.002342361,0.0002529455,0.0009734762,0.000001965283,0.00003093353,0.0111038],"genre_scores_gemma":[0.9986101,0.00001748233,0.0006608213,0.0003324994,0.00006502044,0.00008685535,0.00001625993,0.000006048387,0.0002049394],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4628961,"threshold_uncertainty_score":0.2702872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3028512226","doi":"10.1016/j.cor.2020.104987","title":"A review of vehicle routing with simultaneous pickup and delivery","year":2020,"lang":"en","type":"review","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":200,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada","keywords":"Pickup; Vehicle routing problem; Computer science; Routing (electronic design automation); Destinations; Operations research; Tourism; Artificial intelligence; Computer network; Mathematics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.08792970271494478,"gpt":0.389522005941624,"spread":0.3015923032266792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014775,0.000279126,0.001102412,0.0002542946,0.0001885186,0.000126486,0.0003839687,0.0001331288,0.00001995193],"category_scores_gemma":[0.0004584323,0.0002390256,0.0001005529,0.00130621,0.0001232337,0.0001035233,0.0002343751,0.000806757,0.00002276364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001465578,"about_ca_system_score_gemma":0.0003304315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001783853,"about_ca_topic_score_gemma":0.000005450889,"domain_scores_codex":[0.9975621,0.0007181827,0.0006278006,0.0003781024,0.0003855003,0.0003283914],"domain_scores_gemma":[0.9977608,0.001188713,0.00004277218,0.0004144952,0.0004367672,0.00015646],"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.000001071138,0.00001010878,5.097262e-7,0.06225529,0.0001023141,0.00002397953,0.0001112617,0.07658615,0.000001718668,0.00005513645,0.000429479,0.860423],"study_design_scores_gemma":[0.00009535612,0.00006782075,1.515512e-7,0.07151508,0.0000943617,0.00004403157,0.00001136979,0.5729504,0.000002292697,4.801502e-7,0.3550119,0.0002067825],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000004934684,0.9303172,0.06826449,0.00005652573,0.00005561913,0.0009856398,0.00001971133,0.0001297183,0.0001661193],"genre_scores_gemma":[0.00004012961,0.9187071,0.08089682,0.00004385307,0.00008957963,0.0000619726,0.00005186702,0.00008031903,0.00002836558],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.8602162,"threshold_uncertainty_score":0.9747183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147424049","doi":"10.1016/j.cor.2009.02.017","title":"An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":196,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Pickup; Computer science; Ant colony optimization algorithms; Benchmark (surveying); Mathematical optimization; Ant colony; Routing (electronic design automation); Backhaul (telecommunications); Combinatorial optimization; Algorithm; Artificial intelligence; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03016327053796509,"gpt":0.3280864310040777,"spread":0.2979231604661126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101688,0.0001447025,0.0001855537,0.0001925281,0.0006185542,0.0004274444,0.0002245211,0.00007948201,0.000001845698],"category_scores_gemma":[0.0000664725,0.0001370273,0.00001891469,0.0004360451,0.00006120745,0.0002761091,0.00003587833,0.0002537264,0.000004443996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001957778,"about_ca_system_score_gemma":0.00007839728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003353918,"about_ca_topic_score_gemma":0.00003366094,"domain_scores_codex":[0.9985,0.0002260881,0.000250791,0.0003169639,0.0002693224,0.0004367604],"domain_scores_gemma":[0.9985937,0.000456728,0.00001238346,0.0002914768,0.0004893797,0.0001563294],"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.00002219698,0.0000316518,0.0000872303,0.00006400402,0.00001734434,0.00001187432,0.0008004471,0.971566,0.006483746,0.001193152,0.00009674091,0.01962561],"study_design_scores_gemma":[0.0005419215,0.000493776,0.0001924568,0.0001095134,0.000007740578,0.00002839851,0.0003557215,0.9966338,0.001327676,0.000008067077,0.0001320763,0.0001688502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3867861,0.00008303883,0.6116604,0.0001467291,0.00004714081,0.0007726507,0.000007956422,0.0003350714,0.0001609108],"genre_scores_gemma":[0.700743,0.000009904606,0.2990146,0.0000260592,0.00008495041,0.0000406266,0.00001707341,0.00002613358,0.00003760422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3139569,"threshold_uncertainty_score":0.5587809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112496246","doi":"10.1016/j.cor.2005.02.033","title":"Variable neighborhood search and local branching","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":188,"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":"Variable neighborhood search; Solver; Mathematical optimization; Integer programming; Local search (optimization); Branching (polymer chemistry); Heuristic; Variable (mathematics); Mathematics; Limit (mathematics); Set (abstract data type); Black box; Computer science; Integer (computer science); Metaheuristic; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03926352547568592,"gpt":0.3419667686314819,"spread":0.302703243155796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418892,0.0001114175,0.0001311628,0.0002849891,0.0004617275,0.0003614918,0.0002279667,0.00007971557,0.000100501],"category_scores_gemma":[0.00007011373,0.0001197752,0.00001861349,0.0006764043,0.0001125965,0.0003516903,0.0001577453,0.0005445659,0.00007831847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001400643,"about_ca_system_score_gemma":0.0000787235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004765474,"about_ca_topic_score_gemma":0.0000239383,"domain_scores_codex":[0.9984638,0.0002917963,0.0002094741,0.0002439348,0.000349728,0.0004412492],"domain_scores_gemma":[0.9990903,0.0002529162,0.000002541975,0.0002812564,0.0002109986,0.0001620523],"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.000001662162,0.00001654359,0.00006827213,0.00001957755,0.00001434376,0.000001298828,0.0005276622,0.903918,0.001136551,0.007522419,0.0005608739,0.08621283],"study_design_scores_gemma":[0.0002728001,0.00002455361,0.0002468028,0.00002696328,0.000002161937,0.00001349618,0.00008378068,0.9960055,0.001049471,0.00005753802,0.002095085,0.0001217983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02429489,0.0003222674,0.9709393,0.0005627503,0.0001124923,0.000220524,0.000003409033,0.0002342645,0.003310087],"genre_scores_gemma":[0.603884,0.00004327923,0.3956022,0.00005146588,0.0001886861,0.00001441902,0.000008377452,0.00002742235,0.0001802425],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5795891,"threshold_uncertainty_score":0.4884293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965882376","doi":"10.1016/j.cor.2013.08.016","title":"An adaptive large neighborhood search for a vehicle routing problem with multiple routes","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":183,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Benchmark (surveying); Routing (electronic design automation); Mathematical optimization; Operations research; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04793811169959512,"gpt":0.336181081294404,"spread":0.2882429695948089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014687,0.0002007432,0.0002169537,0.0003039767,0.0008240563,0.000689914,0.0004556966,0.0001036625,0.00005465869],"category_scores_gemma":[0.00008252114,0.0001851118,0.00004464507,0.0008439549,0.00008453708,0.0008378802,0.000114887,0.0004897107,0.00007013651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001795378,"about_ca_system_score_gemma":0.000139456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001963931,"about_ca_topic_score_gemma":0.0001196211,"domain_scores_codex":[0.9975067,0.000417494,0.0003056149,0.000431734,0.0004627664,0.0008756579],"domain_scores_gemma":[0.9975402,0.0006007504,0.00001198649,0.0004800002,0.001119235,0.000247825],"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.00001777218,0.0001082192,0.002466532,0.00003521291,0.0000502951,0.000001452095,0.001888228,0.9772924,0.004341219,0.003312479,0.0003954449,0.01009071],"study_design_scores_gemma":[0.001017229,0.0004093767,0.001638286,0.00005469389,0.000005056457,0.000003708505,0.000904181,0.9921572,0.003434119,0.00004616905,0.00009431607,0.0002356498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1188532,0.00004093297,0.8780819,0.0002758596,0.00005830807,0.001823069,0.00002521274,0.0003902231,0.0004512836],"genre_scores_gemma":[0.6203949,0.000003955485,0.3788465,0.00002681916,0.0001135337,0.0004345996,0.0000472672,0.00006067277,0.00007172761],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5015417,"threshold_uncertainty_score":0.7548641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085504249","doi":"10.1016/j.cor.2014.09.002","title":"An integrated approach for sustainable supply chain planning","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":182,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Centre de Géomatique du Québec","funders":"","keywords":"Supply chain; Sustainability; Computer science; Compromise; Goal programming; Decision maker; Set (abstract data type); Operations research; Sustainable development; Management science; Industrial engineering; Mathematical optimization; Business; Economics; Engineering; Mathematics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.0421291872258303,"gpt":0.3249645183768062,"spread":0.2828353311509759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004214937,0.0002371574,0.0002472771,0.001424215,0.001619499,0.002852124,0.0009748813,0.00009339857,0.0000732215],"category_scores_gemma":[0.0005942147,0.0002284306,0.0000719265,0.001680131,0.0001494889,0.001991756,0.0005001103,0.0003556507,0.00005542443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002391365,"about_ca_system_score_gemma":0.0001107948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001513493,"about_ca_topic_score_gemma":0.0000361095,"domain_scores_codex":[0.9971716,0.0001569062,0.0003220454,0.0006718598,0.0005625952,0.001115038],"domain_scores_gemma":[0.9971288,0.0001869227,0.00003542705,0.0006858967,0.001910869,0.00005204593],"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.00007461754,0.0003274608,0.0009539177,0.0005350314,0.00004348397,0.00001913126,0.0004332253,0.5383584,0.00009591078,0.3776256,0.06953578,0.01199741],"study_design_scores_gemma":[0.0006288835,0.00007144145,0.0003173767,0.00002030686,0.000009825553,7.646523e-7,0.009754643,0.7841863,0.00002071593,0.001263356,0.2035009,0.0002254801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02363055,0.00004371555,0.960751,0.001602729,0.0001503104,0.002464325,0.00000206304,0.0002937816,0.0110615],"genre_scores_gemma":[0.9534232,0.000001550923,0.03696615,0.001099587,0.001663885,0.0009162469,0.0008364054,0.0000758126,0.005017176],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9297926,"threshold_uncertainty_score":0.9996803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2883994353","doi":"10.1016/j.cor.2018.07.012","title":"The green mixed fleet vehicle routing problem with partial battery recharging and time windows","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":180,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Computer science; Battery (electricity); Heuristic; Routing (electronic design automation); Automotive engineering; Set (abstract data type); Electric vehicle; Mathematical optimization; Computer network; Engineering; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03899741903171219,"gpt":0.3164298293842097,"spread":0.2774324103524975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002144519,0.0001374402,0.0001352145,0.0001344501,0.001420559,0.0005758553,0.0002916477,0.00006256992,0.00002440614],"category_scores_gemma":[0.00008282862,0.0001057917,0.00001895345,0.0005884205,0.0002809376,0.0002548965,0.0001856555,0.0003831287,0.00008882641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008196265,"about_ca_system_score_gemma":0.00006627751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000545759,"about_ca_topic_score_gemma":0.00005939688,"domain_scores_codex":[0.9981188,0.0004912192,0.0002479602,0.0002795714,0.0003492359,0.0005131907],"domain_scores_gemma":[0.9987172,0.0004737813,0.00001321909,0.0003553481,0.0003233737,0.0001170499],"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.00004891303,0.00003435173,0.001417921,0.00004737382,0.0001359726,0.00001110263,0.004355893,0.8725861,0.01557136,0.001583834,0.004564947,0.09964218],"study_design_scores_gemma":[0.0003137474,0.00009944688,0.0004180217,0.00006091483,0.000004916207,0.00001353855,0.00009409266,0.9930533,0.003717206,0.00002698064,0.002058788,0.0001390674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3244306,0.0001215764,0.6687433,0.002941015,0.0002404402,0.0009185484,0.000006057302,0.0004740666,0.002124418],"genre_scores_gemma":[0.8151373,0.00002302471,0.1832934,0.00006586605,0.0005530437,0.00008337942,0.00001268455,0.00006817077,0.0007631789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4907067,"threshold_uncertainty_score":0.9998795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006750788","doi":"10.1016/j.cor.2005.03.008","title":"Assessing performance and uncertainty in developing carpet reverse logistics systems","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":174,"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":"Reverse logistics; Incentive; Memorandum; Computer science; Supply chain; Government (linguistics); Variable (mathematics); Operations research; Business; Environmental economics; Economics; Marketing; Engineering; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.09024852783511896,"gpt":0.350061384722287,"spread":0.2598128568871681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001997648,0.0001420396,0.0001701806,0.0008917896,0.0006443951,0.002201996,0.0003162224,0.00005456245,0.00001753542],"category_scores_gemma":[0.0002059063,0.0001425051,0.00001660477,0.00114363,0.0001314542,0.001979986,0.000599875,0.000299686,0.0000773248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004888788,"about_ca_system_score_gemma":0.0001286778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002199248,"about_ca_topic_score_gemma":0.0006089151,"domain_scores_codex":[0.9982814,0.00007759402,0.0003114661,0.0003638589,0.0004382255,0.0005275129],"domain_scores_gemma":[0.9990467,0.0001227102,0.00002867558,0.0002748183,0.0005073727,0.00001966246],"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.000007212088,0.00003842016,0.004962202,0.0004183922,0.00001203165,0.00003236471,0.0002094556,0.9284627,0.00001690298,0.04262921,0.007400641,0.01581046],"study_design_scores_gemma":[0.0003330949,0.000006153676,0.004661901,0.0001582874,0.000004202514,0.000002364168,0.002639472,0.8879375,0.000002380744,0.00004708008,0.1040394,0.0001680886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8932788,0.0003065298,0.08402744,0.01150111,0.0005838609,0.001580135,0.000001326854,0.0001579096,0.008562878],"genre_scores_gemma":[0.9926924,0.00006416428,0.005147354,0.0007043192,0.0007038864,0.0000758497,0.00003012095,0.00002005125,0.000561872],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09941357,"threshold_uncertainty_score":0.9988338,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024143101","doi":"10.1016/j.cor.2006.05.014","title":"A graph coloring heuristic using partial solutions and a reactive tabu scheme","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Tabu search; Graph coloring; Heuristics; Greedy coloring; List coloring; Computer science; Benchmark (surveying); Mathematics; Heuristic; Fractional coloring; Graph; Algorithm; Combinatorics; Mathematical optimization; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.4308289758627579,"gpt":0.4947675758842449,"spread":0.06393860002148699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004676559,0.0001415145,0.00023766,0.0009962049,0.002916445,0.001280026,0.0004679478,0.00008747549,0.00005267847],"category_scores_gemma":[0.002292549,0.0001265008,0.00008536682,0.002568219,0.00056538,0.0004886162,0.0003949373,0.000478487,0.000144434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001218695,"about_ca_system_score_gemma":0.0003965509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001893067,"about_ca_topic_score_gemma":0.0004089366,"domain_scores_codex":[0.9961948,0.000653937,0.0005176909,0.0006542543,0.001275655,0.0007036017],"domain_scores_gemma":[0.9963014,0.001677396,0.00004070884,0.00056338,0.001223308,0.0001938569],"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.0000991214,0.0008671938,0.01263016,0.00001494165,0.0001568361,0.00007665722,0.001949626,0.6473322,0.04554032,0.2670789,0.01661672,0.007637321],"study_design_scores_gemma":[0.0004068034,0.00006776687,0.005601181,0.00003263626,0.00001382414,0.000040914,0.0003767857,0.9816648,0.0004448028,0.008035148,0.003130435,0.0001848613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6645482,0.000398279,0.3325284,0.001201178,0.0003246268,0.0003008701,0.0000189477,0.00006713056,0.0006124316],"genre_scores_gemma":[0.9415776,0.00001028685,0.05746266,0.00002954872,0.0003301121,0.00004424182,0.00001019007,0.00001350429,0.0005218933],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3343327,"threshold_uncertainty_score":0.9997568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975774078","doi":"10.1016/j.cor.2014.08.014","title":"A two level metaheuristic for the operating room scheduling and assignment problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":170,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Time horizon; Computer science; Scheduling (production processes); Mathematical optimization; Metaheuristic; Job shop scheduling; Operations research; Artificial intelligence; Mathematics; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.3131475908905606,"gpt":0.5271075438563544,"spread":0.2139599529657938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.007409239,0.0001687673,0.0002479812,0.0001993108,0.008773169,0.0003697856,0.0003171774,0.000120288,0.00005714946],"category_scores_gemma":[0.001581527,0.0001196419,0.0000450677,0.0004489085,0.0001153311,0.0002383935,0.0002537236,0.000903915,0.00005206509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001850163,"about_ca_system_score_gemma":0.0007208048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007631888,"about_ca_topic_score_gemma":0.0008943803,"domain_scores_codex":[0.9958645,0.001859347,0.0006545602,0.0004764047,0.0004473233,0.0006978341],"domain_scores_gemma":[0.9941316,0.003748958,0.00004502036,0.0004747741,0.001392538,0.0002070871],"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.0000223149,0.00008800481,0.00130994,0.0002076027,0.00006896357,7.181932e-7,0.005974906,0.8232064,0.0009861339,0.1312365,0.002194637,0.03470389],"study_design_scores_gemma":[0.0009023704,0.0001516116,0.0006218219,0.0001610564,0.00001578799,0.000002175634,0.001664457,0.9901227,0.00003674508,0.000280593,0.005901298,0.0001393948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01984432,0.0002481513,0.958626,0.01687333,0.0003907635,0.003303165,0.0000217883,0.00006384514,0.0006286007],"genre_scores_gemma":[0.5825607,0.00007298048,0.4131169,0.0008292793,0.0005947325,0.001562658,0.00006061672,0.0000336594,0.001168533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5627164,"threshold_uncertainty_score":0.9925173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016268962","doi":"10.1016/j.cor.2003.11.016","title":"Hub-and-spoke network design with congestion","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":168,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Spoke-hub distribution paradigm; Network planning and design; Computer science; Mathematical optimization; Heuristic; Term (time); Function (biology); Network model; Operations research; Mathematics; Computer network; Artificial intelligence; Transport engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07669300078247837,"gpt":0.3428464463994623,"spread":0.266153445616984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001059016,0.0001046212,0.0001121228,0.0001488513,0.00039442,0.0002368406,0.0001450923,0.00006375989,0.00001399045],"category_scores_gemma":[0.00005678651,0.00009847085,0.00001227527,0.0006276026,0.0001079039,0.0001840322,0.00005127295,0.0003166429,0.00003111344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001228628,"about_ca_system_score_gemma":0.00008767714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002551162,"about_ca_topic_score_gemma":0.00002491592,"domain_scores_codex":[0.9988139,0.0002426434,0.0001485861,0.0001982615,0.0002596242,0.0003370167],"domain_scores_gemma":[0.9992342,0.0002061716,0.00000497566,0.0002219849,0.000221374,0.000111278],"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.000006237966,0.00001017795,0.00006216154,0.00001232877,0.00001392726,0.000005553439,0.0002765063,0.990916,0.0002273996,0.003215274,0.0003972587,0.004857231],"study_design_scores_gemma":[0.000486655,0.0001091618,0.0008844936,0.00007396161,0.000004691274,0.00002349509,0.00003203201,0.9971631,0.0006158667,0.0001920653,0.0002786267,0.0001358651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01946427,0.000190382,0.9788409,0.000460818,0.0001181228,0.0003682292,9.450674e-7,0.0002518526,0.0003044882],"genre_scores_gemma":[0.3697007,0.00006878149,0.6299435,0.00003165852,0.0001211334,0.00003956781,0.000008135486,0.00002699501,0.00005946034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3502364,"threshold_uncertainty_score":0.4015524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032765916","doi":"10.1016/j.cor.2004.02.007","title":"Allocation of shared costs among decision making units: a DEA approach","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":166,"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; Cost allocation; Operations research; Activity-based costing; Resource allocation; Equity (law); Computer science; Set (abstract data type); Environmental economics; Management science; Economics; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2123555918820652,"gpt":0.46878453565144,"spread":0.2564289437693749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008076263,0.0001545674,0.0003274726,0.001896021,0.0008691058,0.001038153,0.001850108,0.0001178744,0.00007387134],"category_scores_gemma":[0.006795158,0.0001269493,0.0001031271,0.008952458,0.0004199045,0.0007690634,0.0005364872,0.0004007241,0.0001779671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004822297,"about_ca_system_score_gemma":0.0006626283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000525255,"about_ca_topic_score_gemma":0.0007023599,"domain_scores_codex":[0.9935168,0.0007793144,0.0009651612,0.0007718254,0.003523429,0.0004434614],"domain_scores_gemma":[0.9922414,0.001910151,0.00009869767,0.001254631,0.004354477,0.0001406802],"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.0000256214,0.0002810595,0.0014479,0.000005480211,0.00002498876,0.000006041267,0.002140098,0.9228534,0.0008718872,0.009722274,0.001924474,0.06069679],"study_design_scores_gemma":[0.0006086493,0.0001357186,0.0158017,0.0002388466,0.00001190424,0.000009819385,0.001418735,0.9771981,0.0006478605,0.0032008,0.0005163035,0.0002115737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4085789,0.0001073984,0.5893309,0.0003628581,0.00009946425,0.0003328921,0.000007584979,0.0000271515,0.001152871],"genre_scores_gemma":[0.8967462,0.000009763483,0.1028931,0.00005473524,0.00005670465,0.00002975334,0.00003050083,0.00001437461,0.0001649296],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4881672,"threshold_uncertainty_score":0.9999989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165941447","doi":"10.1016/j.cor.2012.04.003","title":"Lower and upper bounds for the two-echelon capacitated location-routing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":166,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Heuristics; Mathematical optimization; Computer science; Vehicle routing problem; Heuristic; Upper and lower bounds; Branch and bound; Routing (electronic design automation); Set (abstract data type); Neighbourhood (mathematics); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07168323218806766,"gpt":0.3734654080494779,"spread":0.3017821758614102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002508827,0.0001188597,0.0001092017,0.0001584026,0.0008930481,0.0003700337,0.000209911,0.00006287257,0.0000188641],"category_scores_gemma":[0.000265487,0.00009791114,0.00002805122,0.0006466915,0.000129513,0.0003459399,0.00008323182,0.0003148741,0.00002141965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001188488,"about_ca_system_score_gemma":0.00005801924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000503619,"about_ca_topic_score_gemma":0.00001910493,"domain_scores_codex":[0.9986535,0.0002027788,0.0002312925,0.000173253,0.0002397548,0.0004994661],"domain_scores_gemma":[0.9982516,0.0008532175,0.000009524396,0.0002922952,0.0004824128,0.000110976],"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.000004798086,0.00003042627,0.0006818323,0.0000453085,0.00004811453,1.774881e-7,0.003047946,0.9700231,0.001518198,0.006837207,0.002137025,0.01562587],"study_design_scores_gemma":[0.0002949612,0.00002416525,0.0008328829,0.00003188168,0.00000818542,0.0000066593,0.0002826512,0.9946434,0.0006509349,0.00004342612,0.003058378,0.0001224509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03701491,0.0006217326,0.9595526,0.0008397704,0.0004091489,0.0008115924,0.000005032779,0.0001765969,0.0005686469],"genre_scores_gemma":[0.7477053,0.00003193211,0.251486,0.00005166091,0.0002446765,0.0001761679,0.00001706543,0.00003611097,0.0002511448],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7106904,"threshold_uncertainty_score":0.6868694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067884717","doi":"10.1016/j.cor.2005.07.004","title":"Scheduling and routing of automated guided vehicles: A hybrid approach","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":161,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Integer programming; Job shop scheduling; Routing (electronic design automation); Constraint programming; Distributed computing; Algorithm; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05043721699695757,"gpt":0.3291782384169027,"spread":0.2787410214199451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357919,0.00009741656,0.0001435648,0.0002703429,0.0002327686,0.0001562244,0.0001730919,0.00004711884,0.000009268195],"category_scores_gemma":[0.00009429474,0.0001011691,0.00002521391,0.000448765,0.00008610155,0.00018076,0.00008069667,0.0002461005,0.00001532861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005961765,"about_ca_system_score_gemma":0.00004955664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002032141,"about_ca_topic_score_gemma":0.000002242801,"domain_scores_codex":[0.998919,0.00008267311,0.0002836625,0.000189306,0.0002624297,0.0002629057],"domain_scores_gemma":[0.99933,0.00009233467,0.000008957865,0.0002062878,0.0002688313,0.00009358231],"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.000001168973,0.00002572172,0.00004160487,0.00002574275,0.000020911,8.218577e-7,0.0006153305,0.9896868,0.001174725,0.0003658395,0.0003818873,0.007659432],"study_design_scores_gemma":[0.0003080133,0.00001506694,0.00009446499,0.00003993394,0.000003152611,0.00001509772,0.0002010342,0.9952956,0.003846264,0.000003945515,0.00007889995,0.00009850886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4336124,0.0003835028,0.5641868,0.0001880046,0.0000763501,0.0002152748,0.000004415062,0.0005569484,0.0007763245],"genre_scores_gemma":[0.578446,0.00003413822,0.4213553,0.00001363444,0.00007672125,0.00001155558,0.00001609076,0.00001527709,0.00003123048],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1448336,"threshold_uncertainty_score":0.4125556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155293443","doi":"10.1016/j.cor.2013.08.010","title":"A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":160,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Benchmark (surveying); Vehicle routing problem; Heuristic; Computer science; Mathematical optimization; Variable (mathematics); Variable neighborhood search; Ant colony optimization algorithms; Algorithm; Routing (electronic design automation); Metaheuristic; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03028985025965375,"gpt":0.2943681629263528,"spread":0.264078312666699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001876893,0.000200679,0.000216173,0.0001963322,0.001152251,0.0008600499,0.0005909062,0.00006329152,0.0001616735],"category_scores_gemma":[0.0003085537,0.0001524418,0.00004598447,0.0007970293,0.0001338072,0.000390869,0.0001834995,0.0005794124,0.0002312158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001666541,"about_ca_system_score_gemma":0.0001922602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002424476,"about_ca_topic_score_gemma":0.00001167202,"domain_scores_codex":[0.9976072,0.0003610522,0.0003399272,0.000376298,0.0005121226,0.0008033537],"domain_scores_gemma":[0.9962227,0.002112241,0.00001456331,0.0005772913,0.00090787,0.0001652988],"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.000009341153,0.00004054322,0.0002462963,0.0000454807,0.0000675521,0.000001385929,0.0004798072,0.9843534,0.003224608,0.0007821207,0.002880949,0.007868571],"study_design_scores_gemma":[0.000763701,0.0001131308,0.0003987081,0.00006050945,0.0000109784,0.00001262973,0.0001185846,0.9964517,0.001259858,0.0000786027,0.0005360142,0.000195627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0215942,0.00009509768,0.9735874,0.000743091,0.00009516264,0.002702063,0.00002079939,0.0003174507,0.0008447162],"genre_scores_gemma":[0.6447034,0.000009417459,0.3535389,0.00005072931,0.0001876026,0.0007305302,0.00004048554,0.00008038732,0.0006585717],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6231092,"threshold_uncertainty_score":0.8862299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109358143","doi":"10.1016/j.cor.2005.06.007","title":"Designing a road network for hazardous materials shipments","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":142,"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":"Integer programming; Heuristic; Network planning and design; Computer science; Hazardous waste; Routing (electronic design automation); Mathematical optimization; Flow network; Tree (set theory); Steiner tree problem; Path (computing); Population; Integer (computer science); Operations research; Mathematics; Algorithm; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.2847460286634574,"gpt":0.4949486671316858,"spread":0.2102026384682285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01003624,0.000123782,0.0003061196,0.000452308,0.001604831,0.001703053,0.001098403,0.00007952402,0.0004652202],"category_scores_gemma":[0.001153089,0.00009706318,0.0001254317,0.001379086,0.0001242146,0.0004766752,0.0002747551,0.0001678515,0.0009641738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001041997,"about_ca_system_score_gemma":0.0001965663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000115029,"about_ca_topic_score_gemma":0.0003639257,"domain_scores_codex":[0.9957436,0.0009354593,0.0006828345,0.0005590826,0.001465262,0.0006137335],"domain_scores_gemma":[0.9967444,0.001358418,0.00003892074,0.0006595671,0.001026641,0.0001720697],"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.00006558792,0.00008390216,0.0002316968,0.000002546748,0.00006211896,0.000004163525,0.0009851928,0.5276886,0.003434308,0.002348487,0.1181901,0.3469033],"study_design_scores_gemma":[0.001066728,0.000261271,0.002992062,0.00005037919,0.0000238466,0.000009598848,0.000657161,0.8545333,0.007962136,0.009325472,0.1227233,0.0003947704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1124648,0.0002841041,0.87507,0.01016342,0.0004471091,0.0008135109,0.00002620236,0.00004863665,0.0006821761],"genre_scores_gemma":[0.7578488,0.00007694794,0.2357492,0.0002956587,0.001070321,0.0001580718,0.00003698242,0.0000164026,0.004747614],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.645384,"threshold_uncertainty_score":0.9998137,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2973520255","doi":"10.1016/j.cor.2019.104806","title":"Crowd-shipping with time windows and transshipment nodes","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Transshipment (information security); Computer science; Operations research; Mathematics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03980411229667775,"gpt":0.2556619331662713,"spread":0.2158578208695935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002157471,0.0001049454,0.0001264034,0.000146215,0.0001468219,0.0001609677,0.0001430262,0.00004712756,0.0001410095],"category_scores_gemma":[0.000002727156,0.00009007855,0.00001705898,0.0002234232,0.0001024476,0.0001329509,0.00001642087,0.0002693326,0.0001949637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004692872,"about_ca_system_score_gemma":0.00003482012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001911674,"about_ca_topic_score_gemma":0.00003727877,"domain_scores_codex":[0.9991242,0.00003517358,0.0001258593,0.0001858246,0.0002426193,0.0002863358],"domain_scores_gemma":[0.9995421,0.00007188446,0.00000210658,0.0002054138,0.00008163485,0.00009685598],"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.00003521578,0.00008455923,0.007088983,0.0002308055,0.0001590606,0.00004769372,0.0026138,0.958256,0.01624903,0.006657672,0.002089296,0.006487872],"study_design_scores_gemma":[0.0006952551,0.0001489187,0.008750957,0.00009400544,0.000008803442,0.00001328781,0.00007300935,0.9841323,0.001343606,0.00003184799,0.004465834,0.0002421431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7641735,0.0006034125,0.2234202,0.0003275327,0.000163526,0.0007682305,0.00001789145,0.0002543218,0.01027135],"genre_scores_gemma":[0.9907889,0.00005049815,0.008205012,0.00002574075,0.00005151488,0.00001898976,0.00002836363,0.0000244521,0.0008065637],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2266154,"threshold_uncertainty_score":0.3673296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082287477","doi":"10.1016/j.cor.2008.05.008","title":"Online banking performance evaluation using data envelopment analysis and principal component analysis","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":131,"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":"Data envelopment analysis; Principal component analysis; Ranking (information retrieval); Revenue; Computer science; The Internet; Strengths and weaknesses; Identification (biology); Business; Statistics; Mathematics; Finance; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.5396370484147243,"gpt":0.530300814290691,"spread":0.009336234124033282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01743867,0.0001950862,0.000581136,0.0054656,0.002509702,0.0008127132,0.001958403,0.00007574516,0.0003001024],"category_scores_gemma":[0.001355381,0.0001625094,0.0001676433,0.01833745,0.0004779218,0.000871306,0.001695832,0.0003803661,0.00004485609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003137211,"about_ca_system_score_gemma":0.0006139659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006942526,"about_ca_topic_score_gemma":0.001782785,"domain_scores_codex":[0.9898363,0.001732712,0.00106266,0.001363681,0.005496198,0.0005084613],"domain_scores_gemma":[0.9939253,0.001066655,0.0001139178,0.002338067,0.002354129,0.000201871],"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.000007328846,0.000211041,0.07521104,0.000001605655,0.0009324706,0.000006907482,0.001135937,0.9022782,0.0002956805,0.0000331087,0.0001084,0.01977826],"study_design_scores_gemma":[0.0001617864,0.00002248255,0.2512296,0.000006656833,0.0006294341,0.00000679502,0.000159071,0.7472928,0.00006123988,0.0000106588,0.0002854363,0.000134059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7498838,0.000175756,0.24914,0.0003607564,0.00006737814,0.0002632048,0.0000293098,0.00001946669,0.00006030784],"genre_scores_gemma":[0.9438168,0.0001152277,0.05523505,0.00005617862,0.00007863426,0.000009498718,0.000553611,0.00000891806,0.0001260497],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.193933,"threshold_uncertainty_score":0.9987889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2767831630","doi":"10.1016/j.cor.2017.11.003","title":"Vehicle routing with backhauls: Review and research perspectives","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Vehicle routing problem; Computer science; Heuristic; Operations research; Routing (electronic design automation); Computer network; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1181276913360964,"gpt":0.4402640823587854,"spread":0.3221363910226891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004563233,0.000136791,0.0002279124,0.0002581479,0.002526117,0.001100419,0.0006177659,0.00006634674,0.00005597669],"category_scores_gemma":[0.0008950101,0.0001237082,0.00002430607,0.0004723991,0.0005368098,0.000521062,0.0003862545,0.0008674187,0.00005473239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001554243,"about_ca_system_score_gemma":0.0001052435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009265367,"about_ca_topic_score_gemma":0.0000518589,"domain_scores_codex":[0.9975834,0.0006493636,0.0002134828,0.000395993,0.0005992992,0.0005583994],"domain_scores_gemma":[0.9974689,0.0003801957,0.00001392466,0.0009142062,0.001051428,0.0001713128],"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.00005339558,0.0003363143,0.006626955,0.003258923,0.0005452791,0.0001381213,0.02130203,0.7061805,0.006004811,0.0340427,0.0482851,0.1732259],"study_design_scores_gemma":[0.0005087563,0.0001370305,0.005304985,0.001033199,0.00001597534,0.00002804259,0.001036471,0.9885,0.0005640351,0.00006065959,0.002520906,0.0002899307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3061931,0.06608635,0.5371982,0.03163991,0.0005433067,0.006015564,0.00003588043,0.001376904,0.05091077],"genre_scores_gemma":[0.8733437,0.005580322,0.1198529,0.00005153166,0.0001896764,0.0001059928,0.000006407485,0.00006619948,0.0008032752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5671506,"threshold_uncertainty_score":0.9999365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000702178","doi":"10.1016/j.cor.2007.01.007","title":"The single vehicle routing problem with deliveries and selective pickups","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Heuristics; Pickup; Mathematical optimization; Computer science; Vehicle routing problem; Tabu search; Vertex (graph theory); Routing (electronic design automation); Integer programming; Mathematics; Graph; Theoretical computer science; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03535149278004031,"gpt":0.3189383663021784,"spread":0.2835868735221381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001878795,0.0001008823,0.00009009791,0.0001212969,0.00116565,0.0004361868,0.0001714627,0.00004630113,0.000002707641],"category_scores_gemma":[0.0001002263,0.00007668763,0.00001265545,0.0006947878,0.0002030628,0.0002033756,0.00009469709,0.0003558612,0.000005313149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001438118,"about_ca_system_score_gemma":0.00005065815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005332753,"about_ca_topic_score_gemma":0.0004310086,"domain_scores_codex":[0.9987288,0.0001757402,0.0001867683,0.0001886304,0.0002871339,0.0004329127],"domain_scores_gemma":[0.9986473,0.0006514496,0.000008431774,0.0001910705,0.0004135656,0.00008819912],"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.00002388264,0.00002728805,0.001497722,0.0000192022,0.0000536134,0.00000682663,0.003585364,0.9111179,0.006021969,0.003467273,0.0004497743,0.07372919],"study_design_scores_gemma":[0.0002886055,0.0001566436,0.003947477,0.00004015699,0.000004334072,0.00001984553,0.0006894424,0.9850713,0.008334643,0.00005144786,0.001245822,0.0001502936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2520946,0.0002172786,0.7447394,0.0003394475,0.00006118256,0.0003688334,0.000001422199,0.0001965093,0.001981328],"genre_scores_gemma":[0.8278823,0.00003035574,0.1718179,0.00001723328,0.00006878545,0.00001789881,0.000002924629,0.00002620506,0.0001363594],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5757878,"threshold_uncertainty_score":0.8965353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997368401","doi":"10.1016/j.cor.2015.03.014","title":"Multi-period Vehicle Routing Problem with Due dates","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Flexibility (engineering); Operations research; Computer science; Routing (electronic design automation); Total cost; Service (business); Mathematical optimization; Transport engineering; Operations management; Business; Mathematics; Economics; Engineering; Statistics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1381227408269031,"gpt":0.3090276518905967,"spread":0.1709049110636936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003805227,0.0001173979,0.00012927,0.0001325463,0.0002272539,0.0002349031,0.0002584297,0.00005366932,0.00001588549],"category_scores_gemma":[0.00001932301,0.00009952138,0.00001814097,0.0004156195,0.0001343132,0.0001961281,0.00004442093,0.0003544707,0.0001211849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009823547,"about_ca_system_score_gemma":0.0001081566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001105044,"about_ca_topic_score_gemma":0.0002969524,"domain_scores_codex":[0.9988765,0.00005367269,0.0001728685,0.0001997304,0.0003148891,0.0003823421],"domain_scores_gemma":[0.9991874,0.00003611636,0.000003871714,0.0002741167,0.0003070813,0.0001914767],"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.0000128996,0.0001117828,0.002132126,0.00004381538,0.00006181427,0.0001270603,0.002876078,0.9794711,0.002632605,0.003000329,0.007168378,0.00236198],"study_design_scores_gemma":[0.0005930002,0.00009959538,0.001134835,0.00003660021,0.000004654078,0.00001642097,0.0002677618,0.9925674,0.0006635293,0.00001418388,0.004442013,0.0001599756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1396445,0.0004867809,0.8527956,0.000569278,0.0002778878,0.0007069666,0.00003534396,0.0005953313,0.004888363],"genre_scores_gemma":[0.8947593,0.000009931259,0.1046413,0.00002116043,0.0001040705,0.00003677468,0.00007038138,0.00003160859,0.0003254741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7551149,"threshold_uncertainty_score":0.4058364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001465411","doi":"10.1016/j.cor.2004.07.006","title":"A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"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; Polytechnique Montréal","funders":"","keywords":"Snow removal; Truck; Snow; Plough; Sizing; Computer science; Routing (electronic design automation); Transport engineering; Operations research; Algorithm; Meteorology; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1965205224219625,"gpt":0.3830293397612984,"spread":0.1865088173393359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002999371,0.0001049944,0.0002176053,0.0001882755,0.0002407758,0.0001534084,0.0001225464,0.00006262261,5.593766e-7],"category_scores_gemma":[0.0002396773,0.0001055773,0.00002729256,0.000234012,0.00006678712,0.0002263337,0.00005937216,0.0001102714,3.656847e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001196273,"about_ca_system_score_gemma":0.0000614552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009690196,"about_ca_topic_score_gemma":0.0000267838,"domain_scores_codex":[0.9988375,0.0002057149,0.0002792091,0.000231345,0.0001454291,0.0003007466],"domain_scores_gemma":[0.9985706,0.0006866995,0.00001167438,0.0001675021,0.0004817302,0.00008175075],"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.00001332255,0.000008816846,0.00002701939,0.0001725227,0.00003457834,4.757357e-7,0.0006336535,0.9906132,0.0004211901,0.0009252623,0.0001774764,0.006972528],"study_design_scores_gemma":[0.000772675,0.00008807142,0.000195476,0.0002663431,0.000006034368,0.000005577885,0.000133119,0.9969997,0.001329408,0.00008173277,0.00001953301,0.0001023152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01878899,0.0002259077,0.9796063,0.00006664694,0.0001361087,0.001035795,0.00003916915,0.00007621044,0.00002490381],"genre_scores_gemma":[0.4853481,0.00002639106,0.5143869,0.000004523411,0.00003605425,0.0001336126,0.00001292605,0.00002630064,0.00002518494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4665591,"threshold_uncertainty_score":0.4305317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980430324","doi":"10.1016/j.cor.2014.05.003","title":"Location modeling for municipal solid waste facilities","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Municipal Solid Waste Management","field":"Environmental Science","cited_by":101,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Comisión Nacional de Investigación Científica y Tecnológica","keywords":"Municipal solid waste; Work (physics); Minification; Computer science; Solid waste management; Operations research; Facility location problem; Waste management; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1044891746843916,"gpt":0.3724616956954444,"spread":0.2679725210110528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001489484,0.0001151827,0.0001268822,0.0001210702,0.0007851105,0.0002289923,0.0005967918,0.00004697437,0.0001787042],"category_scores_gemma":[0.0001456629,0.0001132972,0.00004335792,0.000360867,0.0001834429,0.0002766025,0.0007189948,0.0001824792,0.000403908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002342145,"about_ca_system_score_gemma":0.00001759503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001678253,"about_ca_topic_score_gemma":0.001270447,"domain_scores_codex":[0.998108,0.0002497958,0.000252112,0.0003758155,0.0005259718,0.0004882713],"domain_scores_gemma":[0.9990591,0.0001428625,0.00001116482,0.0005767721,0.00009321272,0.0001168932],"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.000007845877,0.00003911821,0.00001560608,0.00002197335,0.000007468605,1.741788e-7,0.001603976,0.9883698,0.0001207248,0.004205598,0.001998887,0.003608807],"study_design_scores_gemma":[0.0002526692,0.0001108009,0.00001204971,0.00002007522,0.000003084403,5.375064e-7,0.001107086,0.9865227,0.0001635056,0.0006459402,0.0110404,0.000121121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.275893,0.00002370763,0.7164168,0.0008925782,0.0001255019,0.0008612827,0.000003314641,0.00004161707,0.005742113],"genre_scores_gemma":[0.9866469,0.000008958362,0.008733537,0.0001205107,0.0001305588,0.0002481429,0.00002918019,0.00001678813,0.004065421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7107539,"threshold_uncertainty_score":0.6038514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039638040","doi":"10.1016/j.cor.2014.07.001","title":"Heuristics for dynamic and stochastic inventory-routing","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristics; Mathematical optimization; Heuristic; Time horizon; Vendor; Routing (electronic design automation); Context (archaeology); Operations research; Inventory control; Inventory management; Stochastic programming; Dynamic programming; Operations management; Algorithm; Mathematics; Artificial intelligence; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.05070018542644834,"gpt":0.3683088358235626,"spread":0.3176086503971142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329935,0.00009512134,0.00012317,0.0001986948,0.0003992726,0.000210691,0.0001608289,0.0000574535,0.000005282601],"category_scores_gemma":[0.0006526798,0.0001052135,0.00002196997,0.000260987,0.00008087097,0.00008790102,0.00008295348,0.0002244625,0.00001044945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000846489,"about_ca_system_score_gemma":0.00002975833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006490494,"about_ca_topic_score_gemma":0.00001475218,"domain_scores_codex":[0.9989365,0.000179889,0.0001935059,0.0001956432,0.0001821891,0.0003122539],"domain_scores_gemma":[0.9988736,0.0005659543,0.000006509649,0.0002153673,0.0002344003,0.0001041952],"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.000001620512,0.000007641441,0.00003144834,0.00003918941,0.00001059746,1.980303e-7,0.0003093388,0.9813403,0.0004452496,0.0037279,0.0003953765,0.01369113],"study_design_scores_gemma":[0.0002694242,0.00004487641,0.0001447369,0.00003189762,0.000004214879,0.000003294672,0.00004101335,0.9986674,0.00005246966,0.0002096164,0.0004248603,0.0001062141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03274141,0.00006946189,0.9661109,0.0001738724,0.0002380773,0.0003435745,0.000005139341,0.0001640786,0.0001534587],"genre_scores_gemma":[0.7419662,0.000008726573,0.2576967,0.00002311616,0.00009796492,0.00004751319,0.00001891312,0.00003228307,0.0001085814],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7092248,"threshold_uncertainty_score":0.4290484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050675408","doi":"10.1016/j.cor.2012.02.008","title":"Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":99,"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":"Computer science; Pairwise comparison; Simulated annealing; Heuristics; Algorithm; Population; Combinatorial optimization; Mathematical optimization; Graph; Mathematics; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1009544948136012,"gpt":0.4398514962153584,"spread":0.3388970014017572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001848786,0.0001629226,0.0001952133,0.0001746324,0.001738454,0.0005639718,0.0004039493,0.00006197841,0.00005622571],"category_scores_gemma":[0.00004253232,0.0001376177,0.0001612946,0.001216207,0.0002383727,0.000366359,0.0002098515,0.0003463498,0.00000951408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002780811,"about_ca_system_score_gemma":0.0002297767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002033607,"about_ca_topic_score_gemma":0.00006913426,"domain_scores_codex":[0.9973419,0.0005694352,0.0003454779,0.0003711781,0.0006498753,0.0007220767],"domain_scores_gemma":[0.997533,0.0008627819,0.00002521704,0.0004558933,0.0009802098,0.0001428538],"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.0001742417,0.00144902,0.02025472,0.0000805993,0.0003944381,0.000001210818,0.00107131,0.5525407,0.002940258,0.298203,0.003444833,0.1194457],"study_design_scores_gemma":[0.0005327396,0.00009235447,0.0004112789,0.00003372686,0.00004773682,0.000001674793,0.0001622165,0.9892433,0.0022098,0.006191227,0.0009164294,0.000157483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01580814,0.00006655341,0.9811695,0.0007979507,0.0003012634,0.00152939,0.00002642629,0.00007764214,0.0002231222],"genre_scores_gemma":[0.8781515,8.923565e-7,0.1198309,0.00002489607,0.001418886,0.0004687261,0.00006846829,0.00002125183,0.00001454513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8623433,"threshold_uncertainty_score":0.9995611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117667427","doi":"10.1016/j.cor.2005.06.019","title":"Markov chain models of a telephone call center with call blending","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Markov chain; Benchmark (surveying); Call management; Center (category theory); Markov model; Telecommunications; Call control; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03933045939321227,"gpt":0.3084871387843281,"spread":0.2691566793911158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009719157,0.0001456269,0.0002226527,0.0007237641,0.0004191268,0.000253834,0.0004324358,0.00004526438,0.0001047342],"category_scores_gemma":[0.0000614744,0.0001249743,0.00006213007,0.001132036,0.0001736521,0.001327046,0.0003331672,0.0002851701,0.0001009993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009816125,"about_ca_system_score_gemma":0.00004559182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003506863,"about_ca_topic_score_gemma":0.0007756348,"domain_scores_codex":[0.9983569,0.00007274946,0.0002892111,0.0003486223,0.0005106269,0.0004219362],"domain_scores_gemma":[0.998812,0.0001052393,0.00004370649,0.0004186247,0.0005929248,0.00002750959],"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.00009935557,0.0002370594,0.0003292693,0.00006760364,0.00008924615,0.00001399819,0.0002966222,0.9475353,0.001166004,0.03028008,0.00325409,0.01663136],"study_design_scores_gemma":[0.0005858623,0.00002056099,0.00008003996,0.00009971634,0.00001699946,0.000002948387,0.0001157329,0.9916325,0.0002768061,0.000480252,0.006521364,0.0001671975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.368978,0.0001237196,0.6149744,0.0044062,0.00009611167,0.0006998021,0.000008732874,0.0001522602,0.01056079],"genre_scores_gemma":[0.9764307,0.00001344571,0.0211973,0.0003642683,0.0005341961,0.00003656298,0.00004216838,0.00003105899,0.001350262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6074528,"threshold_uncertainty_score":0.5096304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135657744","doi":"10.1016/j.cor.2008.11.014","title":"A conditional p-hub location problem with attraction functions","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":94,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Probabilistic logic; Heuristic; Mathematical optimization; Computer science; Facility location problem; Operations research; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.113983563796298,"gpt":0.3140330257788559,"spread":0.2000494619825579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005091612,0.0001299479,0.0001057922,0.0005979858,0.001715282,0.0003066811,0.0002143943,0.0000451621,0.0006645664],"category_scores_gemma":[0.00005183173,0.000119511,0.00003544981,0.00159464,0.0002079298,0.001584375,0.000110574,0.0002532507,0.002734143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001163968,"about_ca_system_score_gemma":0.0001358657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002197887,"about_ca_topic_score_gemma":0.002300821,"domain_scores_codex":[0.9983348,0.00004237023,0.0002585555,0.0003695771,0.0006857857,0.0003089271],"domain_scores_gemma":[0.9981822,0.00002651768,0.00001573267,0.0003085916,0.001439865,0.00002704136],"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.00005837866,0.0005497327,0.002344182,0.000129543,0.00007043016,0.00001175703,0.0002334291,0.7885525,0.000196577,0.06787319,0.136774,0.003206307],"study_design_scores_gemma":[0.001038295,0.00009158258,0.05685641,0.00006059455,0.00002610353,0.00003354964,0.0007210079,0.709666,0.00003451055,0.0004318018,0.2306281,0.0004120806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2983501,0.00007450526,0.6579814,0.01459273,0.0006763501,0.001921284,0.000009969146,0.0004625867,0.02593108],"genre_scores_gemma":[0.9911227,0.00001577285,0.002102709,0.0005926077,0.0005773184,0.0002866245,0.0005987714,0.00001714961,0.004686335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6927726,"threshold_uncertainty_score":0.9995844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4294724286","doi":"10.1016/j.cor.2022.106015","title":"A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":89,"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":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Drone; Computer science; Pickup; Payload (computing); Truck; Last mile (transportation); TRIPS architecture; Mile; Operations research; Real-time computing; Engineering; Artificial intelligence; Computer security; Network packet; Automotive engineering; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.08399262146980647,"gpt":0.3299644542793425,"spread":0.2459718328095361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001262916,0.0001806078,0.0002576838,0.0005852865,0.001070351,0.0003283189,0.0003724567,0.00005613844,0.00012784],"category_scores_gemma":[0.00005539391,0.0002039423,0.00003005854,0.001511279,0.00008979567,0.000224704,0.000510906,0.0006949865,0.00003431351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000362245,"about_ca_system_score_gemma":0.0001570531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001127251,"about_ca_topic_score_gemma":0.0001809572,"domain_scores_codex":[0.9974123,0.0005990262,0.0003206717,0.0004552734,0.0006874725,0.0005252394],"domain_scores_gemma":[0.9987482,0.0002322554,0.00001473137,0.000432174,0.0003285535,0.000244026],"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.00003392249,0.0001751815,0.0002931178,0.00005037497,0.00007962208,0.00001137655,0.00155093,0.9734743,0.007259888,0.0001901369,0.000968282,0.01591288],"study_design_scores_gemma":[0.001377443,0.0003529656,0.003373498,0.00005795492,0.00001370677,0.00002745035,0.0003084791,0.9918335,0.0006082001,0.000007385732,0.001762138,0.0002772869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2377318,0.0002158365,0.7594631,0.0006190928,0.00009982281,0.001146769,0.00002933889,0.0003370438,0.0003571591],"genre_scores_gemma":[0.4367903,0.00002987483,0.5620168,0.00007355472,0.00005394207,0.0003648555,0.00005188026,0.00006120335,0.0005575405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1990584,"threshold_uncertainty_score":0.8316524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013782474","doi":"10.1016/j.cor.2014.05.012","title":"The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":88,"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":"Backup; Operations research; Spoke-hub distribution paradigm; Computer science; Linearization; Heuristic; Facility location problem; Function (biology); Mathematical optimization; Natural disaster; Flow network; Mathematical model; Transport engineering; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03528771779630964,"gpt":0.3742071828086215,"spread":0.3389194650123118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001791427,0.00008334665,0.0001297909,0.0001967,0.0003036628,0.0001568278,0.0001311222,0.00007525594,0.000005326126],"category_scores_gemma":[0.0002402824,0.00006346903,0.00002699921,0.0004151467,0.0001352851,0.0001581295,0.00009749586,0.000271684,0.000001390579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000711545,"about_ca_system_score_gemma":0.00002513029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004186102,"about_ca_topic_score_gemma":0.00007725141,"domain_scores_codex":[0.9989511,0.000281442,0.0002540521,0.0001207274,0.000153604,0.0002391033],"domain_scores_gemma":[0.9988718,0.0006938422,0.0000101842,0.000216525,0.000149101,0.00005851475],"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.000002544982,0.00001420347,0.0006253689,0.00001807579,0.00001273834,1.547543e-7,0.0003452106,0.9623902,0.0006556765,0.01074392,0.0003003782,0.02489156],"study_design_scores_gemma":[0.0001171043,0.00004841945,0.003990408,0.00004747556,0.000001925875,0.000004687724,0.00002666196,0.9946061,0.0001742693,0.0008495665,0.00007226413,0.00006106606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08636761,0.00008225468,0.9126137,0.0002753122,0.00001768404,0.0003085839,0.000001411032,0.0000730997,0.0002603001],"genre_scores_gemma":[0.829331,0.00009027265,0.1704597,0.0000029583,0.0000401267,0.0000346459,0.000005484639,0.00001422774,0.000021631],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7429634,"threshold_uncertainty_score":0.2588192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4280615951","doi":"10.1016/j.cor.2022.105870","title":"Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Piecewise linear function; Computer science; Routing (electronic design automation); Mathematical optimization; Piecewise; Operations research; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0419060104114088,"gpt":0.3142522808123648,"spread":0.272346270400956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002659858,0.0001571313,0.0001781638,0.0003351272,0.002549003,0.0003318149,0.000204068,0.00004074173,0.00001878658],"category_scores_gemma":[0.0001938008,0.000140218,0.00002033494,0.001280758,0.00008753774,0.0002542854,0.0001773299,0.0006526833,0.000002690759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001631452,"about_ca_system_score_gemma":0.0001040641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005612512,"about_ca_topic_score_gemma":0.0000123383,"domain_scores_codex":[0.9980986,0.0004545001,0.0002714067,0.0003501338,0.0003384134,0.0004870217],"domain_scores_gemma":[0.9978658,0.001497073,0.00002458642,0.0002309603,0.0002755473,0.0001060432],"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.00001937757,0.00001581107,0.0001514433,0.00004494884,0.00006660359,0.000001452348,0.00337043,0.9673759,0.01259346,0.001111638,0.0002684583,0.01498047],"study_design_scores_gemma":[0.0006119982,0.0001177621,0.0002309145,0.00003247236,0.00001730796,0.00003344457,0.0004263183,0.9968584,0.0007908826,0.0000693229,0.0006404466,0.0001706862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2030162,0.0006721601,0.7921162,0.002100418,0.00006353039,0.00156603,0.00003050957,0.0002822261,0.000152699],"genre_scores_gemma":[0.7991824,0.0001688949,0.1994709,0.00009436543,0.00008516992,0.000543358,0.00004490151,0.00008289694,0.0003270961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5961662,"threshold_uncertainty_score":0.9987496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380716478","doi":"10.1016/j.cor.2023.106304","title":"Efficient multi-objective metaheuristic algorithm for sustainable harvest planning problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Beijing University of Civil Engineering and Architecture","keywords":"Sustainability; Computer science; Sorting; Multi-objective optimization; Genetic algorithm; Metaheuristic; Mathematical optimization; Greenhouse gas; Profit (economics); Time horizon; Operations research; Economics; Algorithm; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0750722212165218,"gpt":0.3472629148405397,"spread":0.2721906936240179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011446,0.0001138445,0.000161252,0.0001130123,0.001598306,0.0002484258,0.0003892514,0.0001074026,0.00002809807],"category_scores_gemma":[0.0001953529,0.00005233209,0.00006802133,0.001224901,0.000146993,0.00007956778,0.0002478165,0.0002673972,0.0001358639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000069422,"about_ca_system_score_gemma":0.0000359457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002093983,"about_ca_topic_score_gemma":0.0001469429,"domain_scores_codex":[0.9983312,0.0001620683,0.0001829378,0.0003876933,0.0002328669,0.0007031847],"domain_scores_gemma":[0.9985902,0.0006236305,0.00001519815,0.00009016734,0.0005951027,0.0000857356],"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.0001324917,0.001541469,0.001999427,0.0001516968,0.0003593533,0.0004163409,0.002909865,0.2280424,0.06963103,0.0388007,0.0323501,0.6236651],"study_design_scores_gemma":[0.0004623276,0.0004105042,0.01122827,0.00002541754,0.000009146097,0.000005027365,0.003099018,0.9786175,0.0005871588,0.0003908761,0.004994348,0.0001703789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9351015,0.0002860181,0.05561926,0.004256284,0.0001579302,0.003282726,0.00009160327,0.0009101392,0.0002945173],"genre_scores_gemma":[0.9848958,0.00001193772,0.01023484,0.0000679026,0.0001455834,0.0008680313,0.0001753751,0.000003530285,0.003597047],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7505751,"threshold_uncertainty_score":0.9997015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047599849","doi":"10.1016/j.cor.2014.06.016","title":"An innovative multi-agent search-and-rescue path planning approach","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Mathematical optimization; Motion planning; Time horizon; Constraint (computer-aided design); Path (computing); Integer programming; Variety (cybernetics); Representation (politics); Relaxation (psychology); Computational complexity theory; Computation; Bellman equation; Algorithm; Mathematics; Artificial intelligence; Robot","retraction":null,"screen_n_in":null,"score":{"opus":0.1443338905431879,"gpt":0.4048317940207116,"spread":0.2604979034775238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003456508,0.0002184579,0.0002554361,0.0006406276,0.001118055,0.001212139,0.00170535,0.0001068464,0.000002471624],"category_scores_gemma":[0.0002099775,0.000201061,0.0000305521,0.001685893,0.0002855286,0.0008806671,0.0009010466,0.0008234517,0.00006322655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001139548,"about_ca_system_score_gemma":0.0002536572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002910396,"about_ca_topic_score_gemma":0.00000386254,"domain_scores_codex":[0.9957312,0.001309563,0.0003414403,0.0009290403,0.000913699,0.0007750418],"domain_scores_gemma":[0.9974376,0.0002623281,0.00001373649,0.001086883,0.0008475285,0.0003519289],"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.000005088692,0.0003221993,0.0007128255,0.00002606307,0.000033509,0.00003138958,0.01405459,0.9101384,0.001399898,0.02733734,0.0005786743,0.04536001],"study_design_scores_gemma":[0.0004804314,0.0002912743,0.007723697,0.00004687526,0.000001320029,0.00003344935,0.0002649183,0.9903188,0.0002611146,0.00003738884,0.0003105785,0.0002301991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05187021,0.00007425569,0.9463763,0.0004843098,0.0002181782,0.0004580231,0.000003799685,0.000213398,0.0003015721],"genre_scores_gemma":[0.4234217,0.000003587061,0.5761057,0.0001394025,0.0001260784,0.00004957953,0.00002884754,0.0000150567,0.0001100709],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3715515,"threshold_uncertainty_score":0.9998247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1897909895","doi":"10.1016/j.cor.2015.05.018","title":"Optimizing horizontal alignment of roads in a specified corridor","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Horizontal and vertical; Earthworks; Mathematical optimization; Computer science; Optimization problem; Quadratic equation; Quadratic programming; Algorithm; Mathematics; Geometry; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07240233199696892,"gpt":0.328413703094025,"spread":0.2560113710970561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004465828,0.0000848017,0.0001382526,0.0002753735,0.00005345463,0.00006110957,0.0002025646,0.00004593172,0.00001062001],"category_scores_gemma":[0.00003007748,0.00008307918,0.00002484336,0.0003511583,0.00004992772,0.0001385697,0.00009166797,0.0002515262,0.00001619001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000291589,"about_ca_system_score_gemma":0.00007606348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001292524,"about_ca_topic_score_gemma":0.00008909205,"domain_scores_codex":[0.998974,0.00005224663,0.0002161717,0.000133699,0.0003173588,0.0003065159],"domain_scores_gemma":[0.9995012,0.00003323244,0.0000050987,0.0002025276,0.0001652406,0.00009271026],"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.00001566852,0.00002366087,0.0002606051,0.00001577518,0.00001436458,0.00002130908,0.00340605,0.9753655,0.009085652,0.001119581,0.003969184,0.006702713],"study_design_scores_gemma":[0.001188511,0.0002290979,0.001622694,0.0001686465,0.000002943639,0.00001374348,0.002662858,0.9468927,0.04261806,0.0001220348,0.004235344,0.0002433013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8875475,0.0003078677,0.1038922,0.0000981655,0.001488358,0.0004182818,0.000005010061,0.00007763011,0.006164955],"genre_scores_gemma":[0.9772507,0.00002646446,0.02236651,0.00000531456,0.0002359677,0.00002804905,0.000008061163,0.00001588723,0.0000630621],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08970318,"threshold_uncertainty_score":0.338787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086111473","doi":"10.1016/j.cor.2004.01.001","title":"Parallel machine selection and job scheduling to minimize machine cost and job tardiness","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":false,"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":"Tardiness; Computer science; Tabu search; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Selection (genetic algorithm); Due date; Heuristic; Algorithm; Schedule; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03315502815199124,"gpt":0.3158891169154314,"spread":0.2827340887634402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004528771,0.0001617401,0.0001795215,0.0003902176,0.000515301,0.0004078597,0.0001417835,0.00008148848,0.00002281353],"category_scores_gemma":[0.00009823641,0.0001641601,0.0000224464,0.0006967742,0.00005766083,0.0002063689,0.0001111383,0.0003847428,0.00003106741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001157501,"about_ca_system_score_gemma":0.00005604525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002501099,"about_ca_topic_score_gemma":0.0002738593,"domain_scores_codex":[0.9987723,0.00007247026,0.0002224982,0.0003135848,0.0002704589,0.0003486938],"domain_scores_gemma":[0.9992415,0.00008318367,0.000005974507,0.0001717047,0.0002418155,0.000255832],"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.00001238809,0.00001734325,0.000566305,0.00002181925,0.00002626823,0.000003830427,0.0004332156,0.9921819,0.0004987041,0.0005066359,0.00008533274,0.00564629],"study_design_scores_gemma":[0.0009508327,0.00005151242,0.002305488,0.00004860081,0.000006064849,0.00003596774,0.00007211778,0.9956868,0.000341967,0.0000409051,0.0002747668,0.0001849733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1520699,0.0007387109,0.8446209,0.001554993,0.0002122264,0.0004373789,0.00001166182,0.0001925205,0.0001616433],"genre_scores_gemma":[0.4556533,0.000264016,0.5435559,0.00008891943,0.0001517598,0.00007502662,0.00003447934,0.00003526841,0.0001413979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3035833,"threshold_uncertainty_score":0.6694255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041088973","doi":"10.1016/j.cor.2014.06.007","title":"A decomposition-based heuristic for the multiple-product inventory-routing problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Vendor; Computer science; Vehicle routing problem; Operations research; Routing (electronic design automation); Integer programming; Decomposition; Time horizon; Mathematical optimization; Product (mathematics); Linear programming; Mathematics; Algorithm; Business; Artificial intelligence; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.06450626381469744,"gpt":0.3730753622545784,"spread":0.308569098439881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002744026,0.0001389547,0.0001442618,0.0002046523,0.001032765,0.0003577368,0.000430152,0.00004941638,0.00001468903],"category_scores_gemma":[0.0009324725,0.0001193344,0.00006513168,0.0005470371,0.0001078584,0.0001085326,0.00006905111,0.0003405092,0.0000292078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001388028,"about_ca_system_score_gemma":0.00008407062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003898235,"about_ca_topic_score_gemma":0.00004456949,"domain_scores_codex":[0.9981829,0.0004614923,0.0003044914,0.000293,0.0003216067,0.0004364952],"domain_scores_gemma":[0.9965743,0.00234184,0.00001391108,0.0004902306,0.0004840019,0.00009571444],"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.000005367404,0.00002356524,0.0002545904,0.00005432309,0.00002141067,2.617626e-7,0.0002820098,0.9834431,0.001197383,0.001373821,0.001792934,0.01155123],"study_design_scores_gemma":[0.0004755252,0.00004597557,0.000316873,0.00004963322,0.000008279071,0.000001959156,0.00003396109,0.9950668,0.001349811,0.0000655215,0.002449575,0.0001361344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009215952,0.00009573189,0.9875649,0.001219709,0.0003312749,0.001056286,0.000006915332,0.0002844576,0.0002247795],"genre_scores_gemma":[0.667274,0.000004452821,0.3319477,0.00007637063,0.0002833626,0.000282529,0.00003606312,0.00003985978,0.00005561636],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.658058,"threshold_uncertainty_score":0.7943301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089432311","doi":"10.1016/j.cor.2015.04.002","title":"A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Metaheuristic; FIFO and LIFO accounting; Crossover; Population; Mathematical optimization; Tabu search; Computer science; Local search (optimization); Vehicle routing problem; Mathematics; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06616750905945257,"gpt":0.3289781835126778,"spread":0.2628106744532253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221843,0.00009862827,0.0001257537,0.000159181,0.0003986232,0.000330753,0.0001199826,0.00003941387,0.000004614996],"category_scores_gemma":[0.0001681166,0.00007355115,0.00001347686,0.0003220945,0.00007191899,0.000148119,0.00004905211,0.0001661062,0.000004838477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007087915,"about_ca_system_score_gemma":0.00009071299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008285927,"about_ca_topic_score_gemma":0.00003822174,"domain_scores_codex":[0.9990447,0.000171706,0.0001531982,0.0001845631,0.0002254515,0.0002204136],"domain_scores_gemma":[0.9984823,0.0008847149,0.000008625124,0.0001856113,0.0003241455,0.0001146101],"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.00001300908,0.00000754808,0.0008650233,0.00003014831,0.00002945136,7.82982e-7,0.0003182912,0.9935715,0.0001236224,0.000228362,0.0005603711,0.004251888],"study_design_scores_gemma":[0.0005580107,0.00008154978,0.0009883855,0.00003476041,0.00001591456,0.000006223422,0.00004805332,0.9976233,0.00008433878,0.00003988166,0.0004249718,0.00009460262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0660934,0.000449614,0.9317055,0.0005957652,0.00004585167,0.0009045952,0.000007893187,0.0001114268,0.00008591479],"genre_scores_gemma":[0.5907795,0.00001187622,0.4088222,0.00003855,0.00006605026,0.0001216904,0.00002408635,0.00002902793,0.000107016],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5246861,"threshold_uncertainty_score":0.3189459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067522992","doi":"10.1016/j.cor.2014.10.018","title":"Tactical network planning for food aid distribution in Kenya","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; UNICEF","keywords":"Distribution (mathematics); Food distribution; Welfare; Population; Geography; Food security; Developing country; Business; Economic growth; Environmental resource management; Socioeconomics; Agricultural economics; Economics; Environmental health; Agriculture; Mathematics; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.106762244579952,"gpt":0.356106275574136,"spread":0.249344030994184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001691518,0.00009580598,0.0001178054,0.0002080234,0.0005862725,0.0004351623,0.0002604882,0.00004743549,0.00006017625],"category_scores_gemma":[0.00036906,0.00009759182,0.00004216216,0.0007716268,0.00005457723,0.0005417846,0.0002025799,0.0001861601,0.0001737904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000736626,"about_ca_system_score_gemma":0.00002435731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002326784,"about_ca_topic_score_gemma":0.001167163,"domain_scores_codex":[0.9986628,0.00005648568,0.0002598412,0.0002919856,0.0002977882,0.0004310473],"domain_scores_gemma":[0.9993397,0.00008355777,0.000008572675,0.0002418611,0.000306436,0.0000198745],"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.0000425259,0.0001291385,0.00265882,0.0001001973,0.00001635624,5.738852e-7,0.00009514927,0.5988808,0.00001377329,0.2871497,0.1011169,0.009796202],"study_design_scores_gemma":[0.000359546,0.00002949218,0.005256774,0.00002876671,0.000002765573,1.387205e-7,0.00006592034,0.7247292,0.000003074158,0.000862087,0.2685733,0.0000889291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1558546,0.00005813649,0.8290567,0.009988769,0.001022707,0.001194613,0.000009828915,0.0001097581,0.002704961],"genre_scores_gemma":[0.9959272,0.000004259161,0.001686469,0.0005162764,0.001034512,0.0001581761,0.0004606332,0.0000110914,0.0002014247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8400726,"threshold_uncertainty_score":0.4509193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975651401","doi":"10.1016/j.cor.2007.02.005","title":"Exact algorithms for the joint object placement and request routing problem in content distribution networks","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Algorithm; Mathematical optimization; Linear programming relaxation; Network topology; The Internet; Integer programming; Server; Linear programming; Computer network; Distributed computing; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1332144042850287,"gpt":0.3555824419604348,"spread":0.222368037675406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005131329,0.0001147312,0.0001356493,0.0001382855,0.0008620023,0.0007168038,0.0004580191,0.0000528675,8.962624e-7],"category_scores_gemma":[0.0001123733,0.00008634686,0.00004821689,0.0004660256,0.0000977272,0.0003020779,0.0003996489,0.0004004072,0.000002522217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002599489,"about_ca_system_score_gemma":0.00009641521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007355622,"about_ca_topic_score_gemma":0.0004132559,"domain_scores_codex":[0.9981439,0.0002030081,0.0003477272,0.000404788,0.0003634123,0.0005371993],"domain_scores_gemma":[0.9984353,0.0007374824,0.00002502802,0.0003725858,0.0003367562,0.00009284818],"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.0001143639,0.0004069672,0.001444952,0.00004676066,0.0001084807,0.00005620681,0.004355731,0.4263882,0.002435837,0.1082954,0.005107612,0.4512395],"study_design_scores_gemma":[0.0005290862,0.0001743591,0.003328277,0.00007723519,0.000002485842,0.00001141405,0.0003566584,0.9947027,0.0001402767,0.00005398556,0.0005161803,0.0001073482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01853624,0.0004597327,0.9774187,0.002118187,0.0003133356,0.001046693,0.000005042892,0.00005048723,0.00005158316],"genre_scores_gemma":[0.9841849,0.00009419125,0.01509411,0.0001355453,0.0001829098,0.0001238343,0.00003586994,0.000007786318,0.0001408389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9656487,"threshold_uncertainty_score":0.6912156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046059743","doi":"10.1016/j.cor.2005.02.047","title":"Multi-item dynamic production-distribution planning in process industries with divergent finishing stages","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Bottleneck; Mathematical optimization; Computer science; Production (economics); Process (computing); Linear programming; Production planning; Piecewise linear function; Integer programming; Piecewise; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05081746576595451,"gpt":0.3466062186514448,"spread":0.2957887528854903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004072058,0.0001169558,0.0001090334,0.0002508385,0.0003527988,0.0002597283,0.000178238,0.00007352883,0.00001451576],"category_scores_gemma":[0.0001524009,0.0001124934,0.00001171529,0.0009686581,0.00006633751,0.000463697,0.0000403143,0.0005190828,0.00001661616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002655901,"about_ca_system_score_gemma":0.0001098406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000211424,"about_ca_topic_score_gemma":0.0001289638,"domain_scores_codex":[0.9988286,0.00007052978,0.0002091938,0.0002511076,0.0003266032,0.0003139807],"domain_scores_gemma":[0.9993846,0.00006136263,0.000009066517,0.000171236,0.0002998154,0.00007393236],"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.00000556094,0.0000491571,0.003185439,0.00002051926,0.00001313111,0.000004204623,0.001742131,0.9892331,0.00007402116,0.00001391149,0.0002625017,0.005396319],"study_design_scores_gemma":[0.0003174634,0.00002859504,0.005300047,0.0001231323,0.000002082535,0.000005670021,0.0009234867,0.9916814,0.001263786,0.000001094338,0.0002157467,0.0001375267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6861785,0.0002709028,0.3120102,0.0007277476,0.0001870091,0.0003665269,0.00001604484,0.0002141267,0.00002893765],"genre_scores_gemma":[0.934451,0.00003909411,0.06491095,0.00000950953,0.0001084683,0.00008603783,0.0002010131,0.00002102845,0.0001728669],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2482725,"threshold_uncertainty_score":0.4587348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106852598","doi":"10.1016/j.cor.2005.07.015","title":"A first multilevel cooperative algorithm for capacitated multicommodity network design","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Benchmark (surveying); Computer science; Mathematical optimization; Set (abstract data type); Network planning and design; Algorithm; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1307881327101771,"gpt":0.3751517516909518,"spread":0.2443636189807747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001916748,0.0002094947,0.0002457228,0.0002175138,0.001092891,0.0003220391,0.0003781676,0.0001318459,0.00005114198],"category_scores_gemma":[0.0003105668,0.0002202026,0.00006118779,0.0006577584,0.0001353905,0.0003269664,0.00009047757,0.0004628505,0.00008032136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003225261,"about_ca_system_score_gemma":0.0001049175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003012111,"about_ca_topic_score_gemma":0.00009021634,"domain_scores_codex":[0.9977545,0.0005266124,0.0003755769,0.0003444038,0.0003155255,0.0006834227],"domain_scores_gemma":[0.9970759,0.001481045,0.00001179224,0.0003725791,0.0008771797,0.0001815459],"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.000005945358,0.00005080245,0.000003826779,0.00001302917,0.00004700305,0.000001221015,0.0009620194,0.9123548,0.0001623806,0.0002167917,0.01288015,0.07330208],"study_design_scores_gemma":[0.0008409924,0.00007386545,0.0000629655,0.00004361836,0.000006452742,0.000004467125,0.00004834004,0.9918964,0.001366484,0.00002179615,0.005397871,0.0002367507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000973471,0.0001363749,0.9960888,0.0004797759,0.0003217258,0.001488082,0.0000468371,0.0003831083,0.00008183796],"genre_scores_gemma":[0.05110432,0.00004051289,0.9473854,0.00007241312,0.0005760415,0.0004499423,0.00006764007,0.00006612133,0.0002375865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07954164,"threshold_uncertainty_score":0.8979602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2584833029","doi":"10.1016/j.cor.2017.01.020","title":"Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Austrian Science Fund","keywords":"Truck; Trailer; Computer science; Vehicle routing problem; Metaheuristic; Routing (electronic design automation); Branch and price; Set (abstract data type); Order (exchange); Service (business); Operations research; Variable neighborhood search; Transport engineering; Mathematical optimization; Automotive engineering; Integer programming; Business; Algorithm; Engineering; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05007025236499678,"gpt":0.3340841521052146,"spread":0.2840138997402178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001749745,0.0001332812,0.0001634363,0.0001042927,0.002028477,0.0009259378,0.0002627196,0.00006342063,0.00001060729],"category_scores_gemma":[0.0001027276,0.00009921633,0.0000169439,0.0001429556,0.0002245775,0.0003493246,0.0002250188,0.0003599519,0.000003559814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003533857,"about_ca_system_score_gemma":0.0000596486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000031662,"about_ca_topic_score_gemma":0.00003486147,"domain_scores_codex":[0.9987254,0.0001739222,0.0001571566,0.0002898966,0.0002386391,0.0004149455],"domain_scores_gemma":[0.9985284,0.0007323855,0.00001437242,0.0003533083,0.0002580591,0.0001134515],"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.0001196818,0.00007026844,0.006978469,0.000212249,0.0003627461,0.000006224981,0.01293422,0.8132324,0.002685179,0.02039398,0.0007205012,0.142284],"study_design_scores_gemma":[0.0009341003,0.0001096985,0.01100199,0.00005796274,0.00001053106,0.00001464296,0.0001768226,0.9870604,0.0002462095,0.00004374153,0.0002161877,0.000127757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06945941,0.0003261805,0.9264433,0.001343103,0.0000389565,0.001313468,0.0000231484,0.00008249161,0.0009699595],"genre_scores_gemma":[0.8879067,0.00007964131,0.1114761,0.00002686592,0.0001029958,0.0001024437,0.000005488127,0.0000386358,0.0002611028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8184473,"threshold_uncertainty_score":0.9992707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}