{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":201,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":201,"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":"80010de21138","filters":{"venue":"INFORMS journal on computing"}},"results":[{"id":"W2108911946","doi":"10.1287/ijoc.2013.0550","title":"Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Heuristic; Computer science; Routing (electronic design automation); Index (typography); Production (economics); Branch and cut; Algorithm; Order (exchange); Enumeration; Integer programming; Operations research; Mathematics; Economics","authors":[{"name":"Yossiri Adulyasak","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Raf Jans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02831864026295009,"gpt":0.2741303086561243,"spread":0.2458116683931742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001985895,0.002059252,0.002040935,0.001531191,0.0008625737,0.00246641,0.002196633,0.001955056,0.006907423],"category_scores_gemma":[0.004341541,0.001073559,0.001281625,0.002945084,0.0009260601,0.002029324,0.001493097,0.003097437,0.001057476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001792751,"about_ca_system_score_gemma":0.002303587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005980784,"about_ca_topic_score_gemma":0.005287342,"domain_scores_codex":[0.9988397,0.0004122475,0.00006844925,0.0002062371,0.0003285257,0.0001448979],"domain_scores_gemma":[0.9980329,0.001302887,0.0002067745,0.00009721113,0.0002851956,0.00007501413],"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.00005178081,0.00009166099,0.0002091327,0.0001303935,0.00003556495,0.00006055823,0.0000496114,0.9157146,0.0004507655,0.02783003,0.002638188,0.05273772],"study_design_scores_gemma":[0.00002726143,0.00002076739,0.00003591346,0.00001671918,0.000009413842,0.0000193143,0.00002273975,0.9794589,0.0002489371,0.01855033,0.001583911,0.000005807394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005575381,0.0007061398,0.9879746,0.0003066277,0.00006188166,0.0001483937,0.0001877104,0.0002799911,0.004759222],"genre_scores_gemma":[0.09317124,0.001086393,0.90005,0.000181538,0.0001224281,0.0006261446,0.0007101484,0.0002129716,0.00383911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006907423,"threshold_uncertainty_score":0.02310765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059816321","doi":"10.1287/ijoc.1040.0117","title":"The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":215,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kronos (Canada)","funders":"","keywords":"Shortest path problem; Mathematical optimization; Vehicle routing problem; Benchmark (surveying); Mathematics; Column generation; Relaxation (psychology); Integer (computer science); Path (computing); Scheduling (production processes); Routing (electronic design automation); Computer science; Combinatorics; Graph","authors":[{"name":"Stefan Irnich","is_ca":false},{"name":"Daniel L. Villeneuve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006429132118342962,"gpt":0.2240080083722953,"spread":0.2175788762539524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007331605,0.00134299,0.0008703516,0.0005847059,0.0008312759,0.001321645,0.001151861,0.0009509392,0.007293896],"category_scores_gemma":[0.002524458,0.0004692383,0.001308292,0.001700882,0.0006182919,0.001667771,0.0006933857,0.002212452,0.000436314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001569045,"about_ca_system_score_gemma":0.002510711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01672332,"about_ca_topic_score_gemma":0.01645963,"domain_scores_codex":[0.9991897,0.0002137842,0.00003077581,0.0001709752,0.0001333187,0.000261528],"domain_scores_gemma":[0.9985279,0.0009359372,0.0001876352,0.00009451184,0.0001487049,0.0001053341],"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.0002852612,0.0003325997,0.001002456,0.0005283007,0.00005675658,0.0003366605,0.0001154446,0.9179599,0.003334978,0.02961303,0.01006178,0.03637279],"study_design_scores_gemma":[0.0001076476,0.0001465414,0.001068006,0.00003618788,0.00003526353,0.0002084593,0.0001949915,0.9564266,0.002463838,0.03283006,0.006454571,0.0000279185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5686519,0.002746888,0.3579856,0.002369709,0.0002534551,0.0005958563,0.006383428,0.0007535096,0.06025967],"genre_scores_gemma":[0.768841,0.00128007,0.2090243,0.0003055437,0.00008486674,0.0004193386,0.007396282,0.0003579271,0.01229069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01672332,"threshold_uncertainty_score":0.033252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121266360","doi":"10.1287/ijoc.1100.0439","title":"A Hybrid Heuristic for an Inventory Routing Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":199,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Stockout; Mathematical optimization; Heuristic; Benchmark (surveying); Computer science; Integer programming; Service level; Inventory control; Operations research; Inventory theory; Routing (electronic design automation); Set (abstract data type); Time horizon; Vehicle routing problem; Tabu search; Mathematics","authors":[{"name":"Claudia Archetti","is_ca":false},{"name":"Luca Bertazzi","is_ca":false},{"name":"Alain Hertz","is_ca":true},{"name":"M. Grazia Speranza","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05024524965669892,"gpt":0.2806375269401999,"spread":0.230392277283501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009439955,0.0009237322,0.0009478773,0.001147782,0.0005331877,0.001373158,0.00162299,0.001482499,0.004379362],"category_scores_gemma":[0.001662459,0.0006228449,0.0006211874,0.001322034,0.0006709321,0.0009927517,0.00081584,0.0007111286,0.0005448065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001161686,"about_ca_system_score_gemma":0.001286494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003859259,"about_ca_topic_score_gemma":0.004595475,"domain_scores_codex":[0.9994127,0.0002849832,0.00001885123,0.00006886341,0.0001205248,0.00009414271],"domain_scores_gemma":[0.9991753,0.0005914759,0.00006208949,0.00005367134,0.00007063756,0.0000469062],"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.0001008981,0.0001195977,0.0002778524,0.00009433208,0.00004112332,0.00010235,0.00006184674,0.9504784,0.001071046,0.0112992,0.001487832,0.03486556],"study_design_scores_gemma":[0.00004719007,0.00006353238,0.00005013551,0.00001211652,0.00001199823,0.00003236998,0.0000241512,0.9952028,0.0003134052,0.003038374,0.00119668,0.00000716556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07988244,0.0008672458,0.9008961,0.0003631258,0.0001107683,0.0003500613,0.0003145926,0.001250053,0.01596563],"genre_scores_gemma":[0.4793362,0.0004558062,0.5138586,0.0002392833,0.00005284755,0.0006938986,0.0003632022,0.0001507531,0.004849407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004379362,"threshold_uncertainty_score":0.0146504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132499281","doi":"10.1287/ijoc.1060.0208","title":"The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":173,"is_retracted":false,"has_abstract":true,"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; University of Texas at Dallas","keywords":"Mathematical optimization; Job shop scheduling; Scheduling (production processes); Computer science; Production schedule; Heuristic; Operations research; Schedule; Memetic algorithm; Heuristics; Genetic algorithm; Mathematics","authors":[{"name":"H. Neil Geismar","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Lei Lei","is_ca":false},{"name":"Chelliah Sriskandarajah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01531836549152737,"gpt":0.2665560813810715,"spread":0.2512377158895441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163268,0.00150331,0.001640063,0.0009085707,0.0009919283,0.001463903,0.001513743,0.001760751,0.007462734],"category_scores_gemma":[0.002409585,0.0006876051,0.001257003,0.001807713,0.0008476538,0.002083148,0.0009309718,0.001032932,0.0007465535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001390256,"about_ca_system_score_gemma":0.002385441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003585839,"about_ca_topic_score_gemma":0.003078092,"domain_scores_codex":[0.9993654,0.0001485818,0.00003851044,0.0002185701,0.0001185461,0.0001105073],"domain_scores_gemma":[0.9990025,0.0005465122,0.0001862413,0.00006726233,0.00007832783,0.0001191006],"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.0005627857,0.0003888003,0.001831778,0.0007118356,0.0001796172,0.0008380613,0.0002561909,0.8662512,0.01175628,0.02712599,0.004220911,0.08587669],"study_design_scores_gemma":[0.0001826107,0.0008515997,0.001702772,0.00004652304,0.0001184107,0.0005905338,0.0002558289,0.951303,0.004350911,0.03163519,0.00891633,0.00004632302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2139791,0.001018752,0.7704402,0.001155532,0.0001457255,0.0006844255,0.001430918,0.000469001,0.01067639],"genre_scores_gemma":[0.5922015,0.001080286,0.3917929,0.00016387,0.0001552486,0.0009216834,0.001973601,0.0002120409,0.01149885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007462734,"threshold_uncertainty_score":0.02496535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139575211","doi":"10.1287/ijoc.12.3.223.12638","title":"A Simplex-Based Tabu Search Method for Capacitated Network Design","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":167,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Simplex; Integer programming; Set (abstract data type); Network planning and design; Integer (computer science); Mathematics; Column generation; Computer science; Fixed charge; Algorithm; Combinatorics","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Judith M. Farvolden","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04292685753506973,"gpt":0.3050822956265041,"spread":0.2621554380914344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225729,0.001194153,0.001192875,0.001440955,0.0008240129,0.0009710818,0.001280752,0.001148598,0.007239245],"category_scores_gemma":[0.003930082,0.0007674427,0.0006585634,0.002723793,0.0005648971,0.0007245851,0.0008054352,0.001303637,0.001787493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000840631,"about_ca_system_score_gemma":0.001646204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006000961,"about_ca_topic_score_gemma":0.005310485,"domain_scores_codex":[0.9992034,0.0004806602,0.00001855249,0.00005425315,0.0002009649,0.00004215965],"domain_scores_gemma":[0.9988888,0.0007011346,0.00006525282,0.00007893318,0.0002332316,0.00003258348],"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.00006849281,0.00005334358,0.0002236048,0.00009152642,0.00005076225,0.00002499102,0.00005121809,0.8618448,0.000953318,0.009965228,0.003375842,0.1232969],"study_design_scores_gemma":[0.00001321796,0.0000169271,0.00002752336,0.00000775626,0.000004909984,0.000008453397,0.000006386128,0.9959014,0.0002579493,0.002568696,0.001181652,0.000005162606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004806411,0.0003620179,0.9892305,0.0000739589,0.00004361927,0.0001068658,0.0001344263,0.001036775,0.00420549],"genre_scores_gemma":[0.1052816,0.0003426898,0.8900179,0.00009245845,0.00003248124,0.0007554184,0.0003527555,0.0004759777,0.002648688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007239245,"threshold_uncertainty_score":0.02421772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129946839","doi":"10.1287/ijoc.1080.0296","title":"Accelerating Benders Decomposition by Local Branching","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":164,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benders' decomposition; Branching (polymer chemistry); Mathematical optimization; Branch and bound; Mathematics; Decomposition; Upper and lower bounds; Algorithm; Computer science","authors":[{"name":"Walter Rei","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Patrick Soriano","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0160819075541137,"gpt":0.2410822944355039,"spread":0.2250003868813902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001214803,0.001080465,0.000792387,0.0008763766,0.0004806558,0.0008942551,0.0009226952,0.0008045803,0.006894668],"category_scores_gemma":[0.00285783,0.0004890675,0.0007149936,0.0009558161,0.0007374939,0.001584388,0.001541527,0.002030561,0.00147533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006671899,"about_ca_system_score_gemma":0.0007641245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194873,"about_ca_topic_score_gemma":0.002127141,"domain_scores_codex":[0.9993137,0.0002009491,0.00002682367,0.0001052484,0.0002520899,0.0001012055],"domain_scores_gemma":[0.99892,0.0006066598,0.00009054548,0.000186585,0.0001381067,0.00005815522],"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.0002476094,0.0001376728,0.0004994628,0.0001605813,0.0000395988,0.0001123048,0.0001734924,0.6437176,0.03446115,0.07101348,0.002199779,0.2472373],"study_design_scores_gemma":[0.00005339406,0.00008159406,0.0001092461,0.00002127591,0.00001722824,0.00005505215,0.00002915753,0.9592335,0.009821321,0.02697084,0.003594232,0.0000131268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01217367,0.0001022206,0.9833236,0.00005894151,0.0000186471,0.00003183913,0.00001243497,0.0006268627,0.003651816],"genre_scores_gemma":[0.1975884,0.0002696165,0.7980997,0.00009966326,0.00003473536,0.0001322378,0.00009403498,0.0003517302,0.00332999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006894668,"threshold_uncertainty_score":0.02306497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100711246","doi":"10.1287/ijoc.1060.0202","title":"Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":139,"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":"","keywords":"Travelling salesman problem; Pickup; FIFO and LIFO accounting; Variable (mathematics); Mathematical optimization; Variable neighborhood search; Heuristic; 2-opt; Traveling purchaser problem; Heuristics; Computer science; Mathematics; FIFO (computing and electronics); Metaheuristic; Artificial intelligence","authors":[{"name":"Francesco Carrabs","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01899676715682416,"gpt":0.2579686718548559,"spread":0.2389719046980317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009294031,0.0004027911,0.0007677323,0.0005664334,0.0004498449,0.0005790297,0.000870795,0.0006147842,0.001878139],"category_scores_gemma":[0.002237791,0.000241534,0.0003099171,0.0007162089,0.0004654262,0.0009907556,0.0005118198,0.0005421403,0.0002031756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006796408,"about_ca_system_score_gemma":0.0007222937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00574484,"about_ca_topic_score_gemma":0.006432203,"domain_scores_codex":[0.9996575,0.0001611922,0.00001097297,0.00005028232,0.00006898283,0.00005101428],"domain_scores_gemma":[0.9993783,0.0004470228,0.00006898619,0.00003078177,0.00003931326,0.00003556107],"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.0001846579,0.0001395419,0.0009901189,0.000046771,0.00001999965,0.00006155059,0.00006232527,0.9471568,0.0008603702,0.007620466,0.0009960148,0.04186127],"study_design_scores_gemma":[0.00003030736,0.00006377478,0.000137493,0.000003818645,0.000005924369,0.000013167,0.00002156554,0.9964926,0.0003204836,0.002521647,0.0003853276,0.000003849689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3541658,0.0008524737,0.635896,0.0003452941,0.00004693177,0.0001498599,0.000173071,0.0007728917,0.007597732],"genre_scores_gemma":[0.7590913,0.0001970311,0.2373635,0.00005139825,0.00002041983,0.0001702988,0.0002558497,0.0001008221,0.002749414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00574484,"threshold_uncertainty_score":0.01142281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105318109","doi":"10.1287/ijoc.1080.0270","title":"Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":137,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semidefinite programming; Mathematical optimization; Cutting-plane method; Relaxation (psychology); Linear programming; Semidefinite embedding; Mathematics; Computer science; Integer programming; Algorithm; Quadratically constrained quadratic program; Quadratic programming","authors":[{"name":"Miguel F. Anjos","is_ca":true},{"name":"Anthony Vannelli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05195044819780355,"gpt":0.2483886363366176,"spread":0.196438188138814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001211229,0.001930729,0.001749957,0.0009539047,0.0003898041,0.001213462,0.0008770374,0.001110329,0.003401838],"category_scores_gemma":[0.004260864,0.001004537,0.001082984,0.001306779,0.0009448634,0.001605657,0.001235578,0.001601467,0.0006900373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008233701,"about_ca_system_score_gemma":0.001549029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002156001,"about_ca_topic_score_gemma":0.003473104,"domain_scores_codex":[0.9993231,0.0003022233,0.00003088533,0.0001402597,0.0001288235,0.00007481172],"domain_scores_gemma":[0.9979202,0.001435667,0.0002408275,0.0001393468,0.0001838981,0.00008013398],"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.00003576756,0.00003233716,0.0002112113,0.0000705237,0.00002591771,0.00003538482,0.000026056,0.9731891,0.001071827,0.006245063,0.000791449,0.01826532],"study_design_scores_gemma":[0.00001433325,0.00004225401,0.00004564754,0.000008111114,0.000005455166,0.0000111608,0.0000252157,0.9897357,0.0006887717,0.009116663,0.0003006796,0.000005951243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03301354,0.0001770545,0.9625115,0.0001560163,0.00002144736,0.00004830146,0.0001895987,0.000533717,0.003348914],"genre_scores_gemma":[0.2608766,0.0002869544,0.73575,0.00008600163,0.00002924822,0.0003077554,0.0006236006,0.0002659048,0.001773967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003401838,"threshold_uncertainty_score":0.01138031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110438635","doi":"10.1287/ijoc.1060.0191","title":"Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of Naval Research; McGill University","keywords":"Interdiction; Lagrangian relaxation; Mathematical optimization; Solver; Flow network; Maximum flow problem; Branch and bound; Minimum-cost flow problem; Integer programming; Flow (mathematics); Set (abstract data type); Computer science; Pareto principle; Branch and cut; Relaxation (psychology); Linear programming relaxation; Integer (computer science); Mathematics; Algorithm","authors":[{"name":"Johannes Ø. Røyset","is_ca":false},{"name":"R. Kevin Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005485217191066163,"gpt":0.2239149665857092,"spread":0.218429749394643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134531,0.001220285,0.001180373,0.0008887867,0.0006679622,0.001108132,0.001674332,0.001271816,0.007588567],"category_scores_gemma":[0.002515632,0.0005305283,0.0006967153,0.001190262,0.0005708174,0.001724339,0.001439519,0.001625297,0.001046449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008237672,"about_ca_system_score_gemma":0.001965148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003978888,"about_ca_topic_score_gemma":0.004513437,"domain_scores_codex":[0.9994635,0.0001672983,0.00002121986,0.000103127,0.0001487822,0.00009605339],"domain_scores_gemma":[0.9992675,0.0004450755,0.00006812598,0.00006726195,0.0001119591,0.00004003423],"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.00007770361,0.00007593213,0.0003358382,0.0001539146,0.00004084435,0.00006457306,0.00006306111,0.8797067,0.001030601,0.03255647,0.004122239,0.08177217],"study_design_scores_gemma":[0.00002021086,0.00002387905,0.00006982843,0.00001128786,0.000006792093,0.00003449007,0.00001916798,0.9824371,0.0006688594,0.01488661,0.001815825,0.000005984822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005880706,0.0001213882,0.988475,0.0001250119,0.00002419565,0.00005815135,0.0001091658,0.0002663827,0.004940046],"genre_scores_gemma":[0.11895,0.0001979565,0.8760859,0.00008365522,0.00002765266,0.0002848682,0.0004662671,0.0001504657,0.003753104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007588567,"threshold_uncertainty_score":0.02538627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120930954","doi":"10.1287/ijoc.2013.0549","title":"An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"Column generation; Mathematical optimization; Column (typography); Computer science; Routing (electronic design automation); Set (abstract data type); Upper and lower bounds; Path (computing); Shortest path problem; Enumeration; Vehicle routing problem; Mathematics; Algorithm; Theoretical computer science; Combinatorics","authors":[{"name":"Claudio Contardo","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Bernard Gendron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0231427117613517,"gpt":0.269702066190119,"spread":0.2465593544287673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007503183,0.001549854,0.00108942,0.0011546,0.0008848226,0.001214408,0.00158421,0.001173371,0.01068293],"category_scores_gemma":[0.002599311,0.0006992479,0.0009669454,0.001791313,0.0006598061,0.00182382,0.001085606,0.001779284,0.00188261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001371009,"about_ca_system_score_gemma":0.002287284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005325647,"about_ca_topic_score_gemma":0.006547489,"domain_scores_codex":[0.9992024,0.0001966429,0.00003586745,0.0001655258,0.000247371,0.0001521805],"domain_scores_gemma":[0.9987881,0.0007014324,0.0000826563,0.000223805,0.0001642778,0.00003976952],"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.0002515863,0.0003268795,0.000648673,0.0003311379,0.00007631815,0.0001699031,0.0001164751,0.5191582,0.005937851,0.04062962,0.01538812,0.4169652],"study_design_scores_gemma":[0.000086137,0.00006848846,0.0001347785,0.00001880378,0.00002192006,0.0001473014,0.00003623622,0.969543,0.002273621,0.02367409,0.003975893,0.00001980286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004872593,0.0001391266,0.9902126,0.0001278026,0.00005282523,0.0001418187,0.0001715309,0.001153941,0.003127825],"genre_scores_gemma":[0.06460728,0.000153267,0.9324076,0.0001144254,0.00002979556,0.0002386633,0.0007871323,0.0002209005,0.001440896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01068293,"threshold_uncertainty_score":0.03573799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013001756","doi":"10.1287/ijoc.1050.0157","title":"A Survey and Experimental Comparison of Service-Level-Approximation Methods for Nonstationary<i>M(t)/M/s(t)</i>Queueing Systems with Exhaustive Discipline","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":115,"is_retracted":false,"has_abstract":true,"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":"Queueing theory; Approximation algorithm; Computation; Approximation error; Computer science; Ordinary differential equation; Mathematical optimization; Solver; Set (abstract data type); Closure (psychology); Applied mathematics; Mathematics; Differential equation; Algorithm; Statistics; Mathematical analysis","authors":[{"name":"Ármann Ingólfsson","is_ca":true},{"name":"Elvira Akhmetshina","is_ca":true},{"name":"Susan Budge","is_ca":true},{"name":"Yongyue Li","is_ca":true},{"name":"Xudong Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05855104518789757,"gpt":0.3763409439001331,"spread":0.3177898987122356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004238201,0.0008144796,0.001142694,0.001101873,0.000596443,0.0009720956,0.001982074,0.001203742,0.001335693],"category_scores_gemma":[0.02069939,0.0005925614,0.0006868931,0.001932987,0.0005262363,0.001630147,0.0006031814,0.0008784513,0.0004340254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001109498,"about_ca_system_score_gemma":0.001358903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006993602,"about_ca_topic_score_gemma":0.003962441,"domain_scores_codex":[0.9965457,0.001222248,0.00038552,0.0004224936,0.001289667,0.0001343941],"domain_scores_gemma":[0.9816083,0.01321812,0.0009436419,0.001723779,0.002282578,0.0002235465],"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.001169474,0.0008919627,0.006336696,0.000866139,0.0003042156,0.00006940358,0.0004655239,0.522907,0.01041141,0.007806477,0.001969483,0.4468023],"study_design_scores_gemma":[0.00009282283,0.0003236024,0.001362151,0.00005804135,0.00003821799,0.0000619127,0.00007538925,0.9855925,0.00909074,0.00150608,0.001768236,0.00003015424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2285362,0.004563128,0.758782,0.0003130172,0.0001436335,0.0001921747,0.0001705886,0.003107715,0.004191577],"genre_scores_gemma":[0.6342534,0.00276154,0.3609247,0.0001083209,0.00006173537,0.0002130558,0.0004179115,0.0002995962,0.0009597121],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006993602,"threshold_uncertainty_score":0.02241403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2255734301","doi":"10.1287/ijoc.2015.0666","title":"Decomposition Methods for the Parallel Machine Scheduling Problem with Setups","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Job shop scheduling; Solver; Mathematical optimization; Computer science; Travelling salesman problem; Scheduling (production processes); Metaheuristic; Decomposition; Benders' decomposition; Integer programming; Branch and bound; Algorithm; Mathematics; Routing (electronic design automation)","authors":[{"name":"Tony Tran","is_ca":true},{"name":"Arthur Araujo","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01518101738347567,"gpt":0.3035211131566281,"spread":0.2883400957731524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216271,0.001630216,0.00111452,0.00126676,0.0005608353,0.0009939228,0.001067807,0.001104315,0.004566712],"category_scores_gemma":[0.005091585,0.0007765234,0.001760869,0.001349632,0.0008229512,0.001375664,0.001315918,0.001993643,0.000646715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009608751,"about_ca_system_score_gemma":0.001496697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002946181,"about_ca_topic_score_gemma":0.002581218,"domain_scores_codex":[0.9989286,0.0005172117,0.00004102731,0.0001277425,0.0002478469,0.000137556],"domain_scores_gemma":[0.9981828,0.001389499,0.0001372607,0.00009769203,0.0001217156,0.00007092351],"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.0000697686,0.00008119724,0.0002608135,0.0001694214,0.00004920458,0.00005119137,0.00005626809,0.9272266,0.001421454,0.02821457,0.001315802,0.04108363],"study_design_scores_gemma":[0.00001959974,0.00002442246,0.00005318587,0.00001411728,0.00000836809,0.00001622922,0.000011321,0.9804217,0.0002750127,0.01832431,0.0008273597,0.000004378563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006732046,0.0003593559,0.9898021,0.0001466044,0.00004367008,0.00006546503,0.00005756375,0.0001447147,0.002648565],"genre_scores_gemma":[0.1995841,0.0009475087,0.794213,0.0001490149,0.000130566,0.0003754042,0.0003954229,0.0002905082,0.003914397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004566712,"threshold_uncertainty_score":0.01527715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128811073","doi":"10.1287/ijoc.1110.0454","title":"A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"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":"","keywords":"Tabu search; Computer science; Hybrid algorithm (constraint satisfaction); Algorithm; Mathematical optimization; Constraint programming; Guided Local Search; Scheduling (production processes); Constraint (computer-aided design); Heuristic; Dynamic programming; Constraint logic programming; Mathematics; Stochastic programming","authors":[{"name":"Gerardo Berbeglia","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.02565423053011042,"gpt":0.2752020308302267,"spread":0.2495478003001163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264612,0.000995183,0.001108926,0.001359284,0.0008361752,0.001201283,0.002184279,0.00132291,0.004858769],"category_scores_gemma":[0.002939618,0.0006999269,0.0007680448,0.002781625,0.0006232615,0.001319975,0.0009665797,0.001296192,0.001128568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009651723,"about_ca_system_score_gemma":0.00205233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01249953,"about_ca_topic_score_gemma":0.01006772,"domain_scores_codex":[0.9990832,0.0003712072,0.00004013865,0.0001300654,0.0002769995,0.0000984029],"domain_scores_gemma":[0.9989623,0.0006369157,0.00006759032,0.00008820032,0.0002033419,0.00004159578],"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.0001630759,0.0001431123,0.0005258476,0.0001306799,0.0001001864,0.00006540255,0.00008288277,0.6726028,0.002259991,0.01745986,0.00548922,0.3009769],"study_design_scores_gemma":[0.00004336234,0.00003299563,0.00008418765,0.000008651229,0.00001132457,0.00003534267,0.00001434076,0.992699,0.0005812852,0.004001889,0.002476771,0.0000109216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006377932,0.000267619,0.9893401,0.00009758426,0.00003533054,0.0000981873,0.00009140741,0.0009244128,0.00276748],"genre_scores_gemma":[0.07193065,0.000186044,0.9246969,0.0001286597,0.0000284139,0.0003265851,0.0002775192,0.0002617009,0.002163389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01249953,"threshold_uncertainty_score":0.02485359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111731757","doi":"10.1287/ijoc.1090.0335","title":"A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":108,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Subgradient method; Heuristic; Computer science; Queue; Branch and bound; Transshipment (information security); Nonlinear system; Upper and lower bounds; Flow network; Nonlinear programming; Integer (computer science); Piecewise linear function; Network congestion; Cutting-plane method; Integer programming; Mathematics","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Huyu Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03055224279145047,"gpt":0.271753126021591,"spread":0.2412008832301405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001910771,0.001007666,0.001324899,0.001046099,0.0008343355,0.0008911471,0.001278154,0.001143416,0.00374491],"category_scores_gemma":[0.002473665,0.0009782633,0.0007054072,0.001012243,0.001065629,0.00117896,0.001100769,0.001220175,0.000377643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00178392,"about_ca_system_score_gemma":0.003344392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009009489,"about_ca_topic_score_gemma":0.009513904,"domain_scores_codex":[0.9992412,0.0003810705,0.00002015544,0.00008980968,0.000144092,0.0001235914],"domain_scores_gemma":[0.9990554,0.0006543231,0.00009623721,0.00003330287,0.000101733,0.00005902408],"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.00002995033,0.00002067417,0.00008739144,0.00002581826,0.000009464288,0.00002991105,0.00002156402,0.9885633,0.0002714314,0.004662735,0.0003378389,0.005939896],"study_design_scores_gemma":[0.00001200043,0.00002163622,0.00002703653,0.000004185665,0.000003123885,0.00000560051,0.000008225044,0.9970645,0.0001428508,0.002321491,0.0003854298,0.000003840293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0189999,0.0002190052,0.9758382,0.0002120741,0.00002934298,0.0001475654,0.00007430967,0.0001636392,0.004315888],"genre_scores_gemma":[0.5110273,0.0002894504,0.4807035,0.0001586838,0.00003320681,0.0005659094,0.0001855806,0.0001180005,0.006918275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009009489,"threshold_uncertainty_score":0.01791406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099501018","doi":"10.1287/ijoc.1080.0312","title":"<b>State-of-the Art Review</b>—Evolutionary Algorithms for Vehicle Routing","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Evolutionary algorithm; Computer science; Particle swarm optimization; Mathematical optimization; Routing (electronic design automation); Metaheuristic; Genetic algorithm; Algorithm; Memetic algorithm; Mathematics","authors":[{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02023764090783845,"gpt":0.2866582831078937,"spread":0.2664206422000552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592518,0.0006021517,0.000732421,0.001385188,0.0003262028,0.00157608,0.0009993069,0.001141096,0.008729851],"category_scores_gemma":[0.002022235,0.0002544473,0.0005136029,0.004049526,0.0003046444,0.001792319,0.0003630006,0.0005598536,0.003868992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003595986,"about_ca_system_score_gemma":0.0006671342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001660655,"about_ca_topic_score_gemma":0.001766009,"domain_scores_codex":[0.9996299,0.00007588654,0.00004014335,0.00007164718,0.0001496119,0.00003277339],"domain_scores_gemma":[0.9990872,0.0004401766,0.00006467893,0.00004670816,0.0003381544,0.00002310383],"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.00008048144,0.00007430379,0.0006558403,0.003055267,0.0001060106,0.0001142666,0.00002286664,0.01099685,0.002804203,0.01025651,0.04992356,0.9219099],"study_design_scores_gemma":[0.00003124275,0.0002455067,0.002545826,0.002509544,0.0003146685,0.001552065,0.0001374963,0.05010336,0.009048258,0.02001588,0.9134266,0.00006957828],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00794549,0.8290173,0.1016683,0.00498741,0.00396978,0.00006525436,0.0003330365,0.0004665532,0.05154693],"genre_scores_gemma":[0.07860588,0.8236306,0.06903772,0.001708731,0.004937281,0.00007533705,0.001161149,0.0001725392,0.02067068],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.008729851,"threshold_uncertainty_score":0.02920425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2348420909","doi":"10.1287/ijoc.2015.0686","title":"A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":95,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Scheduling (production processes); Computer science; Time horizon; Constraint programming; Knapsack problem; Mathematics; Stochastic programming","authors":[{"name":"Seyed Hossein Hashemi Doulabi","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Gilles Pesant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07313580517315778,"gpt":0.3924170696532212,"spread":0.3192812644800634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00155919,0.001940213,0.001889293,0.001576215,0.001051367,0.001690267,0.002215164,0.001897403,0.007400488],"category_scores_gemma":[0.004227599,0.001313905,0.001353826,0.002965363,0.0007585056,0.001806732,0.001436738,0.003019173,0.0009916821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001950401,"about_ca_system_score_gemma":0.003754841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01362161,"about_ca_topic_score_gemma":0.01167691,"domain_scores_codex":[0.9988117,0.0003848157,0.00005530372,0.0002021027,0.0003844254,0.0001617182],"domain_scores_gemma":[0.9980586,0.001417222,0.0001254656,0.00007315013,0.000233267,0.00009213469],"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.00006823913,0.000120602,0.0001860465,0.0001348585,0.00004215107,0.00006597767,0.00003665629,0.897911,0.0008069269,0.01338643,0.003730023,0.08351108],"study_design_scores_gemma":[0.00001794792,0.00002030335,0.00002897027,0.000007440876,0.000006960414,0.00001694489,0.000006980496,0.9934122,0.0002395755,0.005457449,0.0007799675,0.000005221389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001700187,0.0001384936,0.9961109,0.0001452701,0.00003112181,0.00009911737,0.00007299929,0.0002012886,0.001500586],"genre_scores_gemma":[0.04474505,0.0002761489,0.952602,0.0001064142,0.00004990379,0.0004023314,0.0002703017,0.0001675394,0.001380265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01362161,"threshold_uncertainty_score":0.02708465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008959214","doi":"10.1287/ijoc.12.2.104.11897","title":"Minmax Regret Median Location on a Network Under Uncertainty","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Regret; Minimax; Mathematical optimization; Node (physics); Interval (graph theory); Mathematics; Function (biology); Computer science; Time complexity; Algorithm; Combinatorics; Statistics","authors":[{"name":"Igor Averbakh","is_ca":false},{"name":"Oded Berman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02338088678025285,"gpt":0.2407269609742197,"spread":0.2173460741939668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002566654,0.001386204,0.002675483,0.000831834,0.0009255127,0.002116474,0.00179161,0.002523537,0.004390273],"category_scores_gemma":[0.006955198,0.0006997929,0.0008652201,0.001856636,0.001166279,0.004055987,0.002026967,0.001690248,0.0007083204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002576457,"about_ca_system_score_gemma":0.001364541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004320731,"about_ca_topic_score_gemma":0.003716781,"domain_scores_codex":[0.9985768,0.0006293671,0.00005511214,0.0003031041,0.000176392,0.0002592184],"domain_scores_gemma":[0.9967231,0.002356162,0.0003701435,0.0001999955,0.0002051546,0.0001454532],"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.0002193069,0.00002967187,0.0003027411,0.00008382927,0.00002685295,0.00005883452,0.00004813176,0.9521197,0.0003571203,0.02549125,0.002366624,0.01889593],"study_design_scores_gemma":[0.00001748289,0.0000351593,0.0001015334,0.0000110167,0.00000771311,0.00003103697,0.00003292712,0.9447352,0.0003373366,0.05401646,0.0006663034,0.000007901362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04714273,0.0008664416,0.9443959,0.00127589,0.00007138756,0.00006946683,0.0006381338,0.0005130237,0.005027065],"genre_scores_gemma":[0.7127525,0.001160817,0.2754295,0.000288944,0.0002376986,0.0002559319,0.001126904,0.000236685,0.008510957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004390273,"threshold_uncertainty_score":0.01869357,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2187140470","doi":"10.1287/ijoc.2015.0648","title":"Discrete Optimization with Decision Diagrams","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Binary decision diagram; Solver; Integer programming; Lagrangian relaxation; Mathematical optimization; Satisfiability; Mathematics; Benchmark (surveying); True quantified Boolean formula; Boolean satisfiability problem; Linear programming; Linear programming relaxation; Algorithm; Computer science","authors":[{"name":"David Bergman","is_ca":true},{"name":"André A. Ciré","is_ca":true},{"name":"Willem‐Jan van Hoeve","is_ca":true},{"name":"J. N. Hooker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0165494217330425,"gpt":0.2819093452471662,"spread":0.2653599235141237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002331166,0.001290156,0.0009211637,0.0009378439,0.0005125495,0.002233756,0.001180822,0.001153868,0.005329804],"category_scores_gemma":[0.00693767,0.000780761,0.001409984,0.001376729,0.001512829,0.00188356,0.001713731,0.002435977,0.0009597537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001672623,"about_ca_system_score_gemma":0.002404502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003188208,"about_ca_topic_score_gemma":0.003322856,"domain_scores_codex":[0.9979163,0.0009647105,0.0001156592,0.0002911862,0.0005669259,0.0001452314],"domain_scores_gemma":[0.9974975,0.001930554,0.0001233765,0.0001953457,0.0001755201,0.00007767539],"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.00006806472,0.0000474998,0.00031697,0.0002549387,0.000042285,0.00004691347,0.00007046738,0.5977787,0.001105071,0.3354376,0.002022662,0.06280869],"study_design_scores_gemma":[0.00004399096,0.00003111782,0.00004055738,0.0000411113,0.00001334709,0.00002104125,0.0000125899,0.7817537,0.0009324685,0.2069532,0.01014644,0.00001051811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002084241,0.0003031764,0.9933587,0.0002029282,0.00003451776,0.00004617758,0.00006888377,0.0002010562,0.003700276],"genre_scores_gemma":[0.1282346,0.0009196142,0.86657,0.000173203,0.00005804828,0.0003000619,0.0003168575,0.0001664535,0.003261163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005329804,"threshold_uncertainty_score":0.01783001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2735217689","doi":"10.1287/ijoc.2017.0745","title":"Collaborative Operating Room Planning and Scheduling","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University Health Network; University of Toronto","funders":"","keywords":"Schedule; Operations research; Scheduling (production processes); Operations management; Computer science; Profitability index; Health care; Flexibility (engineering); Business; Economics; Engineering","authors":[{"name":"Vahid Roshanaei","is_ca":true},{"name":"Curtiss Luong","is_ca":true},{"name":"Dionne M. Aleman","is_ca":true},{"name":"David R. Urbach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07147119202570347,"gpt":0.4536454377199059,"spread":0.3821742456942024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001819567,0.0009108693,0.0008886966,0.0006669928,0.0007078953,0.001813353,0.002103459,0.001027024,0.008355415],"category_scores_gemma":[0.003516981,0.0008004573,0.001196198,0.001023503,0.0009428944,0.001475127,0.001547014,0.00125514,0.0006265034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002149459,"about_ca_system_score_gemma":0.003670149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01045855,"about_ca_topic_score_gemma":0.01057122,"domain_scores_codex":[0.9976944,0.0007362162,0.0001016677,0.0005017688,0.0004766838,0.0004892359],"domain_scores_gemma":[0.9982337,0.0008891178,0.0002837872,0.000184913,0.0002195985,0.0001888773],"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.00008269375,0.00005652911,0.0006268948,0.00005426271,0.00003216474,0.00007879886,0.00007334382,0.9501904,0.001015133,0.02773672,0.001338911,0.0187141],"study_design_scores_gemma":[0.00002752163,0.0000500869,0.0003354542,0.000007494275,0.000014783,0.00003310785,0.00006237269,0.9778208,0.0007415203,0.01870703,0.002185523,0.00001435609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03081637,0.0001606198,0.953745,0.0003590427,0.00004730375,0.0001897014,0.0002701464,0.0002269684,0.01418488],"genre_scores_gemma":[0.739799,0.0003505246,0.2491458,0.0001393449,0.00005252707,0.0003066431,0.0005451972,0.00009905041,0.009561906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01045855,"threshold_uncertainty_score":0.0279516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082030917","doi":"10.1287/ijoc.13.3.210.12632","title":"Fast Heuristics for the Maximum Feasible Subsystem Problem","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematical optimization; Cardinality (data modeling); Computer science; Set (abstract data type); Linear programming; Mathematics; Algorithm; Data mining","authors":[{"name":"John W. Chinneck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03735851513923256,"gpt":0.2758705309087951,"spread":0.2385120157695625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166958,0.001644151,0.001449735,0.0017165,0.0009916943,0.001180365,0.001882039,0.001420892,0.005996355],"category_scores_gemma":[0.005549254,0.0009783533,0.001298587,0.002302965,0.0008001095,0.002493165,0.001319377,0.002037542,0.001062618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001589719,"about_ca_system_score_gemma":0.002904704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006011101,"about_ca_topic_score_gemma":0.01111024,"domain_scores_codex":[0.9987274,0.0004947867,0.00005786383,0.0001708806,0.0002637775,0.0002852431],"domain_scores_gemma":[0.996042,0.002869514,0.0002134494,0.0004397069,0.0003170109,0.0001182978],"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.0005683911,0.0002495739,0.0008078709,0.000486496,0.000123029,0.0002395249,0.0002604694,0.6884844,0.00657354,0.04931434,0.02302571,0.2298667],"study_design_scores_gemma":[0.0002498942,0.0001414293,0.0003938078,0.00004982915,0.00005736498,0.0001105326,0.0001134176,0.940041,0.003722984,0.04644036,0.008643202,0.00003623537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0289823,0.0008809008,0.9603658,0.0002994922,0.00008082663,0.0003043969,0.0003544389,0.002390489,0.006341273],"genre_scores_gemma":[0.1251967,0.0004951917,0.8705639,0.0001644121,0.00006630255,0.0004212462,0.0009786718,0.0003358826,0.001777782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006011101,"threshold_uncertainty_score":0.02005976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4353070770","doi":"10.1287/ijoc.2023.1287","title":"Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Windsor","funders":"","keywords":"Integer programming; Computer science; Mathematical optimization; Constraint programming; Scheduling (production processes); Job shop scheduling; Flow shop scheduling; Schedule; Mathematics; Stochastic programming","authors":[{"name":"Bahman Naderi","is_ca":true},{"name":"Rubén Ruíz","is_ca":false},{"name":"Vahid Roshanaei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03150559591981477,"gpt":0.2621582092926764,"spread":0.2306526133728616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01022667,0.002544848,0.001833089,0.002909001,0.0009217361,0.007909136,0.0020714,0.002831833,0.007450467],"category_scores_gemma":[0.0189902,0.001180125,0.002234334,0.006066894,0.00306112,0.01272642,0.001937907,0.007851006,0.001614692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002863825,"about_ca_system_score_gemma":0.002047891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004597524,"about_ca_topic_score_gemma":0.002718815,"domain_scores_codex":[0.9961237,0.00177396,0.0001687497,0.0005004128,0.001175571,0.0002575742],"domain_scores_gemma":[0.97326,0.02277554,0.0005857826,0.001043422,0.001774346,0.0005608369],"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.0004477652,0.000761541,0.003109447,0.003061308,0.0002712117,0.0003290857,0.0003551366,0.1259181,0.001091458,0.3743758,0.03100426,0.4592749],"study_design_scores_gemma":[0.00008527828,0.0004069401,0.001595719,0.002056774,0.0001156252,0.0003268611,0.0005771841,0.4523519,0.001558795,0.4381811,0.1026004,0.00014343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.01583734,0.5627115,0.3303743,0.03171642,0.003088949,0.0001409945,0.0004909247,0.0006743241,0.05496531],"genre_scores_gemma":[0.1924403,0.3899448,0.3841116,0.005759952,0.01174418,0.000371503,0.001308098,0.0007215285,0.01359794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01022667,"threshold_uncertainty_score":0.05408442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027524005","doi":"10.1287/ijoc.1100.0388","title":"Combining Constraint Programming and Local Search for Job-Shop Scheduling","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"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; Sandia National Laboratories; U.S. Department of Energy","keywords":"Tabu search; Constraint programming; Computer science; Job shop scheduling; Mathematical optimization; Guided Local Search; Flow shop scheduling; Hybrid algorithm (constraint satisfaction); Job shop; Local search (optimization); Scheduling (production processes); Iterated local search; Algorithm; Mathematics; Constraint logic programming; Schedule","authors":[{"name":"J. Christopher Beck","is_ca":true},{"name":"Tao Feng","is_ca":true},{"name":"Jean‐Paul Watson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01661260934949381,"gpt":0.2663230316757701,"spread":0.2497104223262763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002623989,0.0008633861,0.001280913,0.001069741,0.0006201279,0.001361233,0.001945228,0.001016129,0.002185787],"category_scores_gemma":[0.006616609,0.0005576619,0.0006985915,0.002409145,0.000904112,0.001583196,0.00157106,0.00144688,0.0006017668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107608,"about_ca_system_score_gemma":0.001780217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006929432,"about_ca_topic_score_gemma":0.008932111,"domain_scores_codex":[0.9982609,0.0007855543,0.00006278719,0.0001957843,0.0005895257,0.0001053622],"domain_scores_gemma":[0.9963581,0.002756856,0.0001771244,0.0002933725,0.000323128,0.00009135423],"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.00008038448,0.00009969343,0.0003617638,0.0001432988,0.00008021111,0.00005415557,0.00006508654,0.8541378,0.001934847,0.02182688,0.001347775,0.1198682],"study_design_scores_gemma":[0.00001059151,0.00002306964,0.00004215157,0.000005072861,0.000008572222,0.00001003518,0.000006311581,0.9937361,0.0006120834,0.004929075,0.0006101386,0.000006745968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007011356,0.0002299999,0.9892884,0.0001175332,0.00002002251,0.0000727533,0.0000261629,0.0006260078,0.002607651],"genre_scores_gemma":[0.2572678,0.0003897291,0.7391751,0.0002064708,0.00007592687,0.0003833042,0.0001229813,0.0002633515,0.002115218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006929432,"threshold_uncertainty_score":0.01387715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123577276","doi":"10.1287/ijoc.1070.0251","title":"Efficient Jump Ahead for 𝔽<sub>2</sub>-Linear Random Number Generators","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Japan Society for the Promotion of Science","keywords":"Modulo; Mathematics; Matrix multiplication; Pseudorandom number generator; Jump; Time complexity; Disjoint sets; Discrete mathematics; Random number generation; Matrix (chemical analysis); Multiplication (music); Sequence (biology); State (computer science); Combinatorics; Algorithm; Iterated function","authors":[{"name":"Hiroshi Haramoto","is_ca":false},{"name":"Makoto Matsumoto","is_ca":false},{"name":"Takuji Nishimura","is_ca":false},{"name":"François Panneton","is_ca":true},{"name":"Pierre L’Ecuyer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02100252490413513,"gpt":0.2610842207849916,"spread":0.2400816958808565,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000620054,0.0004679836,0.0005746958,0.000653829,0.0005599796,0.0007230962,0.0008100584,0.0005114421,0.00763553],"category_scores_gemma":[0.002380519,0.000311106,0.0003735297,0.000492139,0.0005076157,0.001476961,0.001044731,0.0007900172,0.001660054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006643659,"about_ca_system_score_gemma":0.0007264394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008168649,"about_ca_topic_score_gemma":0.001855713,"domain_scores_codex":[0.9994566,0.00009861586,0.00004451901,0.00008924464,0.0002084944,0.0001025355],"domain_scores_gemma":[0.9988858,0.0006762177,0.0001199977,0.0001605295,0.0001087943,0.00004862046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00158332,0.0002302603,0.001545792,0.0003666201,0.00004637985,0.0007612801,0.0005436819,0.09671807,0.08607727,0.1628575,0.009934297,0.6393356],"study_design_scores_gemma":[0.0001866238,0.0003347553,0.0004619157,0.00003579065,0.00002209979,0.0003592846,0.00006277869,0.8719975,0.06118175,0.05815159,0.007150207,0.00005580516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1172821,0.000302336,0.8708375,0.0002413046,0.00009465668,0.0002116782,0.0001521039,0.005715188,0.005163284],"genre_scores_gemma":[0.5755509,0.0001374924,0.41437,0.0001028117,0.00004340215,0.0001815279,0.0003460262,0.0003261805,0.008941576],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00763553,"threshold_uncertainty_score":0.02554339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898866180","doi":"10.1287/ijoc.2018.0806","title":"The Meet-in-the-Middle Principle for Cutting and Packing Problems","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Bin packing problem; Dimension (graph theory); Packing problems; Set (abstract data type); Bin; Mathematical optimization; Limit (mathematics); Computation; Mathematics; Integer programming; Integer (computer science); Combinatorial optimization; Branch and cut; Computer science; Linear programming; Branch and bound; Algorithm; Combinatorics","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Manuel Iori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03233966605804524,"gpt":0.2629264707529498,"spread":0.2305868046949046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003151453,0.002216986,0.001994055,0.001540825,0.001764607,0.003906642,0.003133257,0.002903249,0.01011769],"category_scores_gemma":[0.009247986,0.00141671,0.002812422,0.004485128,0.003018158,0.006876649,0.003505742,0.007074368,0.004176705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001336492,"about_ca_system_score_gemma":0.00236403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001350886,"about_ca_topic_score_gemma":0.001219215,"domain_scores_codex":[0.9957343,0.001254616,0.0002836642,0.0007977394,0.001639824,0.0002898739],"domain_scores_gemma":[0.9978871,0.001175241,0.0002177987,0.0004094482,0.0002040257,0.0001064009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002077365,0.0001547803,0.0005440778,0.0005546818,0.00007001915,0.0002369439,0.0002708427,0.08183903,0.003663707,0.7047108,0.0157844,0.191963],"study_design_scores_gemma":[0.00006898839,0.0002193185,0.0002435017,0.0001423415,0.00003689859,0.0005859666,0.0001050359,0.2488692,0.002571947,0.6973548,0.04974895,0.00005310221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002153855,0.0005509977,0.9867575,0.0003791776,0.0001050253,0.0001202909,0.0001389533,0.0001614366,0.009632789],"genre_scores_gemma":[0.0481864,0.001408239,0.9440781,0.0004050232,0.0002701484,0.0005787725,0.0004583089,0.0002682294,0.004346817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01011769,"threshold_uncertainty_score":0.03384703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2564296586","doi":"10.1287/ijoc.2016.0717","title":"Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Office of Naval Research; National Science Foundation","keywords":"Benders' decomposition; Mathematical optimization; Integer programming; Mathematics; Integer (computer science); Stochastic programming; Branch and cut; Linear programming relaxation; Relaxation (psychology); Variable (mathematics); Space (punctuation); Computer science","authors":[{"name":"Merve Bodur","is_ca":true},{"name":"Sanjeeb Dash","is_ca":false},{"name":"Oktay Günlük","is_ca":false},{"name":"James Luedtke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06866419041123342,"gpt":0.3501395530223786,"spread":0.2814753626111453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006820685,0.00275957,0.001829079,0.001721502,0.0006069283,0.002402371,0.001552797,0.001925012,0.00683135],"category_scores_gemma":[0.01547,0.001465711,0.002020904,0.00197745,0.001730617,0.002948184,0.002347711,0.005575963,0.0009227919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002031727,"about_ca_system_score_gemma":0.002081557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001935714,"about_ca_topic_score_gemma":0.002461967,"domain_scores_codex":[0.9967663,0.001748962,0.0001398483,0.0004037195,0.0006578637,0.0002833025],"domain_scores_gemma":[0.992767,0.00547663,0.0006301981,0.000374658,0.0004798375,0.0002717369],"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.0001218928,0.00007722853,0.0002650826,0.0001631525,0.00006686186,0.00007841672,0.0001053688,0.8382759,0.001434754,0.1280931,0.001619122,0.02969915],"study_design_scores_gemma":[0.00003165123,0.00006461556,0.00008823784,0.00004945004,0.00001610084,0.00002608591,0.00002136435,0.9042965,0.0008676374,0.09260692,0.00191895,0.00001249162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006589468,0.0002090033,0.9901162,0.0001818743,0.00002757943,0.00006010926,0.00008772259,0.0001161852,0.002611878],"genre_scores_gemma":[0.1435939,0.0007755781,0.8484743,0.0003034334,0.0001357252,0.0004522574,0.0005506571,0.0002753774,0.00543875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00683135,"threshold_uncertainty_score":0.0360716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117833774","doi":"10.1287/ijoc.1080.0291","title":"Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"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":"","keywords":"Heuristics; Mathematical optimization; Computer science; Routing (electronic design automation); Operations research; Vendor; Inventory theory; Vehicle routing problem; Time horizon; Markov decision process; Column generation; Markov chain; Inventory management; Inventory control; Markov process; Mathematics; Operations management; Engineering","authors":[{"name":"Lars Magnus Hvattum","is_ca":false},{"name":"Arne Løkketangen","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03873982677101141,"gpt":0.2671217237228494,"spread":0.228381896951838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001771229,0.001062718,0.001356888,0.0009692993,0.0006499379,0.001088227,0.001237847,0.001008351,0.002837248],"category_scores_gemma":[0.003393186,0.0007038339,0.0009509049,0.001694829,0.0008656497,0.001684614,0.0009908302,0.001311192,0.0003419507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001569592,"about_ca_system_score_gemma":0.001745967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0046873,"about_ca_topic_score_gemma":0.007053175,"domain_scores_codex":[0.9987489,0.0008221577,0.00005407622,0.00009921414,0.0001360966,0.000139626],"domain_scores_gemma":[0.996971,0.00248495,0.0001929989,0.00009058324,0.0001263343,0.0001340944],"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.00004531179,0.00003181528,0.0001539497,0.00004721085,0.00002776365,0.00004372362,0.00003439491,0.9708562,0.0001566828,0.01854782,0.0007281576,0.009326985],"study_design_scores_gemma":[0.00002601356,0.00002806844,0.00004261659,0.00001324886,0.000008969081,0.00001714098,0.00002265613,0.9720675,0.0001068111,0.02694617,0.0007137653,0.000007092177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03044283,0.001125325,0.9632022,0.0003317375,0.0000635975,0.0001874472,0.0002479677,0.0003368476,0.004061948],"genre_scores_gemma":[0.6280134,0.001473841,0.3677128,0.0001692077,0.0000601788,0.0004371007,0.0006531236,0.0001023895,0.001378042],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0046873,"threshold_uncertainty_score":0.0113883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144303296","doi":"10.1287/ijoc.1090.0341","title":"Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Kronos (Canada); HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Mathematical optimization; Computer science; Speedup; Constrained Shortest Path First; Shortest path problem; Vehicle routing problem; Path (computing); Scheduling (production processes); Routing (electronic design automation); Context (archaeology); Longest path problem; K shortest path routing; Mathematics; Parallel computing; Theoretical computer science; Computer network","authors":[{"name":"Stefan Irnich","is_ca":false},{"name":"Guy Desaulniers","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"Ahmed Hadjar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01740939486299027,"gpt":0.2875494768532688,"spread":0.2701400819902785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007815429,0.0007786478,0.0004929601,0.0009233327,0.0005305174,0.0007246328,0.0009816057,0.0007074633,0.006392532],"category_scores_gemma":[0.004045456,0.0003634618,0.0005269389,0.001442251,0.0007464354,0.001534971,0.0007547814,0.001346581,0.000770723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008774173,"about_ca_system_score_gemma":0.001376917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004828251,"about_ca_topic_score_gemma":0.006129604,"domain_scores_codex":[0.9993641,0.0002458319,0.00001548154,0.00005293286,0.0002580198,0.00006360163],"domain_scores_gemma":[0.9991112,0.0005660652,0.00006736421,0.0001112047,0.0001201477,0.00002383935],"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.0001183922,0.00009370592,0.0004219424,0.0001479828,0.00003555448,0.00008307785,0.00007155813,0.6673808,0.002853401,0.1818548,0.00432492,0.1426139],"study_design_scores_gemma":[0.00002656531,0.00005855262,0.0002166469,0.00001916416,0.00002097413,0.00005358057,0.0000184731,0.9011753,0.002481946,0.09069688,0.005215892,0.0000159167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01799638,0.0003531945,0.9749463,0.0002944096,0.00005685243,0.00007764087,0.0001116824,0.0002892322,0.005874174],"genre_scores_gemma":[0.3132844,0.000719815,0.6762821,0.000122791,0.00006280886,0.0003550663,0.0003091658,0.0003204954,0.00854332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006392532,"threshold_uncertainty_score":0.02138519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4200572948","doi":"10.1287/ijoc.2021.1113","title":"Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Benders' decomposition; Benchmark (surveying); Computer science; Scheduling (production processes); Integer programming; Range (aeronautics); Set (abstract data type); Algorithm; Mathematics; Routing (electronic design automation); Engineering","authors":[{"name":"Yantong Li","is_ca":false},{"name":"Jean‐François Côté","is_ca":true},{"name":"Leandro C. Coelho","is_ca":true},{"name":"Peng Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02094132286114569,"gpt":0.2660338223751495,"spread":0.2450924995140038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551964,0.001847971,0.0008553055,0.001090168,0.0005237025,0.001712786,0.001593453,0.001220974,0.004685779],"category_scores_gemma":[0.002594586,0.0009013476,0.00160088,0.001535422,0.0008390341,0.001966545,0.00120268,0.003011126,0.0008571587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001466579,"about_ca_system_score_gemma":0.002063403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002399897,"about_ca_topic_score_gemma":0.003031818,"domain_scores_codex":[0.9990867,0.0003193082,0.00004317585,0.0001653042,0.0002696741,0.0001157211],"domain_scores_gemma":[0.9993408,0.0003398288,0.0001041415,0.00005576254,0.0001180097,0.00004139235],"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.00006330298,0.0001505064,0.0003826045,0.0002209995,0.00004166082,0.0001124366,0.00009963914,0.8514985,0.003141302,0.08552384,0.003092981,0.05567225],"study_design_scores_gemma":[0.00002466228,0.00004527945,0.00006649392,0.00002717154,0.00001347935,0.00003373986,0.00002823201,0.9675688,0.0008598772,0.02875984,0.002561958,0.00001053833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005999399,0.0003078963,0.9877901,0.0002670413,0.00004948792,0.0001093861,0.0001145789,0.0001348175,0.005227305],"genre_scores_gemma":[0.119055,0.0008809161,0.8738304,0.000293334,0.0001492395,0.0004917855,0.0005601619,0.0001738645,0.004565247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004685779,"threshold_uncertainty_score":0.01567554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096845859","doi":"10.1287/ijoc.1110.0493","title":"Static Network Reliability Estimation via Generalized Splitting","year":2012,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Reliability (semiconductor); Monte Carlo method; Computer science; Graph; Algorithm; Set (abstract data type); Exploit; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Mathematics; Theoretical computer science; Statistics; Artificial intelligence","authors":[{"name":"Zdravko I. Botev","is_ca":false},{"name":"Pierre L’Ecuyer","is_ca":true},{"name":"Gerardo Rubino","is_ca":false},{"name":"Richard Simard","is_ca":true},{"name":"Bruno Tuffin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008376867683933403,"gpt":0.2290518031673583,"spread":0.2206749354834249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001155142,0.001042765,0.001185599,0.00132567,0.0004149484,0.0006331936,0.001948675,0.0007918257,0.00101706],"category_scores_gemma":[0.00569737,0.0006019802,0.0007362492,0.0009271981,0.0008409823,0.001627018,0.001379233,0.0008957684,0.000265885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007887994,"about_ca_system_score_gemma":0.0008503631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004263365,"about_ca_topic_score_gemma":0.002453073,"domain_scores_codex":[0.9992386,0.0002746351,0.00002792049,0.0001688172,0.0002293054,0.00006072478],"domain_scores_gemma":[0.9976547,0.001106513,0.0003597089,0.0004351658,0.0003413392,0.000102559],"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.00004806226,0.00001534656,0.0009720662,0.00002266275,0.00003116469,0.00004694684,0.00004784262,0.9589395,0.002356287,0.007660713,0.0003844966,0.02947499],"study_design_scores_gemma":[0.000002608033,0.000007413548,0.00006871845,0.000001763364,0.000002337647,0.000009932608,0.000002294292,0.9957806,0.0002825572,0.003731418,0.0001077298,0.000002618782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01400042,0.00006242118,0.9850144,0.00004345068,0.000009907909,0.00001848432,0.00002631171,0.0003108974,0.0005137229],"genre_scores_gemma":[0.6400918,0.0001606159,0.3580267,0.00007037236,0.00004299127,0.0001393518,0.0002744081,0.0001494895,0.00104431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004263365,"threshold_uncertainty_score":0.008477092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096788301","doi":"10.1287/ijoc.1110.0458","title":"Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"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; Research and Innovation Foundation","keywords":"Mathematical optimization; Benders' decomposition; Integer programming; Tabu search; Decomposition; Set (abstract data type); Branch and cut; Truck; Constraint programming; Computer science; Integer (computer science); Branch and price; Facility location problem; Constraint (computer-aided design); Mathematics; Stochastic programming; Engineering","authors":[{"name":"Mohammad M. Fazel-Zarandi","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06676374751484022,"gpt":0.2834394180488443,"spread":0.2166756705340041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001572196,0.001568156,0.0009044144,0.001192331,0.0007219789,0.001558344,0.001022023,0.001176791,0.006238503],"category_scores_gemma":[0.003049853,0.000916401,0.00151284,0.001279972,0.001062837,0.001541106,0.001010472,0.00177058,0.000796232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410248,"about_ca_system_score_gemma":0.002363136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005051496,"about_ca_topic_score_gemma":0.006408298,"domain_scores_codex":[0.9992037,0.0003425301,0.00003061678,0.000102943,0.0002090139,0.0001111822],"domain_scores_gemma":[0.9987941,0.0008709326,0.0001092638,0.0000690634,0.0001216747,0.00003496487],"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.00007353827,0.00008967262,0.0002650648,0.0001169691,0.00004168566,0.00008049839,0.00005589281,0.9246897,0.002695319,0.03180425,0.001275917,0.0388116],"study_design_scores_gemma":[0.00003138973,0.00004467448,0.0000368227,0.00001485716,0.00001597151,0.00002151213,0.00002871562,0.9779279,0.001306924,0.0194768,0.001085905,0.000008506691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008797229,0.0000652928,0.986384,0.0001871007,0.00002568066,0.0001079571,0.00009576383,0.0002654974,0.004071556],"genre_scores_gemma":[0.1339061,0.0002359173,0.8616863,0.0002205632,0.00003777014,0.0003508195,0.0003659774,0.0001294085,0.003067227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006238503,"threshold_uncertainty_score":0.02086985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137804648","doi":"10.1287/ijoc.2013.0589","title":"Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro","keywords":"Dominating set; Connected dominating set; Cardinality (data modeling); Algorithm; Mathematics; Branch and cut; Set (abstract data type); Branch and bound; Benders' decomposition; Strongly connected component; Graph; Mathematical optimization; Combinatorics; Computer science; Integer programming; Minimum spanning tree; Vertex (graph theory)","authors":[{"name":"Bernard Gendron","is_ca":true},{"name":"Abílio Lucena","is_ca":false},{"name":"Alexandre Salles da Cunha","is_ca":false},{"name":"Luidi Simonetti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02272631946703941,"gpt":0.3144781079620658,"spread":0.2917517884950264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052064,0.002276688,0.001550574,0.001835834,0.0009163372,0.001776734,0.002572786,0.001929041,0.003920089],"category_scores_gemma":[0.005862536,0.0009903357,0.001229227,0.003941756,0.000949015,0.003768799,0.001967453,0.002740164,0.001091416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00166983,"about_ca_system_score_gemma":0.00179936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002397768,"about_ca_topic_score_gemma":0.003285726,"domain_scores_codex":[0.9983985,0.0005920774,0.00008278608,0.0003051174,0.0004712278,0.0001502908],"domain_scores_gemma":[0.9976801,0.001360238,0.0002094535,0.0003869934,0.0002306843,0.0001324837],"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.0002795162,0.0003818801,0.0007414028,0.0003756711,0.0001277974,0.00008445082,0.0001836074,0.633697,0.002492825,0.07360381,0.009426702,0.2786054],"study_design_scores_gemma":[0.00008964175,0.0001108961,0.0002178192,0.00003358871,0.00003491867,0.00009674105,0.00003779939,0.9233484,0.001405605,0.06979767,0.004804391,0.00002257925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01341193,0.001143922,0.9780691,0.0003819593,0.00008168019,0.0001773444,0.0002466317,0.0008063,0.005681242],"genre_scores_gemma":[0.09495296,0.0007584892,0.8990476,0.0001883263,0.00009396362,0.0004390563,0.000817766,0.0002444368,0.003457507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003920089,"threshold_uncertainty_score":0.01311398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003457692","doi":"10.1287/ijoc.1060.0196","title":"Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Royal Military College of Canada; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variable neighborhood search; Mathematical optimization; Heuristic; Variable (mathematics); Metaheuristic; Simple (philosophy); Mathematics; Metric (unit); Resolution (logic); Fixed cost; Dual (grammatical number); Local search (optimization); Computer science; Engineering; Artificial intelligence; Operations management","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Jack Brimberg","is_ca":true},{"name":"Dragan Urošević","is_ca":false},{"name":"Nenad Mladenović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03282244739683856,"gpt":0.2662847082374216,"spread":0.2334622608405831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001298741,0.0006227143,0.001290284,0.0008187774,0.0004069137,0.000770823,0.0007573027,0.0009203592,0.003377768],"category_scores_gemma":[0.0024518,0.0004434012,0.0005501843,0.0009272679,0.0006944144,0.0005445287,0.0007218489,0.0009000393,0.0002942558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008469861,"about_ca_system_score_gemma":0.001378846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003890245,"about_ca_topic_score_gemma":0.003795907,"domain_scores_codex":[0.9996271,0.0002128776,0.000009131288,0.00004077186,0.0000675081,0.00004252975],"domain_scores_gemma":[0.9992167,0.0005747665,0.00006814695,0.00003383936,0.00006632309,0.000040239],"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.00005827855,0.00004690112,0.0002042864,0.00005415255,0.00001730682,0.00003828483,0.00001368418,0.9762681,0.0002530397,0.01086945,0.0008145002,0.01136209],"study_design_scores_gemma":[0.00001756319,0.00001994213,0.00004886309,0.000005244712,0.000004340164,0.000009468342,0.000005974946,0.9957658,0.0001089756,0.003671931,0.000339786,0.00000210303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09578269,0.0007098465,0.8905191,0.0004393625,0.00009345268,0.0001711748,0.0002414477,0.0002533675,0.01178953],"genre_scores_gemma":[0.5709993,0.000345592,0.4227377,0.0001265419,0.00005899326,0.0003908222,0.0003386015,0.0001202133,0.00488211],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003890245,"threshold_uncertainty_score":0.01129973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097828930","doi":"10.1287/ijoc.1100.0425","title":"An Improved Primal Simplex Algorithm for Degenerate Linear Programs","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":true,"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":"Degeneracy (biology); Simplex algorithm; Simplex; Linear programming; Degenerate energy levels; Criss-cross algorithm; Algorithm; Mathematics; Mathematical optimization; Linear-fractional programming; Function (biology); Sequence (biology); Computer science; Combinatorics","authors":[{"name":"Issmail Elhallaoui","is_ca":true},{"name":"Abdelmoutalib Metrane","is_ca":false},{"name":"Guy Desaulniers","is_ca":true},{"name":"François Soumis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05516187897734527,"gpt":0.3963921387197743,"spread":0.341230259742429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002062008,0.001281618,0.001948314,0.001284359,0.0009279993,0.001469349,0.001898437,0.001735276,0.007459051],"category_scores_gemma":[0.005127673,0.0009349764,0.001197079,0.001453431,0.001084678,0.001665281,0.002659737,0.003216568,0.002135441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000908025,"about_ca_system_score_gemma":0.002266169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002391039,"about_ca_topic_score_gemma":0.002175996,"domain_scores_codex":[0.9985265,0.0006031845,0.00006865304,0.0001853837,0.0004738853,0.0001423883],"domain_scores_gemma":[0.9987323,0.0005765576,0.00009056206,0.0001726927,0.0003356049,0.00009220515],"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.0002825693,0.0001759771,0.0005436665,0.0002218028,0.00006821665,0.0001754394,0.0001840178,0.7099596,0.004136184,0.09786025,0.006582755,0.1798095],"study_design_scores_gemma":[0.00003400828,0.00003110243,0.00003388788,0.00001220536,0.000005322906,0.00004105885,0.000009070627,0.9818287,0.0006736441,0.01444063,0.002881123,0.000009215032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003065781,0.0001430876,0.9935638,0.00007714318,0.00003917622,0.000067091,0.00003935746,0.0003921964,0.002612342],"genre_scores_gemma":[0.06784378,0.0002145357,0.9275963,0.00009656021,0.00006092136,0.0003156994,0.0002199284,0.0003128888,0.003339343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007459051,"threshold_uncertainty_score":0.02495301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096910555","doi":"10.1287/ijoc.2014.0600","title":"Districting for Arc Routing","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":57,"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":"Deutsche Forschungsgemeinschaft","keywords":"Arc routing; Roulette; Tabu search; Social connectedness; Compact space; Mathematical optimization; Subroutine; Routing (electronic design automation); Computer science; Heuristic; Context (archaeology); Vehicle routing problem; Mathematics","authors":[{"name":"Alexander Butsch","is_ca":false},{"name":"Jörg Kalcsics","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01790350182192475,"gpt":0.2714472516494821,"spread":0.2535437498275573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000573811,0.0007145134,0.0008457977,0.001154228,0.0009352362,0.001247355,0.001277228,0.0007415296,0.01062901],"category_scores_gemma":[0.001700063,0.000448818,0.0008174178,0.001496024,0.0009453655,0.001530427,0.001266403,0.001133357,0.001391049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00109787,"about_ca_system_score_gemma":0.0008258385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001985004,"about_ca_topic_score_gemma":0.003216897,"domain_scores_codex":[0.9993216,0.0002695138,0.00002657374,0.0001468032,0.0001482439,0.00008735293],"domain_scores_gemma":[0.9995013,0.0002600666,0.00005428413,0.00009701579,0.00005202368,0.00003519424],"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.00008471062,0.00006824967,0.0005892031,0.0003741509,0.00004258506,0.00009041975,0.0001487276,0.5287827,0.004941443,0.1833239,0.00428257,0.2772712],"study_design_scores_gemma":[0.00003984266,0.0002330079,0.0005170517,0.0001064178,0.00005485115,0.0003060468,0.0001653519,0.7484349,0.00619832,0.1806518,0.06324143,0.00005100743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007121161,0.0006446631,0.9817204,0.0001121027,0.00005679431,0.00009260791,0.00007887351,0.0003595157,0.009813772],"genre_scores_gemma":[0.2104119,0.0009153316,0.7791955,0.00009857188,0.00007425837,0.0002123635,0.0002896416,0.0002826239,0.008519917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01062901,"threshold_uncertainty_score":0.03555757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139218870","doi":"10.1287/ijoc.1040.0103","title":"A New Mathematical-Programming Framework for Facility-Layout Design","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Facility location problem; Relaxation (psychology); Mathematics","authors":[{"name":"Miguel F. Anjos","is_ca":true},{"name":"Anthony Vannelli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02434185302240616,"gpt":0.2593529290570322,"spread":0.2350110760346261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002911212,0.002275302,0.001450002,0.001640852,0.0009937955,0.002649932,0.003837684,0.001724292,0.008699426],"category_scores_gemma":[0.003922302,0.001216653,0.002429867,0.002803999,0.001646661,0.002661182,0.002366252,0.003811268,0.002982744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002295691,"about_ca_system_score_gemma":0.003726337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003548246,"about_ca_topic_score_gemma":0.005035991,"domain_scores_codex":[0.9977132,0.0008316817,0.00009784882,0.0002879428,0.0008962213,0.0001730519],"domain_scores_gemma":[0.9988034,0.0006115022,0.0001214872,0.0001305989,0.0002623848,0.00007063984],"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.00001810475,0.00005776,0.0001269092,0.0002989019,0.00003898893,0.00008179669,0.00006797734,0.5009431,0.001156238,0.4467297,0.005342434,0.04513806],"study_design_scores_gemma":[0.00002559733,0.00004383994,0.00003727545,0.00004641274,0.00001899283,0.00009700508,0.00001973833,0.8314649,0.0007100009,0.1380069,0.02950647,0.0000229379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001585413,0.00009740055,0.9978417,0.00007459161,0.00002333181,0.00002600087,0.00003325607,0.00005143065,0.001693675],"genre_scores_gemma":[0.01869124,0.0005749656,0.9771401,0.0001071874,0.0000931613,0.0003740305,0.0001562973,0.000119701,0.002743284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008699426,"threshold_uncertainty_score":0.02910244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170296950","doi":"10.1287/ijoc.1040.0128","title":"A Memetic Heuristic for the Generalized Quadratic Assignment Problem","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"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":"","keywords":"Quadratic assignment problem; Mathematical optimization; Heuristic; Memetic algorithm; Assignment problem; Generalized assignment problem; Generalization; Integer programming; Matrix (chemical analysis); Mathematics; Weapon target assignment problem; Computer science; Branch and bound; Linear bottleneck assignment problem; Container (type theory); Linear programming; Quadratic equation; Local search (optimization); Optimization problem; Engineering","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Manlio Gaudioso","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Luigi Moccia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01745726383268033,"gpt":0.2652813078728558,"spread":0.2478240440401755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090557,0.0009165267,0.0009324334,0.001003225,0.0007519786,0.0008851941,0.001647758,0.00162806,0.003279798],"category_scores_gemma":[0.0026036,0.0005699432,0.0007385412,0.0009627963,0.0009498051,0.0009114775,0.0009416717,0.0009178017,0.0004120097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001079225,"about_ca_system_score_gemma":0.001347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002754019,"about_ca_topic_score_gemma":0.002752255,"domain_scores_codex":[0.9994723,0.000256424,0.00001795604,0.00007701037,0.00009837609,0.00007783748],"domain_scores_gemma":[0.9991952,0.0005183318,0.00008197016,0.0000613064,0.00009359929,0.00004959519],"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.00008979223,0.00007130931,0.0001576557,0.00006831,0.00003698896,0.0001068412,0.00004969976,0.9534873,0.0007899151,0.01070998,0.002397492,0.03203468],"study_design_scores_gemma":[0.00004654694,0.00004433778,0.00004144363,0.00001014993,0.000008050912,0.00003765846,0.00001536357,0.992301,0.0002325929,0.005888054,0.00136861,0.000006140262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03727227,0.0006161995,0.9496542,0.000648129,0.0002116849,0.000226395,0.0001173851,0.0004999538,0.01075378],"genre_scores_gemma":[0.4883091,0.0004811231,0.5005068,0.0005517213,0.0001595986,0.000722806,0.0002593677,0.000140743,0.008868871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003279798,"threshold_uncertainty_score":0.01097202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031790563","doi":"10.1287/ijoc.1080.0281","title":"Efficient Correlation Matching for Fitting Discrete Multivariate Distributions with Arbitrary Marginals and Normal-Copula Dependence","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Copula (linguistics); Multivariate random variable; Univariate; Marginal distribution; Applied mathematics; Multivariate normal distribution; Rate of convergence; Bivariate analysis; Inverse; Random variable; Multivariate statistics; Statistics; Geometry; Computer science","authors":[{"name":"Athanassios N. Avramidis","is_ca":false},{"name":"Nabil Channouf","is_ca":true},{"name":"Pierre L’Ecuyer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05511673661127251,"gpt":0.3457310741691375,"spread":0.2906143375578649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005331236,0.001019984,0.001171335,0.001601255,0.0006128308,0.001226186,0.001652103,0.001234823,0.002718003],"category_scores_gemma":[0.02572201,0.0007591173,0.001269786,0.001725481,0.001125814,0.001899892,0.001966449,0.002192778,0.00113755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001418153,"about_ca_system_score_gemma":0.00225987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007474483,"about_ca_topic_score_gemma":0.006405663,"domain_scores_codex":[0.9981561,0.0008651048,0.000076728,0.000276757,0.0004832665,0.00014205],"domain_scores_gemma":[0.9906997,0.006689541,0.0006501834,0.0009008983,0.0008207053,0.0002390836],"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.0001870506,0.0001249107,0.003591113,0.000165687,0.0001082205,0.0002290647,0.0002216765,0.8032329,0.004711198,0.06505235,0.003080952,0.1192949],"study_design_scores_gemma":[0.000004416745,0.000007132811,0.0001423529,0.000004798727,0.000002497709,0.00002424086,0.000007412332,0.99434,0.0004870461,0.004679505,0.0002948647,0.000005735607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008151074,0.0001088554,0.9904912,0.00006128144,0.00001118695,0.00002920813,0.00003036846,0.0005670923,0.0005497365],"genre_scores_gemma":[0.2519297,0.0002130862,0.7449774,0.0001578768,0.00003623413,0.0001464477,0.0003293932,0.0005235636,0.001686314],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007474483,"threshold_uncertainty_score":0.02819461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104293546","doi":"10.1287/ijoc.1030.0045","title":"An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue","year":2004,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":54,"is_retracted":false,"has_abstract":true,"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; George Mason University; National Science Foundation","keywords":"Laplace transform; Convergence (economics); Applied mathematics; Queueing theory; Mathematical optimization; Algorithm; Mathematics; Queue; Computer science; Distribution (mathematics); Probability distribution; Mathematical proof; Mathematical analysis","authors":[{"name":"John Shortle","is_ca":false},{"name":"Percy H. Brill","is_ca":true},{"name":"Martin J. Fischer","is_ca":false},{"name":"Donald Gross","is_ca":false},{"name":"D.M. Bevilacqua Masi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01100501900988031,"gpt":0.2535491209065889,"spread":0.2425441018967086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009989357,0.001015494,0.0006415818,0.001360542,0.0008883635,0.001177641,0.001376345,0.001340918,0.005813803],"category_scores_gemma":[0.004558729,0.0004657702,0.0005550208,0.001075875,0.0005664771,0.00113256,0.00130121,0.001471607,0.002461985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001143783,"about_ca_system_score_gemma":0.002650305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007069292,"about_ca_topic_score_gemma":0.007273033,"domain_scores_codex":[0.9996574,0.00005773452,0.00003712695,0.00008057774,0.0001146066,0.00005245384],"domain_scores_gemma":[0.9991282,0.0004766857,0.00008274929,0.00007516725,0.0001904506,0.0000467641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005012825,0.000264699,0.003866469,0.0002659906,0.0001130847,0.0003894239,0.000323477,0.4145642,0.01366543,0.05657662,0.009801652,0.4996677],"study_design_scores_gemma":[0.0001079113,0.00004685943,0.0002709827,0.00001426915,0.00001540907,0.00009355977,0.0000230632,0.9780028,0.00335338,0.01604234,0.002008801,0.00002058366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005507981,0.00008224207,0.9913886,0.000129971,0.00003859787,0.00009474584,0.00007373432,0.001809343,0.0008747199],"genre_scores_gemma":[0.08146564,0.00009643171,0.9157126,0.0001152192,0.00004061303,0.0002796159,0.0002414938,0.0001827214,0.001865666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007069292,"threshold_uncertainty_score":0.01944911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903903106","doi":"10.1287/ijoc.2018.0819","title":"Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematical optimization; Network planning and design; Stochastic optimization; Path (computing); Stochastic programming; Quality (philosophy); Stochastic process; Mathematics","authors":[{"name":"Xin Wang","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Stein W. Wallace","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04904796322602469,"gpt":0.3218126665640246,"spread":0.2727647033379999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003764586,0.0009342266,0.0009604114,0.0009907684,0.00074117,0.001486811,0.0009670712,0.001242581,0.002806065],"category_scores_gemma":[0.01629905,0.0007514521,0.0009599444,0.0009792915,0.001024889,0.001704782,0.0009652081,0.001218526,0.0001551884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002113659,"about_ca_system_score_gemma":0.002722532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006503657,"about_ca_topic_score_gemma":0.007413494,"domain_scores_codex":[0.9984384,0.0008633435,0.00005665616,0.0001940387,0.0002766341,0.0001709076],"domain_scores_gemma":[0.991473,0.006717633,0.0006889869,0.0003619232,0.0004985873,0.0002599228],"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.00002169094,0.00001280529,0.0003054405,0.00003130479,0.00001490644,0.00001517601,0.00001762432,0.9760148,0.0002031925,0.018628,0.0001831295,0.004551827],"study_design_scores_gemma":[0.000009720624,0.0000272229,0.00009223665,0.00001221842,0.000007977595,0.000008052548,0.00001877153,0.9756051,0.0001828412,0.02371823,0.0003129298,0.000004775839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07693961,0.0004076247,0.9168782,0.0007801345,0.00005734547,0.00008220934,0.0001634954,0.00009790077,0.004593502],"genre_scores_gemma":[0.7632409,0.0005560042,0.234336,0.0001302848,0.00005036387,0.000182878,0.0001877351,0.00008422796,0.001231425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006503657,"threshold_uncertainty_score":0.01990926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165859768","doi":"10.1287/ijoc.1110.0488","title":"Assessing the Value of Dynamic Pricing in Network Revenue Management","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dynamic pricing; Mathematical optimization; Revenue management; Computer science; Revenue; Upper and lower bounds; Decomposition; Operations research; Mathematics; Economics; Microeconomics; Finance","authors":[{"name":"Dan Zhang","is_ca":false},{"name":"Zhaosong Lu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02911875917340592,"gpt":0.2606838341522386,"spread":0.2315650749788327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006745108,0.0008438673,0.00117029,0.001160512,0.0008201739,0.00282486,0.001971506,0.001622404,0.002100236],"category_scores_gemma":[0.03439936,0.0005531294,0.0005308829,0.001691759,0.001949654,0.005451604,0.001896161,0.002129966,0.0001481136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00293693,"about_ca_system_score_gemma":0.001789129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00520173,"about_ca_topic_score_gemma":0.002964391,"domain_scores_codex":[0.9973144,0.001721823,0.00004966133,0.000226769,0.000402932,0.0002843808],"domain_scores_gemma":[0.9708637,0.02583023,0.000910508,0.0009990894,0.0007396616,0.0006567885],"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.0001954244,0.00009507933,0.001352724,0.00004079585,0.00002471867,0.00004390652,0.00002589069,0.9642699,0.0002477896,0.02294543,0.0003876868,0.01037073],"study_design_scores_gemma":[0.00001374987,0.00004367264,0.0002049977,0.000006006388,0.00000669211,0.00001206507,0.00002128136,0.9916466,0.0001365992,0.007793037,0.000109563,0.000005834669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6889586,0.002122218,0.2876448,0.002251266,0.0001238593,0.0001502615,0.0002101705,0.000228912,0.01830987],"genre_scores_gemma":[0.98685,0.00022712,0.01244945,0.00003735097,0.00002475432,0.00001849686,0.00003871598,0.00001659972,0.0003375763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006745108,"threshold_uncertainty_score":0.03567201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2612103136","doi":"10.1287/ijoc.2016.0738","title":"Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Subgradient method; Heuristics; Lagrangian relaxation; Mathematical optimization; Facility location problem; Modular design; Integer programming; Computer science; Scale (ratio); Mathematics","authors":[{"name":"Sanjay Dominik Jena","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Bernard Gendron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02289423356633755,"gpt":0.2544070205952862,"spread":0.2315127870289486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002291995,0.001219862,0.001208729,0.001218341,0.0005818761,0.001135851,0.001935757,0.001093796,0.004121955],"category_scores_gemma":[0.004035859,0.000948893,0.001142274,0.001902899,0.0009230631,0.001420833,0.001582275,0.001443104,0.0004985969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001810769,"about_ca_system_score_gemma":0.002126629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006301861,"about_ca_topic_score_gemma":0.009210793,"domain_scores_codex":[0.9989929,0.0005167527,0.00002968818,0.0001215757,0.0001496644,0.0001894394],"domain_scores_gemma":[0.9972997,0.001871449,0.000364238,0.0001867627,0.0001412009,0.0001365861],"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.00002750446,0.00003437438,0.0001344402,0.00005452198,0.00001703399,0.00005162362,0.00002275534,0.9831372,0.0002544809,0.007291045,0.001199066,0.007775817],"study_design_scores_gemma":[0.00003137096,0.00002229729,0.00006012758,0.000009922891,0.000007674531,0.00001266656,0.00001939805,0.9930282,0.0001895183,0.005924283,0.0006896015,0.000004877643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03695687,0.0004308469,0.9553068,0.0003409946,0.00004755822,0.0002071805,0.0003126045,0.0006666969,0.00573049],"genre_scores_gemma":[0.4215814,0.0003978827,0.5738658,0.0001993796,0.0000615523,0.0004381271,0.0006554755,0.0002889308,0.002511363],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006301861,"threshold_uncertainty_score":0.01378936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162009963","doi":"10.1287/ijoc.1070.0225","title":"Time-Indexed Formulations and the Total Weighted Tardiness Problem","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"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":"Tardiness; Column generation; Mathematical optimization; Mathematics; Integer programming; Time horizon; Computer science; Job shop scheduling","authors":[{"name":"Louis-Philippe Bigras","is_ca":true},{"name":"Michel Gamache","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006188593073335101,"gpt":0.2191575147527325,"spread":0.2129689216793974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049564,0.00123187,0.0005901932,0.0006758766,0.0004700361,0.001487419,0.001451322,0.0007907011,0.006924928],"category_scores_gemma":[0.002246431,0.0004627542,0.00078879,0.001373109,0.0006397515,0.001666275,0.0007366532,0.001748466,0.0007640168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001052976,"about_ca_system_score_gemma":0.00168385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002071493,"about_ca_topic_score_gemma":0.003104647,"domain_scores_codex":[0.9989869,0.0003814421,0.00004849377,0.0001223901,0.0003453751,0.0001154609],"domain_scores_gemma":[0.9991805,0.000416633,0.0001241652,0.00006066939,0.0001622985,0.00005569768],"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.0001205779,0.0002161445,0.0001699435,0.0002816471,0.00004947369,0.0002415158,0.0001681466,0.5274796,0.005285929,0.3686365,0.008109967,0.08924038],"study_design_scores_gemma":[0.00006817628,0.000143037,0.0001293602,0.00005652454,0.00002584091,0.0001404431,0.00009440089,0.7954707,0.002371683,0.1864573,0.01502074,0.000021796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007586009,0.0004416724,0.978053,0.0003404992,0.00009627132,0.00009009815,0.0001834986,0.0001341795,0.01307472],"genre_scores_gemma":[0.1644563,0.001616078,0.8118096,0.0002395487,0.0002577318,0.0004656904,0.000808402,0.0002706764,0.02007603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006924928,"threshold_uncertainty_score":0.02316618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124475618","doi":"10.1287/ijoc.1100.0406","title":"A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Mathematical optimization; Set packing; Bin; Branch and bound; Mathematics; Heuristics; Branch and cut; Algorithm; Branching (polymer chemistry); Set (abstract data type); Scheduling (production processes); Computer science; Integer programming","authors":[{"name":"Samir Elhedhli","is_ca":true},{"name":"Lingzi Li","is_ca":true},{"name":"Mariem Gzara","is_ca":false},{"name":"Joe Naoum‐Sawaya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0101253620362066,"gpt":0.2244824884865048,"spread":0.2143571264502983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151818,0.001206709,0.001539969,0.001177743,0.001155551,0.001575825,0.002229724,0.001847577,0.01146652],"category_scores_gemma":[0.004271437,0.0008438058,0.001030511,0.002626706,0.0007754767,0.00241947,0.00266595,0.003029564,0.002000377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088032,"about_ca_system_score_gemma":0.002409001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003019581,"about_ca_topic_score_gemma":0.003522233,"domain_scores_codex":[0.9989367,0.0002434147,0.00006986788,0.000149158,0.0004481774,0.000152619],"domain_scores_gemma":[0.999019,0.0005505595,0.00007091121,0.00009746479,0.0001909695,0.00007110162],"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.000185434,0.0003251045,0.0005921123,0.0003141717,0.00008810638,0.0002499817,0.000211633,0.4041062,0.005237954,0.07208867,0.01399825,0.5026025],"study_design_scores_gemma":[0.000113443,0.00008609007,0.0001244925,0.00002253706,0.00002672277,0.0001519187,0.00003673074,0.9526123,0.001531577,0.03819547,0.007075271,0.0000234725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003181403,0.0001892938,0.9934086,0.0001825501,0.00005079924,0.0001487133,0.00005161969,0.0003475868,0.002439471],"genre_scores_gemma":[0.03090531,0.000223481,0.9662881,0.00007336927,0.00004317515,0.0003022304,0.0001923057,0.0001539366,0.00181812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01146652,"threshold_uncertainty_score":0.0383594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4378219327","doi":"10.1287/ijoc.2022.0185","title":"Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Hydro-Québec; Université de Montréal","funders":"","keywords":"Heuristics; Computer science; Mathematical optimization; Heuristic; Greedy algorithm; Bilevel optimization; Operations research; Electric vehicle; Charging station; Greedy randomized adaptive search procedure; Frame (networking); Optimization problem; Algorithm; Artificial intelligence; Engineering; Mathematics; Power (physics)","authors":[{"name":"Steven J. Lamontagne","is_ca":true},{"name":"Margarida Carvalho","is_ca":true},{"name":"Emma Frejinger","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Miguel F. Anjos","is_ca":false},{"name":"Ribal Atallah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01585056574937413,"gpt":0.2570950592293931,"spread":0.241244493480019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001855376,0.001209109,0.001639794,0.0008023989,0.0004135181,0.002273754,0.001450991,0.001824637,0.005507952],"category_scores_gemma":[0.004565801,0.001225191,0.001562593,0.001431429,0.001033451,0.001394864,0.00136985,0.001792385,0.0005037788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002137829,"about_ca_system_score_gemma":0.002085418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008155492,"about_ca_topic_score_gemma":0.007396489,"domain_scores_codex":[0.9988244,0.0005820584,0.00003772312,0.0001750141,0.0002176446,0.0001631488],"domain_scores_gemma":[0.9973979,0.002014919,0.0002244455,0.00007543903,0.0001605368,0.0001267457],"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.00001194033,0.00001029355,0.000118279,0.00002618075,0.000008408605,0.00001996614,0.00001312649,0.9924201,0.00009458924,0.005314608,0.0001773985,0.001785105],"study_design_scores_gemma":[0.000007301544,0.00001097211,0.00003662901,0.000006161225,0.000003621054,0.000005550364,0.000007782088,0.9949244,0.000067762,0.004509095,0.0004172531,0.000003406379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01972912,0.0003688039,0.9719021,0.0004747294,0.00005578428,0.0001094715,0.0002985725,0.0001172852,0.006944036],"genre_scores_gemma":[0.6877187,0.001024392,0.2951554,0.0001795588,0.00008098677,0.0006035364,0.0004888617,0.0001471196,0.01460138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008155492,"threshold_uncertainty_score":0.01842594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3122681984","doi":"10.1287/ijoc.2020.1014","title":"Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Compute Canada; Università Degli Studi di Modena e Reggio Emila","keywords":"Bin packing problem; Set packing; Set (abstract data type); Packing problems; Generalization; Bin; Heuristics; Heuristic; Mathematics; Mathematical optimization; Benchmark (surveying); Bounding overwatch; Decomposition; Benders' decomposition; Algorithm; Container (type theory); Computer science; Preprocessor; Branch and cut; Combinatorial optimization; Integer programming; Artificial intelligence","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Mohamed Haouari","is_ca":false},{"name":"Manuel Iori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01548544245106256,"gpt":0.2649396540186887,"spread":0.2494542115676262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114529,0.0024159,0.001217378,0.001590625,0.0006584458,0.002098203,0.001768391,0.001655907,0.01379391],"category_scores_gemma":[0.00383666,0.0008116574,0.002167156,0.002848766,0.000899863,0.002781464,0.001858036,0.004938826,0.003687087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503181,"about_ca_system_score_gemma":0.001712678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002155154,"about_ca_topic_score_gemma":0.002178231,"domain_scores_codex":[0.9986748,0.0003722144,0.00007368316,0.0002865894,0.0004457364,0.0001470305],"domain_scores_gemma":[0.9988204,0.000546088,0.0001421246,0.0001950391,0.0002078647,0.00008843437],"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.0002767177,0.0005380775,0.001023701,0.001028209,0.000163371,0.0003081185,0.0002273179,0.4917166,0.006749075,0.2150641,0.04199051,0.2409142],"study_design_scores_gemma":[0.00008044831,0.0001399443,0.0004609853,0.0001848241,0.00006807806,0.0003330279,0.00008588196,0.7848467,0.002527832,0.1789742,0.03224327,0.0000549029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007107111,0.00113219,0.9723173,0.0006615956,0.0002733252,0.0002795456,0.0006573066,0.0007023808,0.01686926],"genre_scores_gemma":[0.1245942,0.002601152,0.8541479,0.0008155836,0.0004832694,0.0008159414,0.003814288,0.0005312177,0.01219641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01379391,"threshold_uncertainty_score":0.04614526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121094316","doi":"10.1287/ijoc.1030.0046","title":"The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs","year":2004,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extreme point; Mathematical optimization; Constraint (computer-aided design); Point (geometry); Feasible region; Nonlinear programming; Nonlinear system; Mathematics; Projection (relational algebra); Computer science; Algorithm; Combinatorics","authors":[{"name":"John W. Chinneck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1117965981494792,"gpt":0.4271677390108882,"spread":0.315371140861409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216393,0.001118283,0.001172509,0.0008262419,0.000833598,0.0007555276,0.001315445,0.001225061,0.003251612],"category_scores_gemma":[0.004966429,0.0005645068,0.0006518249,0.001110192,0.001189908,0.001762748,0.001472946,0.002128964,0.0008261065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006459394,"about_ca_system_score_gemma":0.001783292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005092754,"about_ca_topic_score_gemma":0.003436959,"domain_scores_codex":[0.9990876,0.0002766143,0.00003153046,0.0001463759,0.0004096145,0.00004833206],"domain_scores_gemma":[0.9985013,0.0009088011,0.0001404834,0.0001480693,0.0002488844,0.00005250007],"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.00009048077,0.00003755421,0.0002370866,0.0001553889,0.00004871143,0.00008156308,0.00009997311,0.8208858,0.003881069,0.04547617,0.002187205,0.126819],"study_design_scores_gemma":[0.0000184369,0.00003960566,0.00004586335,0.00001004563,0.000005625866,0.00002966319,0.000009194652,0.9856793,0.001321138,0.01088851,0.001940066,0.00001249363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001231257,0.000064637,0.9977161,0.00003535765,0.00001062511,0.00002371384,0.00001001585,0.0001134331,0.0007948718],"genre_scores_gemma":[0.137868,0.0003520294,0.8581609,0.00007437592,0.00004882788,0.000354993,0.0001304667,0.0001552948,0.002855242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005092754,"threshold_uncertainty_score":0.01087773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125126715","doi":"10.1287/ijoc.1110.0489","title":"A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":44,"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":"Ministero dell'Università e della Ricerca","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; 2-opt; Traveling purchaser problem; Pickup; Branch and cut; Mathematical optimization; Algorithm; Computer science; Path (computing); Mathematics; Branch and bound; Shortest path problem; Nearest neighbour algorithm; Combinatorial optimization; Hamiltonian path; Stack (abstract data type); Integer programming; Theoretical computer science; Graph; Artificial intelligence","authors":[{"name":"Manuel A. Alba Martínez","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Mauro Dell’Amico","is_ca":false},{"name":"Manuel Iori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03182662460064117,"gpt":0.2557665983680457,"spread":0.2239399737674045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114501,0.001715725,0.001685503,0.001205838,0.001426348,0.001717293,0.001986586,0.001962919,0.01192886],"category_scores_gemma":[0.002626263,0.0009768426,0.001102339,0.002477041,0.0005210926,0.002312678,0.001630908,0.002423669,0.001901169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001414026,"about_ca_system_score_gemma":0.003013035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008820892,"about_ca_topic_score_gemma":0.008912121,"domain_scores_codex":[0.9992612,0.0001698922,0.00004216499,0.0001956816,0.0001756275,0.0001554659],"domain_scores_gemma":[0.99896,0.0006558377,0.00008246423,0.00007959368,0.0001383613,0.00008380887],"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.0002620817,0.0004867713,0.0006022037,0.0002889971,0.00008560285,0.000212873,0.0001661581,0.5627932,0.002537061,0.02371156,0.01635092,0.3925025],"study_design_scores_gemma":[0.0001120318,0.000100164,0.0001379727,0.00002015575,0.00002436108,0.00007051909,0.00005813568,0.9787714,0.000806287,0.01609424,0.003790536,0.00001421734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01479153,0.0004422448,0.976014,0.0003569026,0.00008548023,0.0003519455,0.0003296669,0.001288096,0.006340229],"genre_scores_gemma":[0.06487407,0.0002665427,0.9299942,0.00009518611,0.0000449931,0.0004076526,0.000887387,0.000271398,0.003158619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01192886,"threshold_uncertainty_score":0.03990602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951567270","doi":"10.1287/ijoc.2018.0863","title":"Group Maintenance: A Restless Bandits Approach","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Lagrangian relaxation; Markov decision process; Heuristics; Computer science; Time horizon; Curse of dimensionality; Linear programming relaxation; Linear programming; Scheduling (production processes); Dynamic programming; Benchmark (surveying); Stochastic programming; Mathematics; Markov process","authors":[{"name":"Abderrahmane Abbou","is_ca":true},{"name":"Viliam Makiš","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006555777813665351,"gpt":0.1982996675055645,"spread":0.1917438896918992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449305,0.001022497,0.001437163,0.0007123391,0.0005907267,0.00135827,0.001789237,0.001315544,0.00460087],"category_scores_gemma":[0.004092286,0.0006375712,0.0006568212,0.0007242368,0.001229546,0.001718532,0.001016416,0.001464354,0.0004140717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001722285,"about_ca_system_score_gemma":0.001401262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007029783,"about_ca_topic_score_gemma":0.0048234,"domain_scores_codex":[0.9992822,0.000300104,0.000022887,0.0001231296,0.0001302359,0.0001415884],"domain_scores_gemma":[0.9984478,0.0009994436,0.0002220032,0.0001061011,0.0001345487,0.00009016077],"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.00006542692,0.00004010063,0.00017612,0.0000313027,0.00001657989,0.0000320834,0.00003550855,0.9764608,0.0002885959,0.01476167,0.0005278459,0.007564056],"study_design_scores_gemma":[0.000008767838,0.00001592602,0.00002635058,0.000003837961,0.000003829139,0.000003682152,0.000008087432,0.9935089,0.00009294929,0.006098636,0.0002266523,0.000002269774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03704125,0.0002984552,0.9540567,0.0004524587,0.00005586562,0.00008874501,0.0001034963,0.0003096749,0.00759336],"genre_scores_gemma":[0.8360869,0.0002807853,0.1562215,0.0002671182,0.0000823199,0.0002531319,0.0001840164,0.0001748691,0.006449447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007029783,"threshold_uncertainty_score":0.01539147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157541676","doi":"10.1287/ijoc.1100.0446","title":"An Optimal Constraint Programming Approach to the Open-Shop Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Heuristics; Mathematical optimization; Computer science; Metaheuristic; Branch and bound; Scheduling (production processes); Benchmark (surveying); Constraint logic programming; Mathematics; Stochastic programming","authors":[{"name":"Arnaud Malapert","is_ca":true},{"name":"Hadrien Cambazard","is_ca":false},{"name":"Christelle Guéret","is_ca":false},{"name":"Narendra Jussien","is_ca":false},{"name":"André Langevin","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03676578007654528,"gpt":0.2597581262389925,"spread":0.2229923461624472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001533256,0.001333888,0.001241816,0.001126413,0.000786581,0.001777935,0.002379835,0.001177331,0.004750445],"category_scores_gemma":[0.004358509,0.0006938739,0.001322725,0.002454772,0.001245987,0.001716718,0.001139317,0.002773009,0.0006742927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001307136,"about_ca_system_score_gemma":0.00355016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006840567,"about_ca_topic_score_gemma":0.007280212,"domain_scores_codex":[0.9979544,0.0007155312,0.00008847136,0.0003301549,0.0007422969,0.0001690474],"domain_scores_gemma":[0.9984976,0.001019064,0.00009547458,0.0001018894,0.000213863,0.00007208978],"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.00003580402,0.00007831175,0.0001105443,0.0002446354,0.0000469821,0.0001280245,0.00004817585,0.751153,0.001051649,0.1745181,0.003556878,0.06902795],"study_design_scores_gemma":[0.00002892454,0.00004217987,0.00006345053,0.00004519555,0.00002521523,0.00007112346,0.00002078126,0.8893802,0.0008126227,0.09878137,0.01070533,0.00002366275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001193368,0.0005657748,0.9920122,0.000272735,0.00008692389,0.00006606535,0.0001136432,0.00008187788,0.005607309],"genre_scores_gemma":[0.08253561,0.002488284,0.909754,0.0002859998,0.0002387613,0.0003528069,0.0003446849,0.0001382518,0.00386163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006840567,"threshold_uncertainty_score":0.01589179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116717082","doi":"10.1287/ijoc.12.4.261.11882","title":"Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":true,"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; George Mason University; National Science Foundation","keywords":"Mathematics; Queue; Exponential function; Laplace transform; Applied mathematics; Steady state (chemistry); Exponential distribution; Heavy-tailed distribution; Mathematical optimization; Probability distribution; Computer science; Statistics; Mathematical analysis","authors":[{"name":"Carl M. Harris","is_ca":false},{"name":"Percy H. Brill","is_ca":true},{"name":"Martin J. Fischer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01528921517501288,"gpt":0.2948225607351147,"spread":0.2795333455601018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055626,0.0006566134,0.0005036185,0.0008336263,0.0004356999,0.0008732366,0.001148149,0.001045097,0.004490469],"category_scores_gemma":[0.003132363,0.0003147697,0.0006425976,0.001093606,0.00060367,0.001290091,0.0008285732,0.001539654,0.001270411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007667175,"about_ca_system_score_gemma":0.001137158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003029115,"about_ca_topic_score_gemma":0.003497615,"domain_scores_codex":[0.9996396,0.0001549471,0.000017014,0.00003077273,0.0001295396,0.00002811978],"domain_scores_gemma":[0.9989292,0.0007430532,0.00007793881,0.00009873043,0.0001261771,0.00002493907],"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.00003370687,0.0001245955,0.0009760999,0.0002015609,0.00005350871,0.0001276369,0.00007851714,0.5829027,0.002106786,0.3242568,0.004596498,0.08454158],"study_design_scores_gemma":[0.000005465513,0.000003349637,0.00006775252,0.000009744112,0.000002332017,0.00001198671,0.000005319156,0.9635465,0.0002546863,0.03458052,0.001507703,0.000004609654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006811475,0.0008955317,0.9853909,0.0004193331,0.00008163926,0.0000440873,0.0001051503,0.0002963332,0.005955608],"genre_scores_gemma":[0.197127,0.003042131,0.7874982,0.0002753287,0.0002115121,0.0005299477,0.0005145279,0.0002550737,0.01054624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004490469,"threshold_uncertainty_score":0.0150221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}