{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Vera Hemmelmayr","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957475,0.0004744751,0.001037241,0.0006161207,0.0004815903,0.0005373624,0.001291592,0.0009352362,0.001652474],"category_scores_gemma":[0.00185552,0.0003251911,0.0006078384,0.0006649304,0.0004542594,0.001110429,0.0007749419,0.0007073685,0.0002074696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006975832,"about_ca_system_score_gemma":0.001023307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00412501,"about_ca_topic_score_gemma":0.00553263,"domain_scores_codex":[0.9995246,0.00023811,0.00001881758,0.00006771265,0.00009680011,0.00005405741],"domain_scores_gemma":[0.9992448,0.0005388925,0.0000657227,0.00003591539,0.00007124437,0.0000434655],"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.00006852511,0.00009249676,0.0004293886,0.00006178925,0.00003186747,0.00006101338,0.0000414385,0.944086,0.0006772919,0.01000507,0.001214839,0.04323033],"study_design_scores_gemma":[0.00001429034,0.00002791682,0.00004793127,0.000003793272,0.000004431423,0.00001326058,0.00001133503,0.9971737,0.0001377797,0.00207068,0.000491287,0.000003553326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03702108,0.000681737,0.9580293,0.0001900952,0.00006636023,0.0001333294,0.00004906115,0.0001940271,0.003634963],"genre_scores_gemma":[0.5061894,0.0004250878,0.4899481,0.0001567698,0.0000574783,0.0003276016,0.0002152426,0.00007913992,0.002601133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00412501,"threshold_uncertainty_score":0.008201957,"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","authors":[{"name":"Oded Berman","is_ca":true},{"name":"Dmitry Krass","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153061,0.0009569784,0.001746934,0.0006599777,0.001018832,0.003032394,0.001969944,0.002485784,0.008264845],"category_scores_gemma":[0.005298388,0.0007571224,0.0009970189,0.002183929,0.001570954,0.004069995,0.002061134,0.001468895,0.0006545606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001477518,"about_ca_system_score_gemma":0.001033816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002814554,"about_ca_topic_score_gemma":0.001960027,"domain_scores_codex":[0.9983482,0.0008894624,0.00004760515,0.0003321023,0.0001607813,0.0002218625],"domain_scores_gemma":[0.9977806,0.001431798,0.0001912556,0.0002591397,0.0001250871,0.000212037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004525825,0.0001212447,0.001231477,0.0006859672,0.0002394681,0.0005056261,0.0003671332,0.3812573,0.001645349,0.4987029,0.03034711,0.08444381],"study_design_scores_gemma":[0.0001149786,0.00007248044,0.0005658588,0.00007167695,0.00007060589,0.0003626394,0.0002416395,0.358963,0.0005596234,0.6238286,0.0151202,0.00002863246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2560706,0.005059572,0.6630531,0.006238654,0.0004012513,0.0002367639,0.002363023,0.0006089674,0.06596802],"genre_scores_gemma":[0.861852,0.002695363,0.1179759,0.0005110832,0.0004269769,0.0001943454,0.002126522,0.0001709728,0.01404683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008264845,"threshold_uncertainty_score":0.02764863,"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","authors":[{"name":"Jianmai Shi","is_ca":true},{"name":"Guoqing Zhang","is_ca":true},{"name":"Sha Ji-chang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221647,0.001938248,0.002857266,0.001404883,0.001412834,0.003501721,0.00160575,0.003571819,0.004704483],"category_scores_gemma":[0.00423766,0.002587301,0.00133612,0.001537108,0.002291372,0.002052681,0.001755107,0.001948653,0.0004740628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003236557,"about_ca_system_score_gemma":0.00230619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03501621,"about_ca_topic_score_gemma":0.01940055,"domain_scores_codex":[0.998666,0.0003934216,0.0000621835,0.0003334126,0.0002197292,0.0003252024],"domain_scores_gemma":[0.9963878,0.002572082,0.0004128262,0.00007041667,0.0003754655,0.0001812987],"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.00006677139,0.00001575174,0.0001218243,0.00002875502,0.00001611274,0.0000653418,0.00002962663,0.9971707,0.000287068,0.0007782483,0.00008197339,0.001337739],"study_design_scores_gemma":[0.00001386484,0.00003625724,0.0001078177,0.000003423538,0.000009158117,0.00000628203,0.00001220091,0.9988593,0.0001107779,0.0007858112,0.00004793145,0.000007214777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.251357,0.001127559,0.7308986,0.001141078,0.0001249251,0.0003745673,0.0005420794,0.0005870504,0.01384714],"genre_scores_gemma":[0.9797963,0.000208892,0.01455144,0.00005193782,0.00002774916,0.0001404548,0.0001296336,0.00005012959,0.005043506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03501621,"threshold_uncertainty_score":0.06962478,"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","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Gianpaolo Ghiani","is_ca":true},{"name":"Emanuela Guerriero","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000969794,0.001603336,0.002386082,0.003050872,0.0003461133,0.001875827,0.001692825,0.001460462,0.004582291],"category_scores_gemma":[0.0017567,0.0007447791,0.001038897,0.005805187,0.0005710446,0.002776269,0.001047698,0.001425451,0.001823466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005932989,"about_ca_system_score_gemma":0.00193281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001770032,"about_ca_topic_score_gemma":0.002598157,"domain_scores_codex":[0.9996295,0.00005033829,0.00006048954,0.00008698458,0.0001424803,0.00003009606],"domain_scores_gemma":[0.9990308,0.0005655774,0.0001073679,0.00003195762,0.000217686,0.00004656339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006852335,0.000159393,0.0003276085,0.03108327,0.0002114556,0.0001009877,0.00004657067,0.004867695,0.0009088966,0.008222591,0.03076406,0.9232389],"study_design_scores_gemma":[0.00005191172,0.0002086288,0.00117921,0.01049597,0.0006453964,0.0008933257,0.0001484862,0.004063651,0.0009353583,0.01234947,0.9689311,0.00009751473],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0002080859,0.9966454,0.001757949,0.0001615381,0.0002293608,0.00000893683,0.00004057201,0.00001427219,0.0009338382],"genre_scores_gemma":[0.001045633,0.9966034,0.001507922,0.00009380416,0.0002326729,0.000008369528,0.00005949338,0.000004311938,0.0004444055],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004582291,"threshold_uncertainty_score":0.0153293,"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","authors":[{"name":"Philippe Galinier","is_ca":true},{"name":"Alain Hertz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002070914,0.001239871,0.002928878,0.002421618,0.0009129029,0.001630213,0.003170908,0.001501568,0.006677181],"category_scores_gemma":[0.005745099,0.0009305226,0.00184644,0.006155722,0.0009280545,0.002532702,0.001516315,0.002123565,0.002380769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001346986,"about_ca_system_score_gemma":0.001596284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006291577,"about_ca_topic_score_gemma":0.009137589,"domain_scores_codex":[0.9986072,0.0006444845,0.00007801614,0.0002298123,0.000361431,0.00007911378],"domain_scores_gemma":[0.9973366,0.001778714,0.0001002934,0.0003349404,0.0003813549,0.00006795653],"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.0001439058,0.0002743356,0.000848111,0.002117435,0.0002083086,0.00004162698,0.0001830707,0.1959668,0.001711264,0.08294138,0.01999764,0.6955662],"study_design_scores_gemma":[0.0001091774,0.0001544498,0.0004102866,0.0003496629,0.0001141356,0.0001522018,0.00009749334,0.8670048,0.001257006,0.092968,0.03733997,0.00004292443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.00286952,0.02430576,0.9658599,0.0004350412,0.0001630872,0.00009992507,0.0001752282,0.0006542733,0.005437287],"genre_scores_gemma":[0.07474811,0.03225576,0.8804623,0.0006318335,0.0006754837,0.0005750795,0.0008242793,0.0008925338,0.008934741],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006677181,"threshold_uncertainty_score":0.02233738,"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","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Mirko Maischberger","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106107,0.0007375948,0.00130878,0.001041164,0.0009304917,0.001027521,0.002209227,0.001460049,0.006515986],"category_scores_gemma":[0.002407031,0.0007594213,0.001052002,0.001536332,0.0006667115,0.00097248,0.0009422271,0.00102985,0.001161791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009523034,"about_ca_system_score_gemma":0.001710612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009492086,"about_ca_topic_score_gemma":0.008440282,"domain_scores_codex":[0.999447,0.0002105125,0.00002272343,0.00006134916,0.0001750361,0.00008335128],"domain_scores_gemma":[0.9992322,0.0003985355,0.00005160857,0.000102852,0.0001766139,0.00003826524],"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.0002197942,0.0001444948,0.0002902786,0.0000923784,0.00006085139,0.00007263397,0.00005477729,0.8706467,0.002035625,0.005246831,0.003144546,0.1179911],"study_design_scores_gemma":[0.00006109828,0.00005080334,0.00006398272,0.000005574361,0.00001462377,0.00001408894,0.000008145987,0.9969929,0.0003492407,0.001738445,0.0006952293,0.000005863967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08097167,0.0009272585,0.8910635,0.0003757457,0.0004047716,0.0004009917,0.0002423455,0.00273513,0.0228786],"genre_scores_gemma":[0.3372993,0.0003142759,0.6543365,0.0002084897,0.0001137238,0.0006300909,0.000291134,0.00044084,0.00636579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009492086,"threshold_uncertainty_score":0.02179813,"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","authors":[{"name":"Wen-Yang Ku","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002699001,0.00143892,0.001166307,0.0008194752,0.0007597618,0.002551613,0.002052233,0.001648678,0.006234124],"category_scores_gemma":[0.009566697,0.001208184,0.001533442,0.00120062,0.0008403238,0.002758496,0.001063938,0.002775181,0.0006626674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283484,"about_ca_system_score_gemma":0.00169117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003598855,"about_ca_topic_score_gemma":0.005498435,"domain_scores_codex":[0.9986702,0.0008773428,0.0000351904,0.00009978608,0.0002220211,0.00009544948],"domain_scores_gemma":[0.9935527,0.00552105,0.0003605186,0.0001639557,0.0002723093,0.0001294804],"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.00006420682,0.000110869,0.0003209334,0.0001002097,0.00004194766,0.00004306549,0.00004426987,0.8904958,0.0003043098,0.09883339,0.001714193,0.007926886],"study_design_scores_gemma":[0.000005115587,0.000009726231,0.00002790054,0.000004031159,0.000005205009,0.000004740774,0.000007050286,0.9872152,0.00003224369,0.01244531,0.0002412309,0.000002273002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.033702,0.001627998,0.9509274,0.001387135,0.0001727552,0.0001146345,0.0003431339,0.0001601303,0.0115648],"genre_scores_gemma":[0.6160601,0.002078361,0.3626791,0.0005270845,0.0004124179,0.0006923104,0.0005231525,0.0002019058,0.01682553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006234124,"threshold_uncertainty_score":0.02085519,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001828771,0.001695072,0.002005836,0.0008963596,0.0009995297,0.003067294,0.002740876,0.002716312,0.01360619],"category_scores_gemma":[0.004200514,0.00117822,0.001564104,0.00245034,0.001244802,0.005146767,0.002029534,0.002135474,0.00104975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001574085,"about_ca_system_score_gemma":0.001698941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007320345,"about_ca_topic_score_gemma":0.005470797,"domain_scores_codex":[0.9989869,0.0005273976,0.00004415496,0.000215868,0.0001001294,0.0001254664],"domain_scores_gemma":[0.9989277,0.0005890832,0.0001249477,0.00007927876,0.00008666541,0.0001923459],"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.0003603635,0.0001859231,0.0009230982,0.0003168936,0.0001366992,0.0006787326,0.0001171479,0.8489521,0.0007373941,0.1119291,0.00652677,0.02913568],"study_design_scores_gemma":[0.00005746692,0.0001282349,0.0003543983,0.00004394581,0.00006117998,0.0002688451,0.000153271,0.9005545,0.0005186431,0.0925529,0.00527605,0.00003052269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1307668,0.002665175,0.8211335,0.002895136,0.0005914528,0.0002935898,0.001575404,0.0002581538,0.03982078],"genre_scores_gemma":[0.7686834,0.002796322,0.1632786,0.0003233441,0.0003499098,0.0003235253,0.001297517,0.0002914551,0.06265587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01360619,"threshold_uncertainty_score":0.04551727,"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","authors":[{"name":"Merve Keskin","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Bülent Çatay","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002310872,0.002095162,0.002510922,0.001239229,0.0009371753,0.002741364,0.003727441,0.003714876,0.007273857],"category_scores_gemma":[0.006386118,0.00189265,0.001453303,0.002314883,0.001416226,0.002965013,0.001539769,0.002043305,0.0005645499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002474118,"about_ca_system_score_gemma":0.002243838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01605103,"about_ca_topic_score_gemma":0.009134407,"domain_scores_codex":[0.9987035,0.000351109,0.00005632555,0.0004054842,0.0001666616,0.0003168946],"domain_scores_gemma":[0.9966705,0.002267674,0.000386111,0.0001080296,0.0003061978,0.0002615115],"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.0001570037,0.00006949666,0.0004650464,0.00009703366,0.00006295125,0.0002695665,0.00004071278,0.9830313,0.0007572822,0.00930429,0.0012835,0.00446171],"study_design_scores_gemma":[0.00004286636,0.00006002225,0.0003074307,0.000007213485,0.00004017574,0.0000669488,0.00004508459,0.9929956,0.0003385647,0.005588754,0.0004888058,0.00001864993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1889889,0.001142401,0.7880937,0.002970027,0.0005112521,0.0003006975,0.002139169,0.0004294578,0.01542428],"genre_scores_gemma":[0.9064373,0.0007603553,0.05111463,0.0002999059,0.0002708174,0.000252926,0.001204028,0.0002254469,0.03943466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01605103,"threshold_uncertainty_score":0.03191519,"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","authors":[{"name":"Orhan Karasakal","is_ca":false},{"name":"Esra Karasakal","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00151079,0.0009148564,0.001467806,0.0007551764,0.001043237,0.004018558,0.002873152,0.002858275,0.008529289],"category_scores_gemma":[0.005376854,0.00111244,0.001001418,0.001925478,0.001819563,0.005218836,0.002474179,0.001667627,0.0009296639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002420385,"about_ca_system_score_gemma":0.001444162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009330362,"about_ca_topic_score_gemma":0.005859433,"domain_scores_codex":[0.9983593,0.0006576764,0.0000717049,0.0003192057,0.000250834,0.0003413647],"domain_scores_gemma":[0.9964994,0.002159803,0.0003048267,0.0003780328,0.0003034791,0.0003544293],"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.0002046806,0.00005538499,0.000540369,0.00009123729,0.00004134183,0.0002657913,0.0001923283,0.6404554,0.0006708947,0.3461082,0.002739636,0.008634788],"study_design_scores_gemma":[0.0000409919,0.00004184455,0.0001059374,0.00001769769,0.00002233212,0.00009425147,0.00007493208,0.8660583,0.0001892998,0.1309146,0.002422974,0.00001673597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1458453,0.0009266753,0.8028305,0.002109006,0.0000805245,0.00009584561,0.001340058,0.0004852852,0.0462868],"genre_scores_gemma":[0.930173,0.0005149412,0.05558688,0.0001704809,0.00008103956,0.0001018249,0.0007585314,0.0001056109,0.01250761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009330362,"threshold_uncertainty_score":0.02853328,"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","authors":[{"name":"Çağrı Koç","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"İlknur Tükenmez","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029063,0.001694536,0.002214842,0.003120716,0.0003873241,0.001504855,0.001919227,0.00134835,0.007483081],"category_scores_gemma":[0.00176135,0.0009790447,0.001062465,0.005873605,0.0004963857,0.00261023,0.0009566999,0.001403117,0.003495451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009012989,"about_ca_system_score_gemma":0.002075613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002799517,"about_ca_topic_score_gemma":0.003330777,"domain_scores_codex":[0.9994893,0.0000903592,0.00007290206,0.0001193169,0.0001891504,0.00003885737],"domain_scores_gemma":[0.9992391,0.0004178378,0.0000844508,0.00003429705,0.0001930432,0.00003121222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004558657,0.00009341846,0.0001109077,0.02217848,0.0001067504,0.00004946006,0.00001893027,0.00455024,0.0007297678,0.01113115,0.02704108,0.9339443],"study_design_scores_gemma":[0.00001953771,0.0001739243,0.0004574326,0.005125422,0.0002609979,0.0003946825,0.00004396165,0.002491313,0.0007643405,0.005642622,0.9845766,0.00004910136],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0001832361,0.9908028,0.004877643,0.0002524263,0.0004376029,0.00002007769,0.00007332404,0.000032452,0.003320402],"genre_scores_gemma":[0.001291589,0.9928363,0.003925669,0.0001618602,0.0003108523,0.00002029358,0.0001116084,0.00001169086,0.001330253],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.007483081,"threshold_uncertainty_score":0.02503347,"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","authors":[{"name":"Yuvraj Gajpal","is_ca":true},{"name":"P.L. Abad","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907164,0.0005657881,0.0007650225,0.0004674102,0.000575642,0.0009073638,0.001153629,0.001135273,0.001905678],"category_scores_gemma":[0.001579506,0.0003030641,0.0004213875,0.0008236647,0.0004893899,0.0006956096,0.0008879449,0.0009030268,0.0003121289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004681797,"about_ca_system_score_gemma":0.001518134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005726608,"about_ca_topic_score_gemma":0.004841054,"domain_scores_codex":[0.9994594,0.0001698943,0.00002942883,0.0001001517,0.0001883414,0.00005266704],"domain_scores_gemma":[0.9993833,0.000207992,0.00006252668,0.00005188649,0.0002366358,0.00005760964],"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.0002070511,0.0001436184,0.0005636365,0.0001687926,0.0000407702,0.0001513989,0.00006925634,0.8919242,0.006826785,0.01185041,0.003809141,0.08424484],"study_design_scores_gemma":[0.00001769725,0.0000719116,0.00005154364,0.000002490775,0.000009688051,0.0000260011,0.000008473455,0.9969886,0.0004531586,0.001210474,0.001155759,0.000004219846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07308357,0.0005520551,0.9113413,0.0006070461,0.0003260827,0.000317178,0.0001372234,0.000560681,0.01307483],"genre_scores_gemma":[0.7056282,0.0003775161,0.2852782,0.0001396887,0.0001182608,0.0002843909,0.0001482187,0.00005712694,0.007968235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005726608,"threshold_uncertainty_score":0.01138657,"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","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":true},{"name":"Dragan Urošević","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483032,0.000400159,0.001093011,0.0008836405,0.0009523691,0.001310774,0.001312347,0.001187501,0.004131903],"category_scores_gemma":[0.009959863,0.0005100038,0.0005494716,0.001527963,0.002089017,0.002286821,0.001250216,0.00192944,0.0003164215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00103223,"about_ca_system_score_gemma":0.0006135593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002960508,"about_ca_topic_score_gemma":0.003348397,"domain_scores_codex":[0.9993894,0.000337141,0.00001161223,0.00008867094,0.0001151938,0.00005801478],"domain_scores_gemma":[0.996416,0.002955479,0.0001921133,0.0001695148,0.0001574991,0.0001094355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000901185,0.00006126348,0.0006608202,0.00005254155,0.00002711019,0.00006075555,0.0001285121,0.320722,0.0003525144,0.6450715,0.002378813,0.03039399],"study_design_scores_gemma":[0.00002080064,0.0000158097,0.0001367622,0.00001194592,0.000009466686,0.0000259742,0.00002085976,0.6273617,0.0001432923,0.3708327,0.001413401,0.000007182341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09124337,0.00302722,0.879845,0.0009961105,0.0001523577,0.00003952922,0.00005672406,0.000145164,0.02449453],"genre_scores_gemma":[0.8181966,0.001744886,0.1543872,0.000196161,0.0002108431,0.0001498063,0.0001434187,0.0001493026,0.02482178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004131903,"threshold_uncertainty_score":0.01382262,"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","authors":[{"name":"Nabila Azi","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04793811169959512,"gpt":0.336181081294404,"spread":0.2882429695948089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542859,0.0006202784,0.00132209,0.0009204272,0.0005729817,0.0007356504,0.001843924,0.001768051,0.002441477],"category_scores_gemma":[0.004409245,0.0006789303,0.0007601923,0.0008738068,0.0007858142,0.001540327,0.001433565,0.0009025391,0.0002098757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007595519,"about_ca_system_score_gemma":0.0009325391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006644996,"about_ca_topic_score_gemma":0.005961586,"domain_scores_codex":[0.9995436,0.0002169176,0.00001817688,0.00008347516,0.0001026554,0.00003503144],"domain_scores_gemma":[0.9985021,0.001129405,0.00009536699,0.0000490299,0.0001576232,0.0000665369],"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.00008573439,0.00005779256,0.0002800905,0.00005570209,0.00002557095,0.00004172272,0.00003223234,0.969842,0.0005952917,0.009063426,0.001024987,0.01889539],"study_design_scores_gemma":[0.000008279701,0.00001419964,0.00002001027,0.000002064941,0.000002644855,0.000004387484,0.000003215449,0.9987852,0.00002862388,0.001003075,0.000126546,0.000001717911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0289046,0.0004405401,0.9669146,0.0003019195,0.00009539886,0.00009452349,0.00004747336,0.0000927951,0.003108187],"genre_scores_gemma":[0.510777,0.0004685224,0.4804381,0.0001622189,0.0001382059,0.000483287,0.0001938671,0.00009386108,0.007244934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006644996,"threshold_uncertainty_score":0.01321262,"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","authors":[{"name":"Tasseda Boukherroub","is_ca":true},{"name":"Ángel Ruiz","is_ca":true},{"name":"Alain Guinet","is_ca":false},{"name":"Julien Fondrevelle","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271547,0.0007779804,0.0009097418,0.002829076,0.0009170325,0.003670309,0.001532917,0.001182061,0.009268215],"category_scores_gemma":[0.00241055,0.0009078468,0.001591077,0.004199168,0.0007041211,0.00353567,0.002838733,0.001351161,0.0009308565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001962688,"about_ca_system_score_gemma":0.004118412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0119883,"about_ca_topic_score_gemma":0.02425888,"domain_scores_codex":[0.9986713,0.0003181015,0.00009152747,0.0001603439,0.0006396328,0.0001190672],"domain_scores_gemma":[0.9992835,0.0002119158,0.00005151066,0.0001098851,0.000281304,0.00006200444],"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.00003291297,0.0001841198,0.001477283,0.000172654,0.0001913349,0.0001933005,0.0002787058,0.5747602,0.002242782,0.1726868,0.002991157,0.2447888],"study_design_scores_gemma":[0.00001476769,0.00005833068,0.0006010497,0.00009862599,0.00009115856,0.00008045121,0.0002363359,0.8354697,0.001006748,0.1421886,0.02012636,0.00002791915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003289842,0.0001381734,0.9861431,0.0001873311,0.00002972609,0.00009143513,0.000100386,0.0002132394,0.009806794],"genre_scores_gemma":[0.1111142,0.0005020428,0.8819554,0.00006980407,0.00003572261,0.0002638215,0.000338266,0.0001022345,0.005618469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0119883,"threshold_uncertainty_score":0.03100532,"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","authors":[{"name":"Giusy Macrina","is_ca":false},{"name":"Luigi Di Puglia Pugliese","is_ca":false},{"name":"Francesca Guerriero","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001811167,0.001839876,0.002238877,0.0009835651,0.0006531407,0.002082074,0.002348728,0.002816536,0.004021712],"category_scores_gemma":[0.003354228,0.001453831,0.001393737,0.001414691,0.001187969,0.003719637,0.001435715,0.001451754,0.0002678061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0016674,"about_ca_system_score_gemma":0.001527332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007244112,"about_ca_topic_score_gemma":0.006545035,"domain_scores_codex":[0.9991579,0.0003685735,0.00002754361,0.0001625002,0.000108312,0.0001752306],"domain_scores_gemma":[0.9988039,0.0007383673,0.0001663463,0.00005911849,0.00008270839,0.000149552],"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.0002845963,0.00006233806,0.0003791363,0.0001024293,0.0001015575,0.0002102219,0.00003339231,0.9699668,0.0008679733,0.01821678,0.001419317,0.008355469],"study_design_scores_gemma":[0.00003096636,0.00005665427,0.0002092155,0.000009577345,0.00003030738,0.00005945543,0.00003317906,0.9840443,0.0002408616,0.0145932,0.0006801732,0.00001213596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2050999,0.001542121,0.7784731,0.002126877,0.0002836515,0.0002066118,0.00114179,0.000276399,0.01084946],"genre_scores_gemma":[0.8904542,0.0007961186,0.08606885,0.0003036024,0.0001566893,0.0002103764,0.0005719391,0.0001706856,0.02126748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007244112,"threshold_uncertainty_score":0.01440388,"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","authors":[{"name":"Markus Biehl","is_ca":true},{"name":"Edmund Prater","is_ca":false},{"name":"Matthew J. Realff","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008072405,0.0007345966,0.0004832759,0.001379698,0.0008473098,0.002195091,0.0007677316,0.001168597,0.0006655012],"category_scores_gemma":[0.02464555,0.0004661159,0.000507549,0.001029061,0.0006341007,0.002537356,0.0009734032,0.0009957517,0.0001107317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005100249,"about_ca_system_score_gemma":0.002738476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02151767,"about_ca_topic_score_gemma":0.01404989,"domain_scores_codex":[0.9974622,0.001115612,0.0002168328,0.0002226391,0.000607382,0.0003752951],"domain_scores_gemma":[0.9808118,0.01482,0.0012253,0.0004180343,0.002330799,0.0003939094],"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.0007382445,0.0003278293,0.02742763,0.000052815,0.00006613155,0.00008637667,0.0002782161,0.9421222,0.003573964,0.001377009,0.00008628603,0.02386327],"study_design_scores_gemma":[0.00002571751,0.0009839296,0.009805653,0.00001067574,0.00004211916,0.00001534607,0.000302432,0.9777063,0.01017328,0.0008173065,0.00009048186,0.00002686142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9918004,0.00002342501,0.00718358,0.00004201289,0.000002614483,0.00003911191,0.00002673916,0.00002654183,0.0008555386],"genre_scores_gemma":[0.9961124,0.00001443469,0.003656093,0.000003139035,0.000001057269,0.00001532872,0.00004917213,0.000002608374,0.0001458582],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02151767,"threshold_uncertainty_score":0.04278481,"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","authors":[{"name":"Ivo Blöchliger","is_ca":false},{"name":"Nicolas Zufferey","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713326,0.0007716269,0.00101032,0.001832626,0.001405906,0.001152439,0.003472357,0.001398865,0.006841286],"category_scores_gemma":[0.003236329,0.0007860666,0.0009214165,0.002105733,0.0008725862,0.001332129,0.001097597,0.001020198,0.0007204256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001481892,"about_ca_system_score_gemma":0.002363231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008888016,"about_ca_topic_score_gemma":0.009264984,"domain_scores_codex":[0.9992759,0.000328081,0.00002779425,0.0001065911,0.0001394435,0.0001221938],"domain_scores_gemma":[0.9987208,0.0006001074,0.00008757601,0.0002757017,0.0002211971,0.00009453371],"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.0004781032,0.0003649629,0.00046223,0.000162133,0.00007279806,0.00006732759,0.0001398101,0.790867,0.006919388,0.0292116,0.003883569,0.1673711],"study_design_scores_gemma":[0.0001274911,0.000138219,0.0001304629,0.00001323604,0.00003371912,0.00002158151,0.00002720494,0.9920834,0.001525639,0.00471338,0.001164168,0.00002157651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0997325,0.0002727495,0.8824962,0.0003260198,0.0002444876,0.0006243643,0.0002744133,0.002016528,0.01401274],"genre_scores_gemma":[0.3325832,0.0000987513,0.6624371,0.0001482361,0.00004059743,0.0003679309,0.0002882437,0.0002529497,0.003782995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008888016,"threshold_uncertainty_score":0.02288634,"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)","authors":[{"name":"Roberto Aringhieri","is_ca":false},{"name":"Paolo Landa","is_ca":false},{"name":"Patrick Soriano","is_ca":true},{"name":"Elena Tànfani","is_ca":false},{"name":"Angela Testi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156345,0.001099433,0.001568293,0.001473756,0.0007341012,0.001698341,0.002438311,0.003260506,0.005834966],"category_scores_gemma":[0.00308178,0.0007948712,0.001793781,0.001563718,0.0007057213,0.001283706,0.001957223,0.002234503,0.0006097119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001614562,"about_ca_system_score_gemma":0.002564496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006982851,"about_ca_topic_score_gemma":0.006287134,"domain_scores_codex":[0.9990816,0.0004207634,0.00003496686,0.00009188656,0.0001946315,0.0001760878],"domain_scores_gemma":[0.9989691,0.0006386374,0.00008042672,0.00007145588,0.000134274,0.0001061156],"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.0001279569,0.0001647272,0.0002700041,0.00006553976,0.00006559736,0.0000382826,0.00003141697,0.9570958,0.0008360664,0.007812604,0.001637655,0.03185428],"study_design_scores_gemma":[0.00005645333,0.00006768968,0.00007702183,0.000009033496,0.00001601391,0.000008300242,0.000009445001,0.9968299,0.0001372131,0.00223941,0.0005437616,0.000005731787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05175603,0.0006298993,0.9314025,0.0008279763,0.0003001739,0.0002790802,0.0002767405,0.0007856662,0.01374191],"genre_scores_gemma":[0.3269559,0.0002978263,0.6637032,0.0006276331,0.0001615083,0.0006230584,0.0004064767,0.0002124877,0.007011834],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006982851,"threshold_uncertainty_score":0.01951993,"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","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Frank Xiaolong Hu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009188705,0.001139293,0.001144205,0.0007631581,0.0007097397,0.0009169814,0.001354331,0.001239634,0.003761375],"category_scores_gemma":[0.00244978,0.0007872206,0.000605004,0.0006890072,0.0006513015,0.001383268,0.001259977,0.0008130179,0.000369448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118524,"about_ca_system_score_gemma":0.001223429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002702358,"about_ca_topic_score_gemma":0.003712704,"domain_scores_codex":[0.9996332,0.0001294981,0.00001128944,0.00008968414,0.00006692013,0.00006936641],"domain_scores_gemma":[0.9994536,0.0002396293,0.0000613786,0.00004896946,0.0001449287,0.00005157562],"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.0000558607,0.0000202803,0.000110478,0.00004256789,0.00001618461,0.00002482956,0.00001836462,0.9770082,0.0009307339,0.01098892,0.0005469767,0.01023676],"study_design_scores_gemma":[0.00001000239,0.00004601953,0.00003217492,0.000004910703,0.00001212971,0.00001081927,0.00001151057,0.9923759,0.0004837283,0.006349379,0.0006589194,0.000004594492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02387235,0.0001597449,0.9685891,0.0001431069,0.00007391341,0.00007981997,0.00007409323,0.0001534839,0.006854494],"genre_scores_gemma":[0.8076747,0.0004625743,0.1756492,0.00008860441,0.00006052007,0.0002569628,0.0001204705,0.0001381424,0.01554883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003761375,"threshold_uncertainty_score":0.01258308,"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","authors":[{"name":"Wade D. Cook","is_ca":true},{"name":"Joe Zhu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01337495,0.00235701,0.004466416,0.002734976,0.001335737,0.004786364,0.003436962,0.002112769,0.005729426],"category_scores_gemma":[0.02363297,0.001806698,0.002384235,0.005771304,0.001491455,0.004496236,0.002107293,0.003020273,0.0005344126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003712957,"about_ca_system_score_gemma":0.003700455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006546666,"about_ca_topic_score_gemma":0.006057212,"domain_scores_codex":[0.9901159,0.006163569,0.0004696261,0.0009398889,0.001810902,0.0005000057],"domain_scores_gemma":[0.9853653,0.01128381,0.0008070613,0.0009743684,0.001386927,0.000182561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000716144,0.0001250459,0.00039361,0.0001052837,0.0002660016,0.00004058863,0.00007880184,0.8893421,0.0003641773,0.07263296,0.0004783274,0.03610146],"study_design_scores_gemma":[0.00001523383,0.00002460803,0.0001307226,0.00001840895,0.00005824462,0.0000162462,0.00002515983,0.962226,0.000292542,0.03644994,0.0007322546,0.00001055861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006698582,0.0001528734,0.9905918,0.0001262426,0.00002761076,0.0001229932,0.00006730112,0.00003809969,0.002174387],"genre_scores_gemma":[0.3203239,0.0006569007,0.6726157,0.000151733,0.0001091892,0.00118083,0.0003045293,0.00009566233,0.004561582],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01337495,"threshold_uncertainty_score":0.07073438,"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","authors":[{"name":"Claudio Contardo","is_ca":true},{"name":"Vera Hemmelmayr","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004913009,0.002791303,0.002167281,0.003874598,0.001392145,0.006430734,0.004573725,0.003204289,0.01910477],"category_scores_gemma":[0.0222892,0.0009176754,0.001974544,0.004669451,0.001884605,0.00782499,0.003681014,0.006105624,0.003425587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003903175,"about_ca_system_score_gemma":0.00242254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00239506,"about_ca_topic_score_gemma":0.003059901,"domain_scores_codex":[0.9948626,0.001304126,0.0002305883,0.0007176233,0.002037156,0.0008479159],"domain_scores_gemma":[0.9842544,0.01191739,0.0009355734,0.0009056041,0.001426975,0.000560069],"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.0002305811,0.0002851126,0.0008410559,0.0008588482,0.0001058608,0.0001995425,0.0001833226,0.5985916,0.001882004,0.2898446,0.01841914,0.08855828],"study_design_scores_gemma":[0.00003888922,0.00008149373,0.0004080408,0.0002044715,0.00004335452,0.0001966534,0.00008968927,0.8198891,0.001298279,0.1654892,0.01221844,0.00004237551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01295124,0.007423044,0.9088476,0.003057393,0.0005470305,0.0001975266,0.00114592,0.0005805526,0.06524971],"genre_scores_gemma":[0.3988202,0.01067627,0.5597091,0.001304827,0.00165752,0.001309305,0.003531307,0.001147188,0.02184408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01910477,"threshold_uncertainty_score":0.06391186,"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","authors":[{"name":"Ayoub Insa Corréa","is_ca":true},{"name":"André Langevin","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009700204,0.001190931,0.001814404,0.001748279,0.0009427525,0.002440713,0.002712152,0.001756913,0.002970343],"category_scores_gemma":[0.001563513,0.001101213,0.001784384,0.001984792,0.0009029739,0.001738763,0.001663482,0.000888173,0.0004092363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152902,"about_ca_system_score_gemma":0.001414449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007386585,"about_ca_topic_score_gemma":0.007391786,"domain_scores_codex":[0.9992055,0.0002562387,0.00003397719,0.0001221472,0.0002541763,0.0001280039],"domain_scores_gemma":[0.9990977,0.00050008,0.00008309678,0.00007639146,0.0001618111,0.0000808069],"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.0001026399,0.00006600923,0.0002990199,0.00008597404,0.0001334774,0.00005635106,0.00005845206,0.9544355,0.001612003,0.01091202,0.0005509947,0.03168751],"study_design_scores_gemma":[0.00001049018,0.00002166761,0.00004373184,0.000002521324,0.00001651225,0.000007553126,0.00001293567,0.9967377,0.0001349926,0.00273532,0.0002719483,0.000004604926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03604781,0.0006682083,0.9563518,0.0002745629,0.0001694352,0.00008000285,0.00006916845,0.0002956741,0.00604336],"genre_scores_gemma":[0.6584333,0.0007560126,0.3304318,0.0002208063,0.0003589218,0.0003265394,0.0002081224,0.0002253024,0.009039178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007386585,"threshold_uncertainty_score":0.01468718,"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","authors":[{"name":"Slim Belhaiza","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000812923,0.0004896174,0.001079723,0.0008526455,0.0005628625,0.0008218999,0.001936116,0.001380148,0.00413086],"category_scores_gemma":[0.001628513,0.0005471861,0.0006587483,0.001203688,0.0003630324,0.000874974,0.0006756384,0.0006269248,0.0005163584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008169961,"about_ca_system_score_gemma":0.001071747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006544632,"about_ca_topic_score_gemma":0.006489536,"domain_scores_codex":[0.9996321,0.0001475496,0.00001429491,0.00004223901,0.0001084609,0.00005528917],"domain_scores_gemma":[0.99943,0.0003319492,0.00004643226,0.00004404729,0.0001125135,0.00003505161],"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.0002085865,0.0001316221,0.0003646872,0.0000750516,0.00006130734,0.00005712021,0.00004240092,0.9025411,0.001903355,0.005065002,0.001983508,0.08756626],"study_design_scores_gemma":[0.00003320029,0.00005507213,0.00008442706,0.000005344225,0.00001114612,0.00001346269,0.000008408591,0.9982411,0.0002571799,0.0007564721,0.0005290196,0.000005178368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09658539,0.0012168,0.8902723,0.0002553068,0.0002626751,0.0001819536,0.000188721,0.0008581491,0.01017874],"genre_scores_gemma":[0.4969328,0.0003638617,0.4957435,0.0001901752,0.00007664526,0.0003673216,0.0002628571,0.0002185706,0.005844247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006544632,"threshold_uncertainty_score":0.01381916,"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","authors":[{"name":"Erhan Erkut","is_ca":true},{"name":"Osman Alp","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008451311,0.0006660545,0.0004790883,0.002267485,0.002324509,0.00146155,0.00143122,0.001113696,0.01155963],"category_scores_gemma":[0.002787799,0.0005846552,0.0005893573,0.001233465,0.0005280818,0.002154463,0.001463659,0.0004914894,0.002205127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001357677,"about_ca_system_score_gemma":0.002387512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01149867,"about_ca_topic_score_gemma":0.02112512,"domain_scores_codex":[0.9992886,0.0002715161,0.00003449834,0.0001374492,0.0001274188,0.0001404857],"domain_scores_gemma":[0.9988078,0.0003224532,0.0001414775,0.0001477035,0.0003798087,0.0002007758],"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.0003906322,0.0005613444,0.00940793,0.0002180046,0.00006250967,0.0005358469,0.000590431,0.7721227,0.02473463,0.02217638,0.005218524,0.1639811],"study_design_scores_gemma":[0.00006507396,0.0009313293,0.003366139,0.00006272214,0.000111585,0.000201766,0.001728849,0.9416501,0.01770625,0.01121016,0.02289542,0.00007060471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2768584,0.0001311812,0.688505,0.0004725956,0.00008938835,0.00111268,0.000553473,0.002574289,0.02970301],"genre_scores_gemma":[0.6907938,0.0001983589,0.2961764,0.0000413612,0.00001649346,0.0004689294,0.0006158956,0.0001663623,0.01152247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01155963,"threshold_uncertainty_score":0.03867084,"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","authors":[{"name":"Giusy Macrina","is_ca":false},{"name":"Luigi Di Puglia Pugliese","is_ca":false},{"name":"Francesca Guerriero","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606707,0.0008500423,0.0009700379,0.0008337966,0.0007180756,0.001420632,0.001710001,0.0008202169,0.007867374],"category_scores_gemma":[0.007067863,0.000651988,0.0009959495,0.00133415,0.0009160187,0.003709108,0.001858487,0.001151542,0.0005407187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008335781,"about_ca_system_score_gemma":0.000743089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007369386,"about_ca_topic_score_gemma":0.005931263,"domain_scores_codex":[0.9992564,0.0002093727,0.00003396907,0.0002265122,0.00008025743,0.0001933987],"domain_scores_gemma":[0.9959918,0.002330671,0.000537786,0.0004580111,0.0002519925,0.0004298838],"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.0007208171,0.00008950759,0.003449373,0.00008644049,0.00007878366,0.0003060919,0.0001717757,0.8915517,0.00125342,0.07660985,0.002078905,0.02360335],"study_design_scores_gemma":[0.00001525908,0.000071708,0.0007188431,0.00001171209,0.00003673648,0.00008712738,0.0001210744,0.9567585,0.0006574183,0.04040053,0.001103357,0.00001774503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4288566,0.0008167732,0.555671,0.0003632123,0.000210112,0.0001042399,0.0007324095,0.0004912895,0.01275432],"genre_scores_gemma":[0.9518715,0.0003262238,0.03265429,0.00003304748,0.00006368628,0.00004244485,0.0003574511,0.0001227708,0.01452872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007867374,"threshold_uncertainty_score":0.02631897,"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","authors":[{"name":"Chien‐Ta Bruce Ho","is_ca":false},{"name":"Desheng Wu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004665585,0.0006794669,0.0009533918,0.004371238,0.0004991919,0.002201503,0.0003917481,0.0005011012,0.003274576],"category_scores_gemma":[0.01396732,0.0002209868,0.0007453198,0.005031201,0.0002917273,0.003499331,0.0009503876,0.0004811039,0.0009190475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001344356,"about_ca_system_score_gemma":0.001069381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00287747,"about_ca_topic_score_gemma":0.002660596,"domain_scores_codex":[0.9950678,0.002073275,0.0003378276,0.000260149,0.001971775,0.0002892225],"domain_scores_gemma":[0.9899345,0.005387562,0.0007300199,0.0008245555,0.00293713,0.0001862576],"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.00209303,0.002415473,0.117494,0.00036089,0.000408855,0.0001781115,0.000726581,0.1572775,0.01056448,0.008761185,0.002930954,0.6967888],"study_design_scores_gemma":[0.0001017153,0.001643245,0.1255686,0.0000786379,0.0002421164,0.0001497463,0.0009763582,0.8397252,0.02329651,0.005837038,0.002273434,0.0001073818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.900455,0.0002197504,0.08791588,0.000120507,0.00002335512,0.0002287528,0.0004636663,0.0005886033,0.009984522],"genre_scores_gemma":[0.9753315,0.00008146821,0.02309826,0.00001060927,0.000009087901,0.00007156176,0.000300142,0.00004044917,0.001057037],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004665585,"threshold_uncertainty_score":0.02467424,"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","authors":[{"name":"Çağrı Koç","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532014,0.001156878,0.002148818,0.001826079,0.0002533068,0.002254575,0.001958579,0.001465387,0.002187863],"category_scores_gemma":[0.002021377,0.0005806542,0.0008216109,0.004307019,0.0007409299,0.002533646,0.0007191031,0.001383965,0.0009008328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007411537,"about_ca_system_score_gemma":0.001680379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001734804,"about_ca_topic_score_gemma":0.001673906,"domain_scores_codex":[0.999428,0.000133462,0.00005670885,0.0001544281,0.0001808917,0.00004654131],"domain_scores_gemma":[0.9987072,0.0007988082,0.0001405267,0.00004719393,0.0002690945,0.00003725594],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009838048,0.0001225511,0.0004499902,0.01853598,0.0002488695,0.0001057307,0.00006478369,0.01255336,0.001087222,0.02070085,0.009050819,0.9369815],"study_design_scores_gemma":[0.0000903288,0.0005492182,0.001457923,0.009427314,0.0008859592,0.001480291,0.000380706,0.02344354,0.002728902,0.03802812,0.9213842,0.0001436396],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0005819479,0.990119,0.006971889,0.0003740893,0.0002483529,0.00001096877,0.00002050597,0.00001573088,0.001657508],"genre_scores_gemma":[0.007367182,0.9866003,0.004623932,0.0001743451,0.0004960093,0.00001507519,0.00004767357,0.000009074829,0.0006663693],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.002254575,"threshold_uncertainty_score":0.008102179,"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","authors":[{"name":"Irina Gribkovskaia","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Aliaksandr Shyshou","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001458131,0.001303999,0.002543735,0.0009422276,0.0008988669,0.001848666,0.002877107,0.002154846,0.005929874],"category_scores_gemma":[0.004511182,0.001407139,0.001618458,0.002091526,0.001171118,0.00337772,0.001254963,0.001620476,0.0006005798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135167,"about_ca_system_score_gemma":0.001408311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002838782,"about_ca_topic_score_gemma":0.002690054,"domain_scores_codex":[0.9990205,0.0003260617,0.00004347655,0.0002594473,0.0001485416,0.0002021075],"domain_scores_gemma":[0.9980119,0.001324254,0.000260819,0.0001295168,0.0001133836,0.0001601205],"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.000402421,0.0001390148,0.0005939016,0.0003168139,0.0001110752,0.0003418457,0.00005772503,0.9092014,0.001248402,0.05189371,0.004073551,0.03162008],"study_design_scores_gemma":[0.00006949949,0.0001450945,0.0004442645,0.00002084796,0.00006342925,0.0002189013,0.00007619418,0.9271697,0.0009375241,0.06856068,0.002266707,0.00002715518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2040689,0.002637354,0.7736144,0.001955296,0.0004106474,0.0002363697,0.001000502,0.0002679051,0.01580865],"genre_scores_gemma":[0.825076,0.002115053,0.13969,0.0002314733,0.0004652927,0.0002470489,0.0006768051,0.0002044729,0.03129384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005929874,"threshold_uncertainty_score":0.01983744,"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","authors":[{"name":"Claudia Archetti","is_ca":false},{"name":"Ola Jabali","is_ca":true},{"name":"M. Grazia Speranza","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002832303,0.001771665,0.003809046,0.001331508,0.00118584,0.003284242,0.003486374,0.003615168,0.009502313],"category_scores_gemma":[0.00609614,0.001648065,0.001862949,0.0024803,0.0008618631,0.003455158,0.001563682,0.002175333,0.000784374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001776366,"about_ca_system_score_gemma":0.002000794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003183012,"about_ca_topic_score_gemma":0.00266998,"domain_scores_codex":[0.9980391,0.0007511156,0.0001176198,0.0004310001,0.0002319479,0.0004291472],"domain_scores_gemma":[0.9959484,0.002713235,0.0004551682,0.0001949983,0.0001998006,0.0004884272],"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.001066021,0.0002733304,0.000888143,0.0007141141,0.0003197571,0.00106304,0.0001145449,0.923991,0.002531361,0.03685955,0.00899066,0.0231885],"study_design_scores_gemma":[0.0002226181,0.0003338303,0.000762428,0.00003591517,0.00008672349,0.0003052495,0.00007670229,0.9591292,0.0007771053,0.0355417,0.002683423,0.00004502821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2200605,0.003828078,0.7391251,0.004583973,0.0009994045,0.0007130885,0.0055315,0.0007375017,0.02442079],"genre_scores_gemma":[0.8647455,0.001574074,0.1024986,0.0003292701,0.0004888396,0.0005552538,0.001609097,0.0003041144,0.02789526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009502313,"threshold_uncertainty_score":0.03178841,"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","authors":[{"name":"Nathalie Perrier","is_ca":true},{"name":"André Langevin","is_ca":true},{"name":"James F. Campbell","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000623241,0.001426337,0.001412027,0.0008432106,0.0004135404,0.001354452,0.001978714,0.001184247,0.003839498],"category_scores_gemma":[0.001475946,0.0008761587,0.001021699,0.002072298,0.000459022,0.001802358,0.0005092601,0.001141297,0.001742036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001158298,"about_ca_system_score_gemma":0.001113764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004094019,"about_ca_topic_score_gemma":0.004843306,"domain_scores_codex":[0.9996909,0.0000788898,0.00002701564,0.00007498241,0.00009966226,0.00002854634],"domain_scores_gemma":[0.9995992,0.0002197986,0.00003836562,0.00005253319,0.00007500428,0.00001518146],"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.00004551668,0.00009015975,0.0006751723,0.0007937157,0.00007379567,0.00003258594,0.00006397333,0.7338681,0.001452809,0.04295915,0.01189778,0.2080473],"study_design_scores_gemma":[0.00001855083,0.00006138782,0.0003277689,0.0001359692,0.00004533224,0.00009572658,0.0000283644,0.904809,0.0008505054,0.05671206,0.03689481,0.00002058536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003770421,0.02314358,0.9658971,0.0003890954,0.0001300162,0.00003894984,0.0003040062,0.0004108021,0.005916049],"genre_scores_gemma":[0.2031369,0.1106906,0.6661558,0.0003641642,0.0007642382,0.0004940876,0.001709668,0.0004705337,0.0162141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004094019,"threshold_uncertainty_score":0.01284438,"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","authors":[{"name":"H. A. Eiselt","is_ca":true},{"name":"Vladimir Marianov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000531384,0.000799317,0.001330506,0.0007768258,0.0009970207,0.001547383,0.002268605,0.002487953,0.008327993],"category_scores_gemma":[0.001942141,0.001031846,0.001538892,0.001512341,0.0005640704,0.001232063,0.001137568,0.001126461,0.00084142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002853299,"about_ca_system_score_gemma":0.002758662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1680389,"about_ca_topic_score_gemma":0.09932651,"domain_scores_codex":[0.9995831,0.000144583,0.00001757941,0.00007513165,0.00005890153,0.0001207546],"domain_scores_gemma":[0.9991658,0.0004552457,0.00009085931,0.00004828213,0.0001648826,0.0000749652],"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.00001441858,0.00001594252,0.0003895046,0.00001026369,0.000007904415,0.0000211319,0.0000135645,0.9963159,0.00008676836,0.001726599,0.0002426554,0.001155512],"study_design_scores_gemma":[0.000006252611,0.000007618791,0.000128788,0.00000307555,0.000004921562,0.000004424835,0.00002035261,0.9987079,0.00006934393,0.0007549012,0.0002881633,0.000004356808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5311309,0.001133187,0.4243363,0.001647342,0.0002096886,0.0002316406,0.003580527,0.001277435,0.036453],"genre_scores_gemma":[0.9652763,0.0002855729,0.01721688,0.00007247519,0.00003703768,0.0001355051,0.0006886255,0.0001541023,0.01613365],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1680389,"threshold_uncertainty_score":0.3341216,"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","authors":[{"name":"Leandro C. Coelho","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002271295,0.00131554,0.001834812,0.001632407,0.0009355035,0.002067157,0.002366164,0.001833232,0.005872319],"category_scores_gemma":[0.008097594,0.001384296,0.001310521,0.002452055,0.001485959,0.002279615,0.001483782,0.002200164,0.0006554855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003123021,"about_ca_system_score_gemma":0.00300139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01186862,"about_ca_topic_score_gemma":0.01486186,"domain_scores_codex":[0.9986175,0.0006784836,0.00006300538,0.0001732414,0.0002837096,0.000184137],"domain_scores_gemma":[0.9960729,0.003100846,0.0001957755,0.0002527139,0.0002524821,0.0001252837],"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.00005640848,0.00005397859,0.0001242631,0.00008945855,0.00003588747,0.00002852556,0.00003699814,0.9146115,0.0002456461,0.05638956,0.002431049,0.02589669],"study_design_scores_gemma":[0.00002940323,0.00001538105,0.00004934311,0.00001594142,0.00001128231,0.00001160301,0.00001358829,0.9572093,0.0001129958,0.04102985,0.001492925,0.000008339087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008397214,0.001006116,0.983008,0.0002537676,0.0001804109,0.0001252222,0.0001837432,0.0003775517,0.006467932],"genre_scores_gemma":[0.2659436,0.001400222,0.7224358,0.000225057,0.0002423215,0.0004077449,0.0004563583,0.000281402,0.008607606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01186862,"threshold_uncertainty_score":0.02359909,"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","authors":[{"name":"Mario Ventresca","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001962201,0.001505295,0.00221851,0.001767488,0.0008191129,0.001651368,0.002097728,0.001968181,0.003535481],"category_scores_gemma":[0.009104242,0.0006864638,0.0009240329,0.002102051,0.001120918,0.003141949,0.001891688,0.002303492,0.0005048234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009837174,"about_ca_system_score_gemma":0.001840859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004039485,"about_ca_topic_score_gemma":0.005865119,"domain_scores_codex":[0.9989146,0.0005037885,0.00004871571,0.0002473282,0.0001912638,0.00009436216],"domain_scores_gemma":[0.9942432,0.004593893,0.0002947241,0.0002939261,0.0004065157,0.0001676689],"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.00009685555,0.0001820345,0.0005352517,0.0001368573,0.00005395308,0.00005143174,0.00008585297,0.8631552,0.0008198224,0.04912163,0.00407958,0.08168156],"study_design_scores_gemma":[0.00002460666,0.00002686289,0.00003298874,0.000004568823,0.000007010905,0.00000827475,0.00000880437,0.9769843,0.0001134632,0.02255068,0.0002342874,0.000004127225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006855175,0.0001377275,0.9912745,0.0002276293,0.00002809645,0.00005768459,0.00004426764,0.0001629552,0.001211887],"genre_scores_gemma":[0.2799405,0.0003428351,0.7134056,0.0002617033,0.0001961406,0.000466299,0.0005629609,0.0002075217,0.004616358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004039485,"threshold_uncertainty_score":0.01182735,"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","authors":[{"name":"Alexandre Deslauriers","is_ca":true},{"name":"Pierre L’Ecuyer","is_ca":true},{"name":"Juta Pichitlamken","is_ca":false},{"name":"Ármann Ingólfsson","is_ca":true},{"name":"Athanassios N. Avramidis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002488077,0.001116732,0.002100849,0.0014532,0.001618277,0.004658843,0.003929257,0.004110167,0.02198544],"category_scores_gemma":[0.007849937,0.001850544,0.001346262,0.002343459,0.002617881,0.004294027,0.001731864,0.00330192,0.002248695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00400668,"about_ca_system_score_gemma":0.003028474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04392703,"about_ca_topic_score_gemma":0.02371483,"domain_scores_codex":[0.9985865,0.0004212491,0.00004539862,0.0002960664,0.0001720124,0.0004787573],"domain_scores_gemma":[0.9934977,0.004053222,0.0006953742,0.0003223002,0.0006196984,0.0008117825],"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.0002638554,0.0001367672,0.001253201,0.00003498629,0.00004263635,0.0002412302,0.0001744631,0.8432047,0.0006138809,0.1485328,0.002860482,0.002640988],"study_design_scores_gemma":[0.00004235818,0.00002180346,0.0002430301,0.000007454058,0.00001980152,0.00001948717,0.00003191636,0.9797668,0.00007862802,0.01938246,0.0003599678,0.00002627861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4001136,0.001283372,0.5409993,0.0049779,0.0003948084,0.0003401728,0.003125413,0.001173727,0.04759173],"genre_scores_gemma":[0.9479225,0.0006019454,0.009580449,0.000193413,0.0001695297,0.0001998238,0.000716239,0.0001267644,0.04048936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04392703,"threshold_uncertainty_score":0.08734274,"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","authors":[{"name":"H. A. Eiselt","is_ca":true},{"name":"Vladimir Marianov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659377,0.001033121,0.003104991,0.001242293,0.001159438,0.002530234,0.003600657,0.005177183,0.01986136],"category_scores_gemma":[0.01466302,0.00156246,0.001366214,0.002514239,0.002210072,0.005466554,0.002910487,0.003225504,0.0009615981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002115117,"about_ca_system_score_gemma":0.001530443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006724549,"about_ca_topic_score_gemma":0.004479907,"domain_scores_codex":[0.9989043,0.0005042241,0.00003846141,0.0002756848,0.00009298308,0.0001842294],"domain_scores_gemma":[0.9904951,0.007709022,0.0005059851,0.0003201225,0.0003933469,0.0005764877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005412441,0.0001885474,0.001398552,0.0004573651,0.0001157655,0.0005719244,0.0001329256,0.5354486,0.0006181001,0.4223665,0.01891763,0.01924282],"study_design_scores_gemma":[0.0001612305,0.00007110224,0.0004016129,0.00003795339,0.00004487806,0.000122789,0.00008718261,0.7526464,0.0002574548,0.2442659,0.001866355,0.00003718173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1238672,0.001193667,0.8396918,0.007327809,0.0002063144,0.0001921065,0.002134114,0.0005489254,0.02483822],"genre_scores_gemma":[0.8743983,0.001096447,0.0863128,0.0005477642,0.0003813591,0.0003233859,0.001640929,0.0002191375,0.03507986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01986136,"threshold_uncertainty_score":0.06644291,"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","authors":[{"name":"Zhihao Luo","is_ca":false},{"name":"Ruixue Gu","is_ca":false},{"name":"Mark Poon","is_ca":true},{"name":"Zhong Liu","is_ca":false},{"name":"Andrew Lim","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104601,0.002515167,0.005720298,0.001595168,0.002057132,0.003806043,0.005820934,0.006830859,0.01028118],"category_scores_gemma":[0.003934895,0.002456472,0.003225504,0.002558111,0.001728313,0.003845946,0.003318353,0.003200345,0.001140265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002067786,"about_ca_system_score_gemma":0.002225733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01460167,"about_ca_topic_score_gemma":0.01044907,"domain_scores_codex":[0.9985254,0.000441361,0.00006845207,0.0004273487,0.0001641893,0.0003732503],"domain_scores_gemma":[0.9972879,0.001578451,0.000286174,0.0001616496,0.000175159,0.0005108146],"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.0004771673,0.0002396343,0.0006940718,0.0002853448,0.0001279031,0.0006385953,0.0001009809,0.9769876,0.0008131242,0.007119051,0.002720324,0.009796138],"study_design_scores_gemma":[0.00008635322,0.0002020985,0.0002590269,0.00001809192,0.00004904288,0.0001212081,0.0001322516,0.994077,0.0003186958,0.003903988,0.0008032763,0.00002906978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3438534,0.00230592,0.6262406,0.002485575,0.0006840068,0.001014355,0.002981322,0.000722044,0.01971288],"genre_scores_gemma":[0.8908247,0.0008197665,0.08213355,0.0002273908,0.0002154023,0.0003963098,0.001307342,0.0002097387,0.02386586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01460167,"threshold_uncertainty_score":0.03439397,"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","authors":[{"name":"Nader Azizi","is_ca":false},{"name":"Satyaveer S. Chauhan","is_ca":true},{"name":"Saı̈d Salhi","is_ca":false},{"name":"Navneet Vidyarthi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003182196,0.002034413,0.002264956,0.00218332,0.001301516,0.003012293,0.002921641,0.004118651,0.005734079],"category_scores_gemma":[0.01334109,0.001817085,0.001767158,0.00297979,0.002631679,0.004494666,0.002297375,0.003442765,0.0005033001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00353426,"about_ca_system_score_gemma":0.002270879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02182473,"about_ca_topic_score_gemma":0.01660702,"domain_scores_codex":[0.9989505,0.00042036,0.0000308684,0.0001654669,0.0002188212,0.0002139561],"domain_scores_gemma":[0.9940147,0.004618644,0.0005278046,0.0001035842,0.0005563635,0.0001790395],"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.0000151961,0.00002401564,0.000212182,0.00008674373,0.00002060403,0.00006639264,0.00003298046,0.9665307,0.000138746,0.0282798,0.001594027,0.002998547],"study_design_scores_gemma":[0.000003351651,0.000006814205,0.0001076541,0.00001895447,0.00001499156,0.00001802379,0.00003896641,0.9851207,0.00006217178,0.01418037,0.0004199312,0.000008099899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04627929,0.006927663,0.9064922,0.004428368,0.0007250401,0.0001916218,0.0006964677,0.000196462,0.0340629],"genre_scores_gemma":[0.8775344,0.01117714,0.05942832,0.0007174973,0.001053623,0.0004820583,0.0004890637,0.0003471037,0.04877067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02182473,"threshold_uncertainty_score":0.04339534,"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","authors":[{"name":"Edward Lam","is_ca":false},{"name":"Guy Desaulniers","is_ca":true},{"name":"Peter J. Stuckey","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003022406,0.002160133,0.002936265,0.00147741,0.0008883338,0.002653968,0.002607001,0.003020783,0.01202251],"category_scores_gemma":[0.007209696,0.001548552,0.001513606,0.00275834,0.001615461,0.003866639,0.00139307,0.003228538,0.0007758773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003087264,"about_ca_system_score_gemma":0.003191174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01644009,"about_ca_topic_score_gemma":0.01233955,"domain_scores_codex":[0.999116,0.000427149,0.00003363593,0.0001329537,0.0001383437,0.0001518629],"domain_scores_gemma":[0.99609,0.003321701,0.0001669804,0.00008219501,0.0001516572,0.0001875229],"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.0002767212,0.000173671,0.0003820289,0.000270354,0.00006265238,0.00009910347,0.00005414304,0.9352859,0.0004021781,0.03366354,0.004138738,0.02519096],"study_design_scores_gemma":[0.00003896323,0.00005043404,0.0001185264,0.00001522445,0.00002386501,0.00001868749,0.00001857117,0.9782296,0.0001079716,0.02078193,0.0005881471,0.000007988413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05611145,0.002682874,0.9197466,0.001971772,0.0002222347,0.0004305147,0.000793746,0.0004726967,0.01756812],"genre_scores_gemma":[0.581113,0.004560099,0.3761964,0.0003566019,0.0004423936,0.0008601264,0.001576062,0.0005309095,0.03436442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01644009,"threshold_uncertainty_score":0.04021937,"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","authors":[{"name":"Amir M. Fathollahi‐Fard","is_ca":true},{"name":"Guangdong Tian","is_ca":false},{"name":"Hua Ke","is_ca":false},{"name":"Yaping Fu","is_ca":false},{"name":"Kuan Yew Wong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994781,0.0008241585,0.0009240492,0.001065357,0.0005532897,0.0007963883,0.00116918,0.001482845,0.002972135],"category_scores_gemma":[0.00108654,0.0004641431,0.0007921042,0.001149927,0.0003662285,0.0006279004,0.0007191015,0.001005756,0.0002804456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008727936,"about_ca_system_score_gemma":0.001473962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005082698,"about_ca_topic_score_gemma":0.005111486,"domain_scores_codex":[0.9997304,0.0000968544,0.00001099928,0.0000414529,0.00006412187,0.00005619317],"domain_scores_gemma":[0.9996784,0.0001905545,0.00003525489,0.0000165254,0.00005738118,0.00002180163],"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.00007178193,0.00008891902,0.0002657618,0.00006393057,0.00003817185,0.00004938688,0.00002276239,0.9607255,0.001071047,0.003995846,0.001261734,0.03234524],"study_design_scores_gemma":[0.00002793829,0.00003114834,0.00007609373,0.00000614687,0.000009436888,0.000010264,0.000007298218,0.9981103,0.0002055017,0.001190197,0.00032326,0.000002465302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09102426,0.001137224,0.8915161,0.000536236,0.0001460055,0.0001969869,0.0002826914,0.0004474984,0.01471296],"genre_scores_gemma":[0.5153704,0.0004805628,0.4768233,0.0001848689,0.0000793168,0.0005046091,0.0003890543,0.0001016465,0.006066243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005082698,"threshold_uncertainty_score":0.01010621,"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","authors":[{"name":"Jean Berger","is_ca":true},{"name":"Nassirou Lo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004507663,0.0007261134,0.0008448368,0.0006973792,0.0006066909,0.0008023068,0.001723639,0.001272668,0.002171379],"category_scores_gemma":[0.0006725111,0.0004018705,0.0008129393,0.0006739291,0.000454716,0.0007418576,0.001559381,0.000878496,0.0004517747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005062912,"about_ca_system_score_gemma":0.001177988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002499949,"about_ca_topic_score_gemma":0.002946135,"domain_scores_codex":[0.999696,0.00006517128,0.00001324798,0.0000658744,0.0001281129,0.00003158256],"domain_scores_gemma":[0.9998054,0.0000686651,0.00002251561,0.00001993107,0.00005886633,0.0000246597],"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.00007291533,0.0001245267,0.0004280599,0.0001374025,0.000105662,0.0001712261,0.00009573249,0.7889625,0.007004466,0.03949566,0.003572382,0.1598295],"study_design_scores_gemma":[0.00001207302,0.00003206207,0.00004798792,0.000003928595,0.00001198239,0.00003578205,0.000008002969,0.9938874,0.0003735166,0.003988637,0.001592523,0.00000612192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002939017,0.0001259147,0.9938286,0.0001326158,0.00008136484,0.00003436755,0.00001766797,0.0001597496,0.002680715],"genre_scores_gemma":[0.2097198,0.0003133805,0.7825583,0.0002168805,0.0001144507,0.0002982417,0.00008964828,0.00006743827,0.006621933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002499949,"threshold_uncertainty_score":0.007263958,"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","authors":[{"name":"Sukanto Mondal","is_ca":true},{"name":"Yves Lucet","is_ca":true},{"name":"Warren Hare","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004242144,0.0008664973,0.0008031669,0.0008217224,0.0005300736,0.0008720385,0.0007814953,0.0007265751,0.004663429],"category_scores_gemma":[0.001769992,0.000459397,0.000450384,0.001036699,0.0003355278,0.0007362005,0.0007881765,0.0005504077,0.0006532412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008672321,"about_ca_system_score_gemma":0.00170439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0117571,"about_ca_topic_score_gemma":0.01643074,"domain_scores_codex":[0.9996761,0.00006861583,0.00001439478,0.00008710966,0.00004749875,0.0001062586],"domain_scores_gemma":[0.9994282,0.0002004653,0.0001058349,0.00005518218,0.0001276194,0.00008268034],"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.0002498266,0.0001327244,0.00382186,0.00005800849,0.00003232701,0.00005711259,0.00006599705,0.9278383,0.005993753,0.001824935,0.001004473,0.05892069],"study_design_scores_gemma":[0.00002685216,0.0002318392,0.001345854,0.000007541458,0.00001840239,0.00001832813,0.0001085091,0.9937553,0.002981467,0.001037161,0.0004614072,0.000007315045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6259841,0.0002101861,0.3607346,0.0002358496,0.00004828896,0.0002323283,0.0004820217,0.001043187,0.01102947],"genre_scores_gemma":[0.9068396,0.00006596711,0.09015673,0.00002338807,0.000008451379,0.00006231243,0.0003823262,0.0001074383,0.002353902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0117571,"threshold_uncertainty_score":0.02337736,"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","authors":[{"name":"Mingyuan Chen","is_ca":true},{"name":"Guohua Wan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001435692,0.0007112246,0.001522398,0.001074417,0.0009530059,0.0007279779,0.001057147,0.0008184115,0.002449125],"category_scores_gemma":[0.002307974,0.0005339131,0.000705459,0.00207872,0.0006241573,0.000707029,0.0004425763,0.0006651718,0.0003351778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009362493,"about_ca_system_score_gemma":0.001598682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002760291,"about_ca_topic_score_gemma":0.004109574,"domain_scores_codex":[0.9992754,0.0003097357,0.00002060957,0.0001144982,0.0001772686,0.0001024822],"domain_scores_gemma":[0.9991907,0.0004619816,0.0001100243,0.00005825881,0.0001235114,0.0000554444],"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.0005384095,0.0002356584,0.0006625654,0.0001232279,0.00008015941,0.0001080466,0.00004464633,0.9294631,0.006268101,0.007610315,0.002817198,0.05204861],"study_design_scores_gemma":[0.00005232685,0.00009091505,0.0003462635,0.000002718242,0.00001967603,0.00003045505,0.00001071474,0.9896456,0.001602029,0.007679636,0.0005141668,0.0000055602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1679201,0.0007735039,0.8214143,0.000667011,0.0002890212,0.0002433951,0.0001742716,0.0006529975,0.007865444],"genre_scores_gemma":[0.7284819,0.0004235503,0.260563,0.000176068,0.0002746342,0.0002341743,0.0002264867,0.0002437495,0.009376381],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002760291,"threshold_uncertainty_score":0.008193135,"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","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Demetrio Laganà","is_ca":false},{"name":"Roberto Musmanno","is_ca":false},{"name":"Francesca Vocaturo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105106,0.001104293,0.001495829,0.001304332,0.0006570028,0.0009576424,0.001237705,0.001428938,0.00462684],"category_scores_gemma":[0.002386474,0.0007326514,0.001354165,0.001492288,0.0004843442,0.00119669,0.001187131,0.001272943,0.0006812084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181839,"about_ca_system_score_gemma":0.001824073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00538217,"about_ca_topic_score_gemma":0.005221654,"domain_scores_codex":[0.9994962,0.0002040514,0.00001981836,0.00006222902,0.0001062926,0.0001114506],"domain_scores_gemma":[0.9990938,0.0005361947,0.00006265466,0.00006536562,0.0001523843,0.00008971374],"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.0001562038,0.0001500826,0.0002966643,0.0001367387,0.00004918154,0.00007125697,0.00004572731,0.888027,0.002487735,0.008800671,0.004139221,0.09563953],"study_design_scores_gemma":[0.00003081522,0.00003512523,0.00007229099,0.00001468546,0.00001444298,0.00002076597,0.00001381495,0.9955487,0.0003167838,0.003234965,0.0006908223,0.000006763154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02137005,0.0005252888,0.9716331,0.0002361411,0.0001609546,0.0001186567,0.0001362248,0.0003597244,0.005459846],"genre_scores_gemma":[0.2185691,0.0004338551,0.7771335,0.0001895143,0.00007022074,0.0002671645,0.0004292587,0.0001845439,0.002722776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00538217,"threshold_uncertainty_score":0.01547831,"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","authors":[{"name":"Marilène Cherkesly","is_ca":true},{"name":"Guy Desaulniers","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001102743,0.00077474,0.001154904,0.001098997,0.0006409559,0.001054625,0.001977355,0.001934042,0.00275504],"category_scores_gemma":[0.002454038,0.000616479,0.0009804402,0.001096559,0.0006127207,0.001006277,0.001057087,0.001374053,0.0003411504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001239106,"about_ca_system_score_gemma":0.001591982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006028537,"about_ca_topic_score_gemma":0.005076303,"domain_scores_codex":[0.9995509,0.0001755588,0.00001753618,0.00005467734,0.0001230479,0.00007822686],"domain_scores_gemma":[0.9993305,0.0004066228,0.00007135274,0.00003252138,0.0001039377,0.00005513418],"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.00007212178,0.0001171907,0.0004322123,0.00004559634,0.00004961582,0.00005104323,0.00004918015,0.9343834,0.001039691,0.007755548,0.00132951,0.05467486],"study_design_scores_gemma":[0.00003287213,0.00004849886,0.00008366532,0.000008238812,0.00001368225,0.00001350227,0.00001016559,0.9975248,0.0001970119,0.001293142,0.0007688707,0.000005529431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04799126,0.0007630822,0.941772,0.000459132,0.0002086147,0.0001908184,0.00009432728,0.0004635771,0.008057253],"genre_scores_gemma":[0.4708063,0.0005424435,0.5199107,0.0003475738,0.0001301895,0.0006917685,0.0002168167,0.0001471474,0.007207046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006028537,"threshold_uncertainty_score":0.01198691,"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","authors":[{"name":"Marie‐Ève Rancourt","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Ben Watkins","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003084345,0.0002329059,0.000134798,0.0008418542,0.001692237,0.001247083,0.0004508194,0.0004875473,0.007827212],"category_scores_gemma":[0.0009879228,0.0002883999,0.0001498655,0.0009278755,0.000344668,0.001061041,0.0005046155,0.0004310173,0.0003873685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003912459,"about_ca_system_score_gemma":0.005444847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1645303,"about_ca_topic_score_gemma":0.3915493,"domain_scores_codex":[0.9998208,0.00006655263,0.000006397395,0.0000198903,0.00001935961,0.00006706527],"domain_scores_gemma":[0.9996823,0.0001210165,0.00005363287,0.000007073306,0.00007158509,0.00006435072],"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.001182016,0.0008187189,0.1118584,0.000823692,0.00008644838,0.003450502,0.003788537,0.5546476,0.004508194,0.09418807,0.01607337,0.2085744],"study_design_scores_gemma":[0.0002979283,0.0009898739,0.1257504,0.0006548286,0.0001855261,0.0009685162,0.03498819,0.7626126,0.003132946,0.01672438,0.05354445,0.0001502472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9258723,0.0006745342,0.008698056,0.00123951,0.0000346398,0.0004111774,0.0006878438,0.00005121897,0.06233072],"genre_scores_gemma":[0.987744,0.0004813436,0.005441284,0.00001878008,0.000003515609,0.00008238785,0.0002006537,0.000006309084,0.006021686],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1645303,"threshold_uncertainty_score":0.3271452,"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","authors":[{"name":"Tolga Bektaş","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Erhan Erkut","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004191817,0.001773514,0.003104547,0.001707306,0.001743906,0.004002078,0.004471073,0.003049545,0.008728375],"category_scores_gemma":[0.01607531,0.001749678,0.001157905,0.003991871,0.002258508,0.00656711,0.003059642,0.002702345,0.001509087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004836804,"about_ca_system_score_gemma":0.005540451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01765564,"about_ca_topic_score_gemma":0.01895993,"domain_scores_codex":[0.9973711,0.0008639699,0.000141838,0.0004103123,0.0006685226,0.0005442727],"domain_scores_gemma":[0.9886312,0.00873932,0.0006028577,0.001000527,0.0006897164,0.0003364531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004237366,0.0002144367,0.0006726857,0.0002327304,0.00005650265,0.00004836616,0.0001895715,0.8580549,0.0007512558,0.03656714,0.007875493,0.09491324],"study_design_scores_gemma":[0.0001047201,0.00003482571,0.0001280687,0.00001001391,0.00001843987,0.00002106456,0.00004872031,0.9601109,0.0002585549,0.03855139,0.0007036348,0.000009661531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03173213,0.001460523,0.9566714,0.001198633,0.0001909814,0.0002075711,0.0003644282,0.001508994,0.006665286],"genre_scores_gemma":[0.4193581,0.001089721,0.5692676,0.0003088069,0.0003095668,0.0004526159,0.0009417666,0.0004565344,0.007815256],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01765564,"threshold_uncertainty_score":0.03510576,"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","authors":[{"name":"Nafee Rizk","is_ca":true},{"name":"Alain Martel","is_ca":true},{"name":"Sophie D’Amours","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001640791,0.001103872,0.002276176,0.001041922,0.001178037,0.001538033,0.00193098,0.00141435,0.002434695],"category_scores_gemma":[0.002617917,0.001782961,0.001149817,0.002203811,0.001043921,0.001759468,0.00111408,0.001045127,0.0002433205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001620189,"about_ca_system_score_gemma":0.001165918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01086749,"about_ca_topic_score_gemma":0.00995371,"domain_scores_codex":[0.9993432,0.000233606,0.00002950685,0.0001347594,0.0001176685,0.0001411281],"domain_scores_gemma":[0.998395,0.001118812,0.0001642216,0.00006139691,0.0001459839,0.0001145055],"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.00007454632,0.00003079884,0.0002278478,0.00003290611,0.00001343007,0.00006308925,0.00001649971,0.9945688,0.0003942043,0.001462972,0.00007554065,0.003039437],"study_design_scores_gemma":[0.00001194802,0.00004547351,0.0001420289,0.000003069121,0.000008892838,0.000008269826,0.0000120696,0.9975075,0.0002855535,0.00189154,0.00007785044,0.000005898365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2905014,0.0005174541,0.7020307,0.0002671466,0.00005379648,0.0001924003,0.0002459003,0.0001742022,0.006016933],"genre_scores_gemma":[0.9196496,0.0002648768,0.07546587,0.00002822299,0.0000190233,0.0001811606,0.0001884935,0.00004171071,0.004161065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01086749,"threshold_uncertainty_score":0.02160841,"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","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Ye Li","is_ca":true},{"name":"Michel Toulouse","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006295692,0.000649793,0.0008512472,0.0007821133,0.0008001499,0.0007510104,0.001571458,0.00109807,0.007551474],"category_scores_gemma":[0.002125856,0.0004756625,0.0007564577,0.0009504366,0.0004517451,0.001040387,0.00197219,0.001154304,0.0008935363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009384647,"about_ca_system_score_gemma":0.001210471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00346016,"about_ca_topic_score_gemma":0.006323727,"domain_scores_codex":[0.9996371,0.00009201704,0.00001056603,0.00004910595,0.0001540621,0.00005706791],"domain_scores_gemma":[0.9994482,0.0002138346,0.00004240813,0.00008980637,0.0001534557,0.00005229644],"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.0001760639,0.0001743692,0.0005630248,0.0001693831,0.00005272391,0.00005866842,0.0002064644,0.6166968,0.006334885,0.08231261,0.006642747,0.2866123],"study_design_scores_gemma":[0.00001983589,0.00005924536,0.00006786641,0.000008468223,0.000007408485,0.00001189808,0.000009699046,0.9909175,0.0007030691,0.006323776,0.001865889,0.000005330587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008600321,0.00009061929,0.9846198,0.00009677195,0.00004200198,0.00005993227,0.00003901992,0.0002486183,0.006202985],"genre_scores_gemma":[0.2122452,0.0001218325,0.7814418,0.0001219847,0.00003887173,0.00038145,0.0001130527,0.0001310549,0.005404733],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007551474,"threshold_uncertainty_score":0.02526218,"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","authors":[{"name":"Sophie N. Parragh","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417264,0.0008810048,0.001404289,0.0009036801,0.0005605384,0.0008124614,0.001291725,0.00114298,0.003035479],"category_scores_gemma":[0.003886492,0.0005418151,0.0006525752,0.001431338,0.0007159523,0.001373565,0.0008056071,0.001242804,0.0002837862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010906,"about_ca_system_score_gemma":0.00128063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007520092,"about_ca_topic_score_gemma":0.006748965,"domain_scores_codex":[0.9994895,0.0002894491,0.00001853792,0.00006215945,0.00007272195,0.000067525],"domain_scores_gemma":[0.9981641,0.001493404,0.0001286164,0.00004332534,0.00008019103,0.00009030069],"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.00008928894,0.00008264967,0.0003001121,0.00004467204,0.00002344811,0.00003920683,0.00002131825,0.9762151,0.0002144457,0.00828194,0.0006731073,0.01401466],"study_design_scores_gemma":[0.00001288292,0.00002257699,0.00003887643,0.000002885968,0.000003739899,0.000004353054,0.000005281587,0.9968592,0.00005479873,0.002842327,0.0001512539,0.000001862703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1076975,0.001566692,0.8810498,0.0005743165,0.000110195,0.0001962245,0.0001641028,0.0002553236,0.00838601],"genre_scores_gemma":[0.595595,0.0009118182,0.3969356,0.0001434478,0.0001117513,0.0004910356,0.0003911074,0.000148347,0.005271973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007520092,"threshold_uncertainty_score":0.0149526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}