{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008480389,0.0001478671,0.0001648379,0.000146012,0.0004954819,0.000253033,0.00005001009,0.00006844722,0.000002869488],"category_scores_gemma":[0.0003417741,0.0001308027,0.00002981127,0.0001141523,0.00003625707,0.0006793909,0.00004112873,0.0003276082,0.000001738606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005595202,"about_ca_system_score_gemma":0.00001172839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006508903,"about_ca_topic_score_gemma":0.000001496994,"domain_scores_codex":[0.9990503,0.00002593935,0.0004057011,0.0001356933,0.0001209321,0.0002614694],"domain_scores_gemma":[0.9993364,0.0001822939,0.0001411519,0.00007133682,0.0001436081,0.0001252692],"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.000005174528,0.00001148519,0.01232471,0.000134447,0.00005097962,3.366834e-7,0.003354513,0.4913399,0.001091643,0.000268518,0.00007746506,0.4913409],"study_design_scores_gemma":[0.000499277,0.00006207439,0.01357075,0.000197481,0.00001011877,0.0001166867,0.0001603873,0.9839265,0.0004406099,0.0006668238,0.0001804233,0.0001689157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.678395,0.0001155465,0.3204764,0.0001484444,0.0002494594,0.0003677779,8.100854e-7,0.0001201891,0.0001264163],"genre_scores_gemma":[0.8961689,0.0000438473,0.1033954,0.00005942924,0.0002623188,0.000008232647,0.000001581413,0.00002770816,0.00003254446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4925866,"threshold_uncertainty_score":0.533398,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110573,0.0001503237,0.000139537,0.00007030197,0.0005817477,0.000332141,0.0001255056,0.00005354085,0.000001318748],"category_scores_gemma":[0.00006630085,0.00009794606,0.00003750544,0.0001471697,0.00008044481,0.0001698499,0.00001977141,0.0002926895,0.000001153143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006365768,"about_ca_system_score_gemma":0.00002684414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001061134,"about_ca_topic_score_gemma":0.000001688568,"domain_scores_codex":[0.9989424,0.00002464971,0.0004073178,0.000097223,0.0002152846,0.0003130837],"domain_scores_gemma":[0.9990131,0.0005309946,0.0001595597,0.0001003697,0.0001280634,0.00006796198],"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.00002062001,0.000006881754,0.00049216,0.00001523368,0.00001792414,0.000002696107,0.000131903,0.838854,0.00008419505,0.001785261,0.0005355927,0.1580535],"study_design_scores_gemma":[0.0009254325,0.0001746129,0.001652938,0.0001832367,0.00001710736,0.0003860919,0.0001902316,0.9824523,0.0004124487,0.0007665737,0.01261756,0.0002214592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1120515,0.0001137994,0.874694,0.0003269811,0.0001587408,0.0003665902,0.00000360715,0.0002267537,0.01205796],"genre_scores_gemma":[0.8709671,0.0000132689,0.1285599,0.0001247247,0.0002504041,0.000004244282,0.000004096568,0.00003510058,0.00004121979],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7589155,"threshold_uncertainty_score":0.4474392,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001493052,0.0002036635,0.0002273109,0.0002027205,0.0003066694,0.0001441558,0.0002840649,0.00006063841,0.00001968907],"category_scores_gemma":[0.0001966319,0.0001869152,0.000107243,0.0001274228,0.00002127371,0.0004166116,0.00003722608,0.0004628143,0.00001537186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001360012,"about_ca_system_score_gemma":0.00004382889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002980488,"about_ca_topic_score_gemma":4.585865e-7,"domain_scores_codex":[0.99849,0.0000416643,0.0006647791,0.0001338143,0.0002041943,0.0004655386],"domain_scores_gemma":[0.9991186,0.0001212255,0.0002245624,0.0001731735,0.0001486552,0.0002137465],"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.00004191645,0.00005191954,0.001748789,0.0001090574,0.00008120827,0.00001925111,0.004257629,0.8336111,0.0001218593,0.002117991,0.0005009239,0.1573384],"study_design_scores_gemma":[0.000599815,0.0002644311,0.0004404925,0.0001797052,0.00001536424,0.0002523186,0.0001419109,0.9945787,0.0009561811,0.001556028,0.0007334498,0.0002815586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.243687,0.0000252668,0.7464117,0.000006841169,0.0007053306,0.0002043111,0.00000191928,0.0003980733,0.00855958],"genre_scores_gemma":[0.7322289,0.000003936932,0.2672054,0.0001214616,0.0003611852,0.00000293692,0.000003140053,0.00005259092,0.00002050402],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4885419,"threshold_uncertainty_score":0.7622182,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002487872,0.0001423739,0.000126978,0.0001201895,0.0004789466,0.0001793918,0.00008366149,0.00004039211,4.079241e-7],"category_scores_gemma":[0.0002065598,0.00008769022,0.00003131849,0.0002963083,0.00003192438,0.0002505459,0.000003482715,0.0003965149,3.669732e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007646821,"about_ca_system_score_gemma":0.00003875895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001119273,"about_ca_topic_score_gemma":0.00001727714,"domain_scores_codex":[0.9989302,0.00001421735,0.0004564137,0.0001195582,0.000187368,0.000292256],"domain_scores_gemma":[0.9993022,0.000163967,0.0001129602,0.00009093476,0.0002523724,0.00007753201],"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.00009556921,0.000006537445,0.002420716,0.00004310242,0.00004321878,0.000001778035,0.0009219963,0.7891772,0.0006939444,0.0001217936,0.00002022241,0.2064539],"study_design_scores_gemma":[0.0008258437,0.0004575864,0.01388832,0.0009203759,0.00005849112,0.0004662256,0.001474127,0.9606144,0.01670401,0.000154238,0.003937664,0.0004986976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4595493,0.00005639907,0.539557,0.0001192046,0.0002290841,0.0002893863,4.469035e-7,0.0001203179,0.00007881664],"genre_scores_gemma":[0.7094458,0.00001796767,0.2901905,0.0000212135,0.0002796881,0.000003122408,0.000003001247,0.00002510113,0.00001366797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2498965,"threshold_uncertainty_score":0.3683719,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115237,0.0001490899,0.0002059479,0.00009013067,0.0002619022,0.0002020509,0.000141245,0.00006839224,0.0002150189],"category_scores_gemma":[0.00006963887,0.0001210461,0.0001056163,0.0002570475,0.00001484895,0.000130104,0.000006701237,0.0003402145,0.00003990631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006972288,"about_ca_system_score_gemma":0.00003356343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000112473,"about_ca_topic_score_gemma":2.639025e-7,"domain_scores_codex":[0.9987755,0.00003495737,0.000443776,0.00008000048,0.0001936996,0.0004720519],"domain_scores_gemma":[0.998961,0.0006399751,0.00005070887,0.00009387924,0.00008952881,0.0001648813],"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.0000205773,0.000008673918,0.000002256543,0.00002833173,0.00002105627,0.000002577229,0.0001308732,0.7085003,0.000007874386,0.0002963334,0.000754249,0.2902269],"study_design_scores_gemma":[0.0006382341,0.0001205338,0.000004724255,0.0001112043,0.000009078032,0.00002819057,0.00003037712,0.9839568,0.0002513707,0.0009621308,0.01373078,0.0001565331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00314387,0.00002101739,0.994144,0.00006979647,0.0001586152,0.0002714217,9.416795e-7,0.000243156,0.001947158],"genre_scores_gemma":[0.08858147,0.00000550976,0.9105452,0.0004878836,0.0002738727,0.000004323125,0.000003554187,0.0000385947,0.00005959752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2900704,"threshold_uncertainty_score":0.4936115,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002433162,0.0001717765,0.0001740428,0.0001426107,0.0004882486,0.0001240036,0.0001659552,0.0000853161,0.00001854837],"category_scores_gemma":[0.00001247878,0.0001532319,0.00008698393,0.000127473,0.00002708771,0.0004683333,0.00002208854,0.0006620475,0.00002151511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001513339,"about_ca_system_score_gemma":0.0000172539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003205534,"about_ca_topic_score_gemma":3.114904e-7,"domain_scores_codex":[0.9989081,0.00001329906,0.0004287314,0.00008504619,0.000239166,0.0003256373],"domain_scores_gemma":[0.9995917,0.00006920268,0.00009347664,0.00008618681,0.00004049051,0.0001189094],"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.00001757093,0.00003730164,0.001027683,0.00004412722,0.0000866449,0.0001378351,0.001893515,0.3203484,0.01210221,0.0002724077,0.01963478,0.6443975],"study_design_scores_gemma":[0.0009531308,0.0003167785,0.001052844,0.0004296831,0.00001105728,0.003466548,0.0002707487,0.9306058,0.05684577,0.0005042321,0.004814328,0.0007291266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3886323,0.0001035518,0.6046931,0.00001974062,0.0002489967,0.00005052701,7.965825e-7,0.0003863407,0.005864686],"genre_scores_gemma":[0.9913801,0.00006204363,0.007946875,0.0002997747,0.0002674339,7.588507e-7,0.000004781108,0.00002909132,0.000009150888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6436684,"threshold_uncertainty_score":0.6248617,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003145489,0.000180289,0.0001859918,0.0001387273,0.0006159695,0.0003053269,0.0001916071,0.00007731019,0.0000054603],"category_scores_gemma":[0.00005898685,0.0001191314,0.00004435887,0.0003015609,0.00003170311,0.0002531056,0.00003941976,0.0006296749,0.000002148698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001104068,"about_ca_system_score_gemma":0.00005689162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003777122,"about_ca_topic_score_gemma":0.000001426306,"domain_scores_codex":[0.9986171,0.00001963669,0.0004697736,0.0001198765,0.000261228,0.0005124528],"domain_scores_gemma":[0.9983653,0.001084668,0.0001148737,0.0001213655,0.0001730581,0.0001407122],"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.00004082872,0.000006168942,0.002158817,0.0000552814,0.0000740258,0.000005285873,0.0009151085,0.8868762,0.000240013,0.0015756,0.00002074709,0.1080319],"study_design_scores_gemma":[0.0009107132,0.0001595014,0.001463305,0.000318881,0.00002675556,0.0003587965,0.0005191457,0.9940493,0.001179408,0.000164543,0.0006352821,0.0002143443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1178458,0.0001359413,0.8790553,0.00004899726,0.0001944385,0.0002257935,9.444656e-7,0.0001192041,0.002373588],"genre_scores_gemma":[0.6617444,0.00002390639,0.3377279,0.000120733,0.0003277687,0.000001049286,9.52772e-7,0.00003735954,0.00001594525],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5438986,"threshold_uncertainty_score":0.4858038,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004660788,0.000278667,0.0002879809,0.0001849882,0.001366114,0.0002648105,0.000151866,0.0001086478,0.000001003299],"category_scores_gemma":[0.0001481193,0.0002636688,0.00008461056,0.0001549729,0.00007127782,0.0003516122,0.00008961726,0.0004449047,0.000001560792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001806416,"about_ca_system_score_gemma":0.00003795902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005012088,"about_ca_topic_score_gemma":8.687358e-7,"domain_scores_codex":[0.998198,0.0000133654,0.0006382153,0.0001834127,0.0002363457,0.0007306832],"domain_scores_gemma":[0.9990553,0.0002584889,0.0002831579,0.0001053261,0.0001436068,0.0001541738],"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.00001116471,0.00001774578,0.0003285571,0.00009324781,0.00004022312,0.00001707091,0.000857104,0.9744692,0.0001375662,0.0002052788,0.00002189394,0.02380095],"study_design_scores_gemma":[0.0006295797,0.0001528011,0.0001185858,0.0004298039,0.00002295134,0.001981901,0.0002275663,0.9946323,0.0002165231,0.0001339594,0.001109622,0.0003443857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2332214,0.0002175044,0.7651798,0.00001607116,0.0004060872,0.0002158131,0.000005273593,0.0003112443,0.0004268072],"genre_scores_gemma":[0.7333082,0.00002664823,0.2662172,0.00004478372,0.0003466041,0.000001147273,0.00001236011,0.00003786726,0.000005191365],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5000868,"threshold_uncertainty_score":0.9999815,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833341,0.0001857204,0.0001985882,0.0001644134,0.0007009645,0.0002286988,0.0002531888,0.00009031891,0.00003929716],"category_scores_gemma":[0.00004899492,0.0001163534,0.0001869508,0.0004657036,0.000046224,0.0003402082,0.00004558031,0.001032601,0.00002681805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000256515,"about_ca_system_score_gemma":0.00002505262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006561894,"about_ca_topic_score_gemma":0.00002132794,"domain_scores_codex":[0.9984206,0.00002414435,0.0005663949,0.0001095147,0.000328701,0.0005506607],"domain_scores_gemma":[0.9992388,0.0002302441,0.0001525033,0.0001642573,0.0001139681,0.000100151],"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.00001329313,0.000003626977,0.000964475,0.000008511368,0.00006963105,0.000008387148,0.0006648437,0.7534615,0.00004085569,0.0001057932,0.0003777658,0.2442814],"study_design_scores_gemma":[0.0003228339,0.0001347807,0.01103537,0.000228092,0.00003903079,0.0004372338,0.0008514245,0.9770041,0.0008278425,0.004037084,0.004787827,0.0002943953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2061107,0.00009919414,0.7763115,0.00007603561,0.001090121,0.0001219365,5.159506e-7,0.000159665,0.0160304],"genre_scores_gemma":[0.9927152,0.00002055142,0.005553356,0.0002302784,0.001446794,6.064038e-7,0.000001248203,0.00001792582,0.00001403569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7866045,"threshold_uncertainty_score":0.5391323,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001456918,0.000196311,0.0001673776,0.0001556095,0.0006899839,0.0006165563,0.0001894196,0.00008825001,0.00001795598],"category_scores_gemma":[0.0002003715,0.0001431974,0.00005459118,0.0002726354,0.00002575623,0.0004570311,0.00001194475,0.0004268227,0.00001200866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001412582,"about_ca_system_score_gemma":0.00004885466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001489284,"about_ca_topic_score_gemma":0.000001510517,"domain_scores_codex":[0.9986491,0.00006396265,0.0005492037,0.0001438364,0.0002577887,0.0003360717],"domain_scores_gemma":[0.9985566,0.0005554102,0.0002101955,0.0001952953,0.0003563578,0.0001261924],"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.000002455114,0.000009389262,0.00009708145,0.00001171973,0.00001726221,3.343767e-7,0.0003654738,0.7539937,0.0002999023,0.00007131263,0.000173934,0.2449574],"study_design_scores_gemma":[0.000544504,0.0001689665,0.00078549,0.0001013458,0.00001242455,0.00002550437,0.0001614592,0.9968854,0.000858458,0.0000681519,0.0001964243,0.0001918436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06397974,0.00001952069,0.9343284,0.0002189495,0.0004389084,0.0005103789,0.000001966908,0.0001978492,0.0003042297],"genre_scores_gemma":[0.7023861,0.00000478737,0.2966083,0.0004273254,0.0004972949,0.00001619218,0.00001052477,0.00003838731,0.00001109165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6384063,"threshold_uncertainty_score":0.5945467,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004014133,0.0001999309,0.0004118198,0.0004062087,0.0004469664,0.0002266433,0.0001615867,0.00005036488,0.000003850105],"category_scores_gemma":[0.0001982265,0.0001498353,0.00005788638,0.0005700402,0.0000510904,0.001128446,0.00010178,0.0002076458,0.000001719686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007482003,"about_ca_system_score_gemma":0.00001822284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007174438,"about_ca_topic_score_gemma":0.00004779696,"domain_scores_codex":[0.9984639,0.00002800283,0.0008040277,0.0001726084,0.0002612513,0.0002702682],"domain_scores_gemma":[0.9971085,0.0007633237,0.001346294,0.0001127168,0.0006398239,0.00002932509],"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.003203476,0.000395712,0.0754667,0.0008946997,0.0005091723,0.000009743857,0.004011576,0.7835652,0.002381523,0.02075147,0.00008754689,0.1087232],"study_design_scores_gemma":[0.001565189,0.0001385769,0.01284132,0.0005234529,0.00007173205,0.00002691297,0.007163289,0.9747036,0.001529061,0.0008297129,0.0002803093,0.0003268858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4147168,0.00008612512,0.5845451,0.00004782023,0.0001327946,0.0002116587,0.00000211721,0.0000243317,0.0002332992],"genre_scores_gemma":[0.9357587,5.528081e-7,0.06357275,0.0002718768,0.0003268674,0.000003127784,0.00003558267,0.00002269079,0.00000787016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5210419,"threshold_uncertainty_score":0.6110108,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008726877,0.0001570182,0.0001493379,0.0000960383,0.0003813052,0.0001532692,0.0001860645,0.00005247885,0.00001407903],"category_scores_gemma":[0.00005482305,0.00007153482,0.00007878902,0.0001361903,0.00002285977,0.0002207655,0.00001822361,0.0002592879,0.000009819558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007730929,"about_ca_system_score_gemma":0.0000252601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.729581e-7,"about_ca_topic_score_gemma":5.135101e-7,"domain_scores_codex":[0.9991189,0.00002174331,0.0003487597,0.00008930316,0.000145055,0.0002762328],"domain_scores_gemma":[0.9989094,0.0006297139,0.0001301627,0.0001198949,0.0001207098,0.00009010296],"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.00003097714,0.000005128304,0.00006311683,0.00001010644,0.00006097266,9.697924e-7,0.0001139009,0.7552961,0.00008721799,0.0003039336,0.00002538555,0.2440023],"study_design_scores_gemma":[0.001100212,0.0001262181,0.00009613531,0.0002448953,0.00002000996,0.0002006834,0.00005259316,0.9948173,0.0007621802,0.0004572935,0.001957644,0.0001648631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004815283,0.0002211396,0.9932613,0.0005682622,0.0003284661,0.0001809594,0.000001940726,0.0001767165,0.0004458844],"genre_scores_gemma":[0.1201494,0.00005520972,0.8792222,0.0001739882,0.0003181353,0.000006269019,0.000002286773,0.0000318823,0.00004056899],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2438374,"threshold_uncertainty_score":0.293273,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001827925,0.000179404,0.000190743,0.0001288871,0.000430494,0.0002433926,0.0002119163,0.00004893755,0.000009111903],"category_scores_gemma":[0.0000887221,0.0001250767,0.00008188407,0.0001286766,0.00008034277,0.0001880958,0.00006174322,0.0005602496,0.000003435536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008936616,"about_ca_system_score_gemma":0.00004760718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000636708,"about_ca_topic_score_gemma":6.612322e-7,"domain_scores_codex":[0.9987023,0.00003165912,0.0004787406,0.0001184573,0.0002109475,0.000457911],"domain_scores_gemma":[0.9991105,0.0003904828,0.000105107,0.0001265051,0.0001344765,0.0001329146],"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.00000603247,0.000008340708,0.0001097547,0.0000300461,0.00005653011,0.000009440409,0.00111436,0.1308554,0.00002113496,0.0001328344,0.00001287539,0.8676432],"study_design_scores_gemma":[0.0005311032,0.0001131703,0.0004293078,0.0001265011,0.00001717771,0.0006141662,0.0003055953,0.9964895,0.0004041837,0.0001881923,0.0006077685,0.0001733843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0588155,0.0001088221,0.9396354,0.0000456576,0.0003395802,0.0004335759,0.000003925754,0.0001748195,0.0004427303],"genre_scores_gemma":[0.3922009,0.00003663921,0.6075225,0.00005252203,0.0001336525,0.000006810636,0.000001496293,0.00003368752,0.00001172986],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8674698,"threshold_uncertainty_score":0.5100479,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008189194,0.00006824125,0.00009704735,0.00008313281,0.0008870974,0.0001814014,0.00003293942,0.00005030614,7.351959e-7],"category_scores_gemma":[0.00007188929,0.00005284489,0.00001540536,0.0001165643,0.00002967355,0.0002211507,8.414177e-7,0.0001264146,4.409144e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006061222,"about_ca_system_score_gemma":0.00005135224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003699084,"about_ca_topic_score_gemma":0.00005760751,"domain_scores_codex":[0.999393,0.00004170832,0.0001766177,0.00007694672,0.0001652798,0.0001464722],"domain_scores_gemma":[0.9994001,0.0001603824,0.0001766592,0.00001929656,0.0001556952,0.00008787946],"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.0008869478,0.00006659742,0.02279332,0.0001317995,0.0000738168,0.00001672779,0.05080334,0.697893,0.00005509582,0.06940759,0.0002248974,0.1576468],"study_design_scores_gemma":[0.006013921,0.00459236,0.319061,0.002387415,0.0002354223,0.000698236,0.014769,0.6449179,0.0001626616,0.002301563,0.003866575,0.0009938789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4439778,0.00002050253,0.5549315,0.000232434,0.00009636467,0.0001857406,0.000001049621,0.00007494193,0.0004796744],"genre_scores_gemma":[0.9852628,0.00001239409,0.0144608,0.00009334909,0.0001455236,8.16019e-7,0.00000204763,0.000003635111,0.00001865863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.541285,"threshold_uncertainty_score":0.6822926,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001345866,0.0001772009,0.0002855581,0.00009737837,0.0002998027,0.00005158112,0.0003307881,0.00005304221,0.000007374469],"category_scores_gemma":[0.0004229566,0.0001325018,0.0002204365,0.0003901091,0.00002377403,0.000217598,0.00003538229,0.0004660174,0.00001030763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001413607,"about_ca_system_score_gemma":0.00005078336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.68875e-7,"about_ca_topic_score_gemma":6.798577e-8,"domain_scores_codex":[0.9983217,0.00004471931,0.0008396005,0.0001047112,0.0003258947,0.0003634272],"domain_scores_gemma":[0.9989054,0.0002399003,0.0003374961,0.0002104433,0.0002158428,0.00009088562],"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.000006374539,0.00001340777,0.0002365581,0.0000947403,0.00002099045,0.000001352586,0.0001100274,0.683602,0.0001896866,0.0001476405,0.003336271,0.312241],"study_design_scores_gemma":[0.0004834203,0.0001123911,0.003781611,0.001789759,0.00001899923,0.0001265893,0.00001394167,0.9844605,0.001265919,0.0006223109,0.007117682,0.000206866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03336447,0.001674994,0.9579205,0.001008271,0.001533618,0.000569491,0.000006711206,0.0002881844,0.003633761],"genre_scores_gemma":[0.6602071,0.0005208048,0.335526,0.002735404,0.0007043511,0.000003653499,0.000006428068,0.00006873783,0.0002274764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6268426,"threshold_uncertainty_score":0.5403267,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002346575,0.0001975434,0.0003097115,0.0001827012,0.002832652,0.0002012078,0.00008289104,0.0001901607,0.000008659724],"category_scores_gemma":[0.0009723409,0.000126819,0.00004417843,0.0001168331,0.00006870684,0.0003193677,0.00006247429,0.0006502245,0.000001920541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009436008,"about_ca_system_score_gemma":0.0003642316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001046454,"about_ca_topic_score_gemma":0.000002035011,"domain_scores_codex":[0.9980462,0.0001291659,0.0008430168,0.0002479661,0.0001832262,0.0005503769],"domain_scores_gemma":[0.997712,0.001163235,0.0003922703,0.0001055093,0.0003246694,0.0003023153],"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.0002073622,0.00007009386,0.1308811,0.0008906828,0.000103917,0.000009279217,0.01026203,0.1105731,0.000540374,0.008660434,0.00007257799,0.7377291],"study_design_scores_gemma":[0.004106257,0.0004257847,0.003202348,0.002717262,0.00002170959,0.0001139406,0.003371867,0.9840682,0.0000469795,0.0001433336,0.001411316,0.0003710357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3821188,0.0001537494,0.6154543,0.001279683,0.0001719825,0.0004784601,0.000003855418,0.00005008614,0.0002890626],"genre_scores_gemma":[0.7572356,0.00002085004,0.2410256,0.001272636,0.00036767,0.00001885564,0.000006326157,0.00002175917,0.00003063694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.873495,"threshold_uncertainty_score":0.9984655,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001128457,0.0002068152,0.0001781619,0.000226151,0.00056644,0.0004226485,0.0003043662,0.00006417352,0.001663717],"category_scores_gemma":[0.00009825695,0.000164988,0.00009912578,0.0006441484,0.00003249469,0.0006868296,0.00005007377,0.0003631465,0.002375054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001618865,"about_ca_system_score_gemma":0.00004731744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001937305,"about_ca_topic_score_gemma":0.0001242483,"domain_scores_codex":[0.9981649,0.00001230565,0.0005767777,0.0001901632,0.0006337531,0.0004220897],"domain_scores_gemma":[0.9992565,0.00003686228,0.0001709709,0.0002319961,0.0002640386,0.0000396658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006362723,0.00003972094,0.0003266604,0.00002794424,0.00002503231,0.000004577557,0.00006370984,0.7778185,3.445955e-7,0.009840634,0.02267877,0.1891105],"study_design_scores_gemma":[0.0008579383,0.00006844393,0.00898831,0.0003510858,0.00002534817,0.000009516189,0.0003512241,0.4482532,0.00000156461,0.004278095,0.5364279,0.000387291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7375765,0.00007143123,0.007860523,0.01237035,0.003767,0.0005057274,9.297731e-7,0.0003242249,0.2375233],"genre_scores_gemma":[0.9785656,0.00002459477,0.0001777509,0.01728558,0.002912014,0.00000222032,0.00001752038,0.00001661305,0.0009981068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5137492,"threshold_uncertainty_score":0.9992489,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047604,0.0001443082,0.0001386345,0.000182394,0.0003108767,0.0003893247,0.0007563296,0.00005320992,0.00001040633],"category_scores_gemma":[0.0002947444,0.00007042092,0.00005527244,0.0003634028,0.00004027079,0.001774279,0.0001398969,0.0002046381,0.00004913476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001266104,"about_ca_system_score_gemma":0.00007632594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.757679e-7,"about_ca_topic_score_gemma":3.225663e-7,"domain_scores_codex":[0.9985235,0.00004700842,0.0004241712,0.0001859207,0.0005206966,0.000298719],"domain_scores_gemma":[0.9986022,0.0002817318,0.0004047001,0.0003755321,0.0001917976,0.0001440687],"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.00003911238,0.00001315505,0.0005634181,0.000002158552,0.000009497769,0.00001044432,0.0001787326,0.09941865,0.00003825373,0.02848158,0.00005604188,0.8711889],"study_design_scores_gemma":[0.001372307,0.0008635569,0.005277615,0.0007296317,0.000005459642,0.0007355773,0.00002597849,0.9810538,0.0021084,0.004781275,0.002657929,0.000388458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02179819,0.000009572546,0.9755394,0.0003783483,0.0006338308,0.00008595092,2.849352e-7,0.0001099373,0.00144443],"genre_scores_gemma":[0.2964525,0.00001636076,0.7031692,0.0001952729,0.0001326934,8.072603e-7,2.456441e-7,0.000008005213,0.00002488132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8816352,"threshold_uncertainty_score":0.3754267,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001970645,0.0001530413,0.0002489499,0.0001268244,0.01376395,0.0006133218,0.0002087061,0.0001535184,0.00003305712],"category_scores_gemma":[0.001723596,0.0001180443,0.0000299478,0.00008424162,0.00003747923,0.000751478,0.000144151,0.001332759,0.00003284389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001236386,"about_ca_system_score_gemma":0.0005154825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002929703,"about_ca_topic_score_gemma":0.000008451023,"domain_scores_codex":[0.9982935,0.0001478486,0.0007379694,0.0001617098,0.0002308646,0.0004280614],"domain_scores_gemma":[0.9978316,0.0003523885,0.0007751689,0.0002306967,0.0005850002,0.0002251722],"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.00009848942,0.00004337039,0.3973991,0.0001724552,0.00009480867,0.00009073256,0.04273795,0.442216,0.0002242192,0.01226169,0.0005928484,0.1040684],"study_design_scores_gemma":[0.00255358,0.0003725893,0.08773626,0.003980499,0.00001664099,0.00008982987,0.018774,0.8799819,0.00006463368,0.0003283726,0.005600582,0.000501063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9423859,0.0001451346,0.04088711,0.002442325,0.00123171,0.0003222489,0.000002886644,0.00005199982,0.01253067],"genre_scores_gemma":[0.9440832,0.00003844062,0.05337953,0.00133542,0.0009708025,0.000003816649,0.000003846086,0.00001891069,0.0001660637],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4377659,"threshold_uncertainty_score":0.98752,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001276326,0.0002034212,0.0002200436,0.0001692086,0.00134324,0.001039935,0.001592379,0.00005815029,0.000005837921],"category_scores_gemma":[0.00008317745,0.000127091,0.0002162887,0.0005340611,0.00005406937,0.000453427,0.0002699071,0.0005200314,0.00003258222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007282432,"about_ca_system_score_gemma":0.00009814614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000664011,"about_ca_topic_score_gemma":0.000004280385,"domain_scores_codex":[0.9981299,0.00003195104,0.000590672,0.0002111869,0.000482143,0.0005541563],"domain_scores_gemma":[0.9982029,0.0005657402,0.0003890624,0.0004264934,0.0002646321,0.0001512191],"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.00002944668,0.00008942838,0.0007334592,0.00003287898,0.00009850973,0.0000749122,0.00116527,0.02364417,0.00001423136,0.1136307,0.005762297,0.8547246],"study_design_scores_gemma":[0.0008650203,0.0003648088,0.0006813024,0.0001513511,0.0000134356,0.002140356,0.0001872752,0.8733663,0.0000590584,0.02315369,0.09872011,0.0002972807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005328475,0.0002005245,0.9869441,0.001545119,0.001953136,0.0003228505,0.000002121888,0.0001266739,0.00357703],"genre_scores_gemma":[0.8245104,0.00009156752,0.1709392,0.001779814,0.002268012,0.000009815321,0.000002108697,0.00002786841,0.0003712128],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8544273,"threshold_uncertainty_score":0.9999971,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001299841,0.0002941797,0.0003225227,0.0003889075,0.0004150021,0.0007024606,0.0001947282,0.0001440863,0.000002954115],"category_scores_gemma":[0.0005015377,0.0002548849,0.0001349833,0.0004893953,0.00005030842,0.0003023512,0.00006022093,0.0006408284,0.00002342472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009601251,"about_ca_system_score_gemma":0.00009954073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002978381,"about_ca_topic_score_gemma":0.00000226193,"domain_scores_codex":[0.9978524,0.00001385554,0.0008818372,0.0002344137,0.000310343,0.0007070861],"domain_scores_gemma":[0.9988043,0.0003089007,0.0002224513,0.0001449545,0.0001802349,0.0003392053],"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.00002566787,0.000007802195,0.00009970344,0.000077089,0.00005489471,0.000009905413,0.001034808,0.5877948,0.00000820575,0.0001925575,0.000218824,0.4104757],"study_design_scores_gemma":[0.001809771,0.0002073102,0.0000551572,0.0007698959,0.00002045285,0.0001957862,0.00135495,0.9810142,0.0001533151,0.0001357468,0.01392612,0.0003572752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06957255,0.0002289644,0.9245561,0.0006496756,0.001940265,0.0008013586,0.000007382459,0.001695614,0.0005480249],"genre_scores_gemma":[0.3674698,0.00007587422,0.6308202,0.000141282,0.001164918,0.00001624491,0.00003889008,0.00009900545,0.0001737674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4101184,"threshold_uncertainty_score":0.9999903,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008870304,0.0001683207,0.0001927549,0.0001807202,0.0003992002,0.0004015408,0.0001396465,0.0001156562,0.000009469171],"category_scores_gemma":[0.00008665665,0.0001487272,0.00006961469,0.0001416474,0.00008788185,0.0001894598,0.00003626307,0.001049836,0.000006007461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000372687,"about_ca_system_score_gemma":0.00005067622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001142703,"about_ca_topic_score_gemma":9.090926e-7,"domain_scores_codex":[0.9988297,0.000007858608,0.0004181201,0.0001169698,0.0002107821,0.000416535],"domain_scores_gemma":[0.9992033,0.0002413693,0.00007246103,0.00009316115,0.0001660161,0.0002236934],"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.000008709229,0.000007707475,0.0006645634,0.000035244,0.0000312057,0.000006169998,0.0005963654,0.5889105,0.0001745848,0.001442744,0.000005339371,0.4081169],"study_design_scores_gemma":[0.000874997,0.00009316657,0.0001526726,0.0001380126,0.000007708453,0.0003942858,0.00111281,0.99568,0.0008120388,0.00006469776,0.000467637,0.0002020086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4327304,0.00003412174,0.5656422,0.00005800257,0.0007861825,0.0001047399,8.217596e-7,0.0001525685,0.0004909699],"genre_scores_gemma":[0.6997358,0.000006364918,0.2998414,0.00006763838,0.0003154722,0.000001645599,0.000001860988,0.00002455038,0.000005272317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4079149,"threshold_uncertainty_score":0.606492,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001289077,0.0003148385,0.0003787229,0.0002792265,0.001011209,0.0002765378,0.0007511676,0.000105389,0.000008132575],"category_scores_gemma":[0.0002329888,0.0002547129,0.0003537927,0.0005350081,0.00007101615,0.000448106,0.0001719786,0.000594821,0.0002659673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002717739,"about_ca_system_score_gemma":0.0002939767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000330787,"about_ca_topic_score_gemma":5.592491e-7,"domain_scores_codex":[0.9972582,0.00006330534,0.0008799199,0.0003463547,0.0007726472,0.0006795499],"domain_scores_gemma":[0.99789,0.0004465309,0.0005337084,0.0003660816,0.0004454287,0.000318233],"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.0003515084,0.0002722425,0.0007282181,0.00004776455,0.0001015864,0.000256603,0.001968839,0.8186201,0.0170944,0.002766673,0.005354182,0.1524379],"study_design_scores_gemma":[0.004079293,0.0002518306,0.0005558301,0.0001245149,0.000009593992,0.001642296,0.00001778394,0.93964,0.05105718,0.0003052868,0.001920705,0.0003956885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4921514,0.00002380571,0.5061101,0.0001506429,0.001066342,0.0001768672,0.000001383888,0.0001092951,0.0002100937],"genre_scores_gemma":[0.9377359,0.00001561678,0.05976573,0.001277881,0.001150292,0.000005222747,0.000003338376,0.00002879685,0.00001722374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4463444,"threshold_uncertainty_score":0.9999905,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460828,0.0001191405,0.0001062786,0.00007532809,0.0007575316,0.0004768411,0.0002070303,0.00004412306,0.00000253737],"category_scores_gemma":[0.0001151535,0.00006846209,0.00004210075,0.000165075,0.00004314732,0.0001470856,0.00003064392,0.0002699123,0.000004896804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004008489,"about_ca_system_score_gemma":0.00001605499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001076442,"about_ca_topic_score_gemma":0.000009700359,"domain_scores_codex":[0.999013,0.00001748725,0.0003925888,0.00007434163,0.0001654008,0.0003372002],"domain_scores_gemma":[0.9992937,0.0003490372,0.0001222414,0.0001108744,0.00007560798,0.00004855326],"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.00002600803,0.00002020158,0.004529173,0.0001605311,0.00006652983,0.000004853259,0.01572986,0.7807469,0.00006241006,0.01644227,0.0009833792,0.1812279],"study_design_scores_gemma":[0.0006359853,0.0001623245,0.0005662002,0.0004015087,0.000005944833,0.0001542596,0.0005312279,0.8900248,0.0001398963,0.001375495,0.1058185,0.0001837704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7310985,0.0008578488,0.2167047,0.001371202,0.00350364,0.001393882,0.000003350443,0.000404064,0.04466285],"genre_scores_gemma":[0.9952453,0.00004849394,0.003886049,0.000268888,0.0004909181,0.000003798722,7.9694e-7,0.00002108858,0.00003469146],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2641468,"threshold_uncertainty_score":0.5826398,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002219285,0.0001931736,0.0003119103,0.0003426977,0.0003557631,0.0005565677,0.0004693636,0.00007626394,0.00004483954],"category_scores_gemma":[0.001167632,0.00008524155,0.0001449623,0.0003570323,0.00008133838,0.0006293288,0.00004108002,0.0001998181,0.00005800392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006894516,"about_ca_system_score_gemma":0.0001571095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002466953,"about_ca_topic_score_gemma":0.000008106676,"domain_scores_codex":[0.9974859,0.00004104032,0.0008658684,0.0002444835,0.0009320393,0.0004306113],"domain_scores_gemma":[0.9966232,0.001166412,0.000931439,0.0002575463,0.0008028992,0.0002184595],"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.000262711,0.00003917342,0.002701692,8.534573e-7,0.00003289424,0.000007350828,0.000505271,0.02999073,0.000005492057,0.0004920739,0.001307016,0.9646547],"study_design_scores_gemma":[0.02882436,0.0182271,0.009023529,0.004089216,0.0002573404,0.003443774,0.01558317,0.6706538,0.0007470935,0.07322449,0.1723783,0.003547909],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2079021,0.00001537918,0.7891076,0.0006904445,0.0006853873,0.0002961631,0.000003515936,0.00004669116,0.001252663],"genre_scores_gemma":[0.9864484,0.00001378614,0.01199784,0.0002178629,0.0003639435,0.000004339383,0.000002379754,0.00002023705,0.0009311784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9611068,"threshold_uncertainty_score":0.5366995,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001068763,0.0002737097,0.0003228979,0.0002838458,0.0006409473,0.0001379386,0.0002732316,0.0001202534,0.00000924192],"category_scores_gemma":[0.0006286688,0.0002538903,0.0001683645,0.0003019862,0.00004842547,0.0001842967,0.0000316634,0.0006531325,0.00001621329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000283238,"about_ca_system_score_gemma":0.0001327964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001634463,"about_ca_topic_score_gemma":8.818535e-7,"domain_scores_codex":[0.9980346,0.00003682927,0.0008314059,0.0001539062,0.0003659464,0.0005773248],"domain_scores_gemma":[0.9986108,0.0004563672,0.0002963972,0.0001843245,0.0002334311,0.0002186621],"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.00001563073,0.00002060573,0.001133056,0.00005710228,0.00003208635,0.00001022173,0.0005490261,0.9801502,0.00004849655,0.0001166744,0.0002878813,0.01757897],"study_design_scores_gemma":[0.001297448,0.0001544403,0.0004326377,0.0003207565,0.00001555694,0.0001722524,0.00003490807,0.996205,0.0001781812,0.00009483297,0.0007861877,0.000307778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1040466,0.00004836214,0.8935875,0.00004531513,0.0009234214,0.0002609363,0.00000269846,0.0003661853,0.000718989],"genre_scores_gemma":[0.8540584,0.000004849853,0.1450419,0.0002119899,0.0005557106,0.000004163875,0.000006823624,0.00007461778,0.00004152913],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7500118,"threshold_uncertainty_score":0.9999914,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001943083,0.0002049708,0.0002745479,0.0002921065,0.0002660065,0.0002490307,0.0001483421,0.0001005627,0.000001533809],"category_scores_gemma":[0.0007896409,0.0001987964,0.00006543333,0.0002841066,0.00001285977,0.0003490355,0.00002777526,0.0006141603,0.000001591942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002292637,"about_ca_system_score_gemma":0.00002896919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001116999,"about_ca_topic_score_gemma":3.801942e-7,"domain_scores_codex":[0.9984056,0.00003558228,0.0007290384,0.0001442311,0.0001968311,0.0004887187],"domain_scores_gemma":[0.9990184,0.0004540719,0.0001975865,0.00009996239,0.0001010632,0.0001289735],"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.00001068125,0.000008307702,0.0007764203,0.00002334896,0.000007753692,0.000006574739,0.000704219,0.6208317,0.001014162,0.0004606972,0.000007513808,0.3761486],"study_design_scores_gemma":[0.0009452751,0.0001195464,0.004827637,0.0006767433,0.000005764798,0.0001289478,0.0003549078,0.9910816,0.001311371,0.0002655882,0.00004021063,0.0002424301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6708685,0.00008266129,0.3274513,0.0001207754,0.0002809276,0.0001459759,6.324204e-7,0.0001376243,0.000911572],"genre_scores_gemma":[0.7451161,0.00001850748,0.2544123,0.0001904768,0.0002331138,9.053419e-7,0.000001422252,0.0000235082,0.000003696841],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3759062,"threshold_uncertainty_score":0.8106682,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904861,0.0001134405,0.0001043316,0.00008460788,0.0004359753,0.0002501675,0.00005154285,0.00005426881,0.000003240989],"category_scores_gemma":[0.00009660555,0.00008069417,0.00003084243,0.0002204236,0.00001845886,0.0001648048,0.00001319762,0.0002548582,6.078778e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004941808,"about_ca_system_score_gemma":0.00004927663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002846419,"about_ca_topic_score_gemma":0.000005712689,"domain_scores_codex":[0.9993665,0.000007438565,0.0002891673,0.00008453996,0.0001023865,0.000150019],"domain_scores_gemma":[0.9992486,0.0002658465,0.00008597274,0.00006340751,0.0002732177,0.00006296171],"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.00001078187,0.00001021359,0.0001191541,0.00002438162,0.00003139248,6.553248e-7,0.000234991,0.9658415,0.0001360578,0.001025166,0.000005536484,0.03256017],"study_design_scores_gemma":[0.0009390896,0.0000386922,0.0006836936,0.0001325842,0.00001921686,0.00009818377,0.0002661636,0.9970374,0.0002353283,0.0003257807,0.0001151404,0.000108783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02479131,0.0005002279,0.973671,0.000567812,0.0001728733,0.0001346546,0.000003040659,0.00007789073,0.00008122125],"genre_scores_gemma":[0.53413,0.00004193461,0.4654967,0.0002222725,0.00006147112,0.00000272942,0.00002959541,0.00001096288,0.00000431498],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5093387,"threshold_uncertainty_score":0.3353213,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001579348,0.0001618034,0.000200227,0.00006693199,0.000253446,0.0001133375,0.0001154859,0.0000768359,0.00003169473],"category_scores_gemma":[0.000238224,0.0001326769,0.00008487287,0.0002138136,0.00002238194,0.0007346514,0.00002787981,0.000422344,0.00004800025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002374884,"about_ca_system_score_gemma":0.00001705148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003114105,"about_ca_topic_score_gemma":2.395516e-7,"domain_scores_codex":[0.9985003,0.00003591034,0.0006250776,0.00008038716,0.0002303404,0.0005280175],"domain_scores_gemma":[0.9992433,0.0001594648,0.000172586,0.0001654382,0.00009629664,0.0001629181],"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.000009825701,0.00001301974,0.001425212,0.00003994396,0.00001308244,7.198598e-7,0.0003798706,0.9329191,0.00001350872,0.0004012594,0.0006191907,0.06416525],"study_design_scores_gemma":[0.0002954149,0.00003596018,0.002714473,0.0001244035,0.000009728999,0.00005762767,0.00002980308,0.992989,0.00008638971,0.001744873,0.001745756,0.0001665575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3225915,0.00005536171,0.6741148,0.00007084375,0.001311546,0.000114784,3.868892e-7,0.0001664433,0.001574399],"genre_scores_gemma":[0.8799097,0.00003131179,0.1191198,0.0002307181,0.0006658654,0.000001608471,0.000006365909,0.00002174008,0.00001291648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5573183,"threshold_uncertainty_score":0.5410407,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008031879,0.0001521928,0.0001400371,0.0001421747,0.0003639559,0.0001402603,0.0001299168,0.00005811494,0.000007567314],"category_scores_gemma":[0.00005330741,0.0001110418,0.0000375515,0.0002331795,0.0000412168,0.0001891744,0.00002048872,0.0003391715,0.000002939776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001484256,"about_ca_system_score_gemma":0.00003465278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008207579,"about_ca_topic_score_gemma":0.000003682422,"domain_scores_codex":[0.9990308,0.00003262822,0.0003998252,0.00009901601,0.0001774559,0.0002602356],"domain_scores_gemma":[0.9993982,0.0001268514,0.0001480364,0.0001060604,0.0001053614,0.0001154835],"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.00001891976,0.000008982096,0.0005076252,0.00002800906,0.0000216338,0.000003529702,0.001938967,0.983667,0.0003376247,0.001645736,0.00001549615,0.01180645],"study_design_scores_gemma":[0.0003399639,0.00007622423,0.001587646,0.0002628824,0.00001405608,0.0001714585,0.0002689071,0.9949323,0.001534845,0.0005774635,0.00005936419,0.0001749114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1813247,0.00001499767,0.8171858,0.00006834786,0.000197434,0.0001513437,0.000002332745,0.00009634475,0.0009587046],"genre_scores_gemma":[0.6329011,0.000001783251,0.3667774,0.000241835,0.00006182791,8.425804e-7,0.00000188302,0.00001289022,4.607386e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4515765,"threshold_uncertainty_score":0.4528154,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002413242,0.0001905817,0.0002244395,0.0001978414,0.001305929,0.0006910145,0.0006375012,0.00003990277,0.000001678274],"category_scores_gemma":[0.0003343005,0.0001260912,0.0000781806,0.0002340065,0.0001369454,0.0006650307,0.000296965,0.0004837651,0.000002618883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004413437,"about_ca_system_score_gemma":0.00004446911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002235309,"about_ca_topic_score_gemma":0.000001281163,"domain_scores_codex":[0.9983235,0.00009548725,0.0004643711,0.000263676,0.0003542933,0.000498646],"domain_scores_gemma":[0.9960949,0.002883906,0.0003286263,0.0002419139,0.0002677812,0.0001828974],"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.00007232458,0.00002290767,0.0003940295,0.00005455132,0.00008511452,0.000008692115,0.001983193,0.006948365,0.0003482403,0.0560242,0.0002722084,0.9337862],"study_design_scores_gemma":[0.001685574,0.000476772,0.0009454217,0.0001617984,0.000009257009,0.001111118,0.0001854061,0.9120595,0.001114505,0.08037053,0.001630824,0.0002492645],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1367178,0.00009346209,0.8609985,0.001339589,0.0002280568,0.0003144755,0.000002233797,0.00006224112,0.0002437321],"genre_scores_gemma":[0.9170832,0.00002095409,0.08188727,0.0007466581,0.0002213644,0.000006526858,0.000001794007,0.00001495441,0.00001728073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9335369,"threshold_uncertainty_score":0.9999942,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003386607,0.0001596888,0.0001363934,0.0002395504,0.0009946184,0.0005786099,0.0003221053,0.00005015588,0.0001380978],"category_scores_gemma":[0.0001348951,0.0001067648,0.00007838896,0.0005547874,0.00002557634,0.000820038,0.0001337211,0.0002998669,0.0001412753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008633536,"about_ca_system_score_gemma":0.00005449392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001714491,"about_ca_topic_score_gemma":0.0000411225,"domain_scores_codex":[0.9982783,0.000005399268,0.0006116596,0.0001560528,0.0004558658,0.0004927617],"domain_scores_gemma":[0.9989657,0.0001649574,0.0001964086,0.0001854208,0.0004601471,0.00002741072],"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.0003141554,0.0001976799,0.005824327,0.0004519841,0.0001677766,0.000005757565,0.0005474887,0.3502526,0.00005938115,0.3471369,0.01741781,0.2776241],"study_design_scores_gemma":[0.001373205,0.00008290065,0.01461159,0.0001189558,0.00005534994,0.00001977466,0.001538696,0.5925269,0.00007890492,0.003821899,0.3854121,0.0003596785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06766264,0.00006352147,0.8786501,0.003171609,0.001766901,0.001235801,0.0000041679,0.0001843865,0.04726084],"genre_scores_gemma":[0.9928337,0.000006342434,0.001446757,0.003446719,0.002003911,0.000005053464,0.00003797212,0.00001729843,0.0002022937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.925171,"threshold_uncertainty_score":0.7649901,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001331261,0.0002451277,0.0002966353,0.0002037717,0.0006130948,0.0003845265,0.000470171,0.0001532488,0.0000508902],"category_scores_gemma":[0.0005783301,0.0001896004,0.0001455925,0.0002529596,0.00006784635,0.0005708247,0.00008389934,0.001120747,0.00001229278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007947529,"about_ca_system_score_gemma":0.0002004042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001576443,"about_ca_topic_score_gemma":0.000004369429,"domain_scores_codex":[0.9978646,0.00003050018,0.0007328673,0.0002287538,0.0004614056,0.0006818913],"domain_scores_gemma":[0.9976534,0.0003246852,0.0004712474,0.000323575,0.0008471218,0.0003799967],"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.00003746594,0.0001744955,0.00002482217,0.00002189117,0.00003439861,0.000008760821,0.000242298,0.00446562,0.0008930521,0.001675323,0.00007058669,0.9923513],"study_design_scores_gemma":[0.001377279,0.0006987337,0.00001318157,0.00002946576,0.000008925023,0.0001800031,0.000100469,0.9828557,0.00356805,0.005255381,0.005649528,0.0002632459],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07247016,0.000003822595,0.9258223,0.00008789045,0.0005707641,0.0006559177,0.00000802819,0.000162488,0.0002185835],"genre_scores_gemma":[0.03008123,0.000003418473,0.9677952,0.0001796657,0.001667434,0.00001362094,0.00002465461,0.00007096705,0.0001638059],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.992088,"threshold_uncertainty_score":0.7731678,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001920305,0.0001810923,0.0002252532,0.0001599262,0.0004369616,0.0002537524,0.0002237999,0.00007668334,0.000007979014],"category_scores_gemma":[0.001025416,0.0001618859,0.0001264492,0.0002229051,0.00001311125,0.0002141352,0.00003631431,0.0004723713,0.00001451922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001276681,"about_ca_system_score_gemma":0.00001701368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.15337e-7,"about_ca_topic_score_gemma":1.480022e-7,"domain_scores_codex":[0.9985714,0.00003412751,0.0006109102,0.0001111905,0.0002182353,0.0004541121],"domain_scores_gemma":[0.9986095,0.0007804119,0.0002108338,0.0001419631,0.0001192203,0.0001380954],"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.000004545232,0.000004081634,0.0007231378,0.00002341625,0.00001844718,8.093079e-7,0.0002224312,0.7698478,0.0001234627,0.001318351,0.0001544187,0.2275592],"study_design_scores_gemma":[0.0005505147,0.00007320651,0.0005426023,0.0001385395,0.000008469851,0.00008043882,0.00007425296,0.9918287,0.0007855752,0.0003390765,0.005365251,0.0002133773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1131932,0.00001243003,0.8779364,0.00005257423,0.000980597,0.00009654349,0.000001007097,0.0003363547,0.007390883],"genre_scores_gemma":[0.8107804,0.000003190934,0.188084,0.0001667829,0.0008964121,0.000001236178,0.00000252657,0.0000426745,0.0000227789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6975872,"threshold_uncertainty_score":0.6601517,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002830732,0.0001636235,0.0001803429,0.00009318825,0.0002003347,0.0001949794,0.0001290009,0.00009406383,0.00001483579],"category_scores_gemma":[0.000200582,0.0001369056,0.00008363773,0.00008596556,0.00001231162,0.0001390505,0.0000147291,0.0003654186,0.00002455867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009133287,"about_ca_system_score_gemma":0.00002051391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001258679,"about_ca_topic_score_gemma":1.65419e-7,"domain_scores_codex":[0.9989839,0.000006323342,0.0004221639,0.00008810713,0.0001588221,0.0003407516],"domain_scores_gemma":[0.9992086,0.0004207021,0.0001065996,0.0001141532,0.00004948534,0.0001004422],"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.00001060473,0.000007423763,0.000008844971,0.00003374546,0.00001242144,0.000002714529,0.00009586509,0.8823693,0.000002987502,0.007659909,0.0003663703,0.1094298],"study_design_scores_gemma":[0.0004876747,0.0001254536,0.00005636537,0.0002200552,0.00001680215,0.00006842359,0.00005668497,0.7933587,0.0008191426,0.1977427,0.006740419,0.000307574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001105659,0.00004227262,0.9974267,0.00003038062,0.0003322179,0.0001795503,0.000001816725,0.0002833417,0.000598058],"genre_scores_gemma":[0.2514183,0.000002597324,0.7480931,0.00003755124,0.000373908,0.000001832928,0.000004269812,0.00001786204,0.00005065949],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2503126,"threshold_uncertainty_score":0.5582848,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001289154,0.0001796903,0.0002024546,0.0001071613,0.0004187343,0.0002837433,0.0002340985,0.00005381244,0.00002004898],"category_scores_gemma":[0.0001212141,0.0001173488,0.0001217709,0.0001965625,0.00002135266,0.0001078914,0.00002551712,0.000320468,0.00001209516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001650524,"about_ca_system_score_gemma":0.00003351702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004637701,"about_ca_topic_score_gemma":0.000001127156,"domain_scores_codex":[0.9985508,0.00004333265,0.0006571367,0.00009239393,0.000289727,0.0003665878],"domain_scores_gemma":[0.9988254,0.0006645376,0.0001893261,0.0001566624,0.00009872171,0.00006538806],"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.000007714146,0.00001087163,0.00008173106,0.00003272508,0.00003830988,0.000002533853,0.0001479448,0.9730141,0.0001322231,0.001478324,0.001275865,0.02377762],"study_design_scores_gemma":[0.0007571052,0.00006915939,0.0003464642,0.00008653425,0.00003033792,0.00008455529,0.00004433519,0.9919852,0.0004268929,0.001424941,0.004572825,0.0001716544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02472335,0.0001774418,0.9720003,0.0002271408,0.0006333775,0.0003461744,0.000001468338,0.0001784456,0.001712284],"genre_scores_gemma":[0.7295361,0.0000140624,0.2693861,0.0002132133,0.0006594537,0.00001249357,0.000002988814,0.00004578429,0.0001298102],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7048128,"threshold_uncertainty_score":0.4785344,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009000363,0.0001721358,0.0002538531,0.00007767313,0.0009502654,0.0001141971,0.0001073513,0.00005656306,0.00001041986],"category_scores_gemma":[0.001200901,0.0001170484,0.00005915891,0.0001152771,0.00006698158,0.0001305212,0.00005459142,0.0004578386,0.000002533858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005787419,"about_ca_system_score_gemma":0.00005995271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001160498,"about_ca_topic_score_gemma":8.454553e-7,"domain_scores_codex":[0.9986344,0.00004763536,0.0005507721,0.0001528984,0.0002792382,0.0003350454],"domain_scores_gemma":[0.9968283,0.002307483,0.0004572529,0.0001054299,0.0001544078,0.0001470798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009666813,0.0003510776,0.01943502,0.0005574051,0.0002861671,0.0003005149,0.01138483,0.1058162,0.0003282408,0.6723686,0.0001889873,0.1880162],"study_design_scores_gemma":[0.001662547,0.0005218326,0.03278377,0.001232471,0.00005818494,0.001922693,0.0003864773,0.8755233,0.0002316911,0.08516005,0.00008001456,0.0004369802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4302436,0.00001061063,0.5691348,0.00004655707,0.00008659763,0.000133092,0.00001390785,0.00002271642,0.000308176],"genre_scores_gemma":[0.5938234,0.000003087878,0.4060253,0.00004739532,0.00007461364,0.000002241718,0.000002784429,0.000009639087,0.00001159388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7697071,"threshold_uncertainty_score":0.7308769,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002058497,0.0002023747,0.0002011433,0.0001202503,0.002116372,0.001042658,0.0006847481,0.00004371626,0.00001262546],"category_scores_gemma":[0.0003337117,0.0001106569,0.0001871769,0.0005431868,0.0000507118,0.001056701,0.0001474847,0.0003971817,0.0001421082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001451679,"about_ca_system_score_gemma":0.00002405955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000352053,"about_ca_topic_score_gemma":0.00000571686,"domain_scores_codex":[0.9985664,0.00001423313,0.0004875165,0.0001746011,0.0003282974,0.0004288816],"domain_scores_gemma":[0.9984713,0.0003762743,0.0005151518,0.0002783914,0.0003250669,0.00003377633],"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.00003333722,0.00002513271,0.00001894793,0.000006666994,0.00005141324,0.000004786925,0.0001112743,0.6920263,0.0000359256,0.02349206,0.0003825165,0.2838116],"study_design_scores_gemma":[0.0005639478,0.00005795777,0.0003012003,0.0001331059,0.00007097677,0.00004294851,0.0003679853,0.9407821,0.00007212644,0.01651839,0.04086224,0.000226987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1029993,0.00001802629,0.8902702,0.005531101,0.0004719987,0.0003187289,0.000004594322,0.0001223725,0.0002637766],"genre_scores_gemma":[0.9777406,0.000001656272,0.00592981,0.01086,0.005367526,0.000005880871,0.00003600711,0.00003201516,0.00002652087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8843403,"threshold_uncertainty_score":0.9999943,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015819,0.00008710614,0.0001259489,0.00007082021,0.002019766,0.0001002782,0.000203978,0.00006500034,0.000008591737],"category_scores_gemma":[0.0001023407,0.00006440735,0.00007175138,0.0002526367,0.0001295934,0.0002030846,0.00000237741,0.0001513108,0.000002947917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003502253,"about_ca_system_score_gemma":0.0001902143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003330102,"about_ca_topic_score_gemma":0.00005013842,"domain_scores_codex":[0.9988182,0.0000632517,0.0004508029,0.00008188982,0.0002847779,0.0003011188],"domain_scores_gemma":[0.9983963,0.0006820136,0.0004620839,0.0000659406,0.000322179,0.00007150242],"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.0000772488,0.000009597107,0.0005273893,0.00001095787,0.00002092962,7.071328e-7,0.0203377,0.9666178,0.000003389893,0.01017163,0.00005632485,0.002166301],"study_design_scores_gemma":[0.0008903667,0.0005066086,0.01603225,0.0008528352,0.0001041325,0.000006759164,0.006659157,0.9684996,0.00002099247,0.004914355,0.001299239,0.0002137147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08843736,0.00003012323,0.9102914,0.000135976,0.000588732,0.0002355023,0.00000439959,0.0000377102,0.0002388155],"genre_scores_gemma":[0.9690474,0.000002864725,0.02994224,0.0002151812,0.0007532774,0.000003033272,0.00001190853,0.0000086193,0.00001550986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.88061,"threshold_uncertainty_score":0.9992794,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002164379,0.0001715111,0.0002155611,0.000363455,0.000320437,0.0003316933,0.0004977005,0.00003807319,0.00005761822],"category_scores_gemma":[0.00004301986,0.0001181581,0.0001112585,0.0006330517,0.0000433979,0.001035164,0.0003202895,0.0003784383,0.00003836916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009899584,"about_ca_system_score_gemma":0.00001244539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007125828,"about_ca_topic_score_gemma":0.00001049414,"domain_scores_codex":[0.9983585,0.00002212775,0.0006992007,0.0001429424,0.0003680946,0.000409107],"domain_scores_gemma":[0.9989253,0.00005474513,0.0007163068,0.0002260395,0.00006374992,0.00001385301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001197906,0.000359196,0.09478959,0.0008082095,0.0003234344,0.00035783,0.002384485,0.1024872,0.00002344707,0.2583976,0.006390017,0.5335591],"study_design_scores_gemma":[0.002080587,0.00008143092,0.5663168,0.003582801,0.0001245584,0.00004448524,0.006134467,0.3437995,0.00001953711,0.03510368,0.04201574,0.0006963576],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8406498,0.0001458574,0.007502313,0.0003232611,0.002064052,0.0004313076,2.01646e-7,0.00005086104,0.1488324],"genre_scores_gemma":[0.9952722,0.00002152142,0.001853005,0.002113264,0.0006183852,0.000002100979,0.000001396088,0.00001998851,0.00009819486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5328628,"threshold_uncertainty_score":0.4818348,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009136366,0.0002044805,0.0002220129,0.0001842573,0.001882051,0.001000988,0.0004308946,0.00005413328,0.00004948812],"category_scores_gemma":[0.0002071802,0.0001584049,0.0001044244,0.0001072943,0.0000715084,0.001172341,0.000106811,0.0002004321,0.00009498216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008251405,"about_ca_system_score_gemma":0.00003007234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001795467,"about_ca_topic_score_gemma":0.0004607322,"domain_scores_codex":[0.998597,0.000006433527,0.0004610832,0.0001957678,0.0003561896,0.0003835067],"domain_scores_gemma":[0.9985818,0.00001644749,0.0004036159,0.0004119047,0.0005551929,0.00003105801],"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.001243301,0.0007224258,0.02882391,0.002916619,0.0006013667,0.00003432289,0.003252494,0.7149497,0.000137066,0.07578649,0.009695667,0.1618366],"study_design_scores_gemma":[0.001981087,0.00005608974,0.02243331,0.0001441796,0.00005704651,0.000006273307,0.001183974,0.8811661,0.0000155335,0.001504919,0.09107008,0.0003813919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6390577,0.00002262066,0.3546147,0.001349403,0.0009947363,0.0003905031,0.00001443402,0.00008946082,0.003466435],"genre_scores_gemma":[0.9956838,0.000008669344,0.00208142,0.001266734,0.0004521557,0.000006877865,0.00006033979,0.00001386545,0.0004260622],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3566262,"threshold_uncertainty_score":0.9994174,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008099831,0.0001106615,0.000133818,0.0001228187,0.0003232655,0.0001511375,0.00008616981,0.0000532164,0.00001845553],"category_scores_gemma":[0.00003597736,0.00006823987,0.00005361506,0.0002077732,0.00003860084,0.0001790525,0.00002322831,0.0003457031,0.00002271376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004133772,"about_ca_system_score_gemma":0.00001301681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.201767e-7,"about_ca_topic_score_gemma":2.33951e-7,"domain_scores_codex":[0.9991681,0.000007974989,0.0003653509,0.00005400668,0.000181465,0.0002231339],"domain_scores_gemma":[0.9994595,0.000207476,0.00008418704,0.00007373998,0.00008719994,0.00008791593],"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.00003046993,0.000005634723,0.00008783096,0.00000718235,0.00004447341,0.000004857151,0.0009563248,0.940766,0.00001263481,0.0009148653,0.00006650739,0.0571032],"study_design_scores_gemma":[0.001243057,0.00001881338,0.0009488245,0.00005144562,0.00000841316,0.0002711848,0.0001001836,0.9966177,0.00009443199,0.000332526,0.0002040941,0.0001093778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4344585,0.00009487849,0.5537718,0.0001545874,0.000514162,0.0001540947,8.22312e-7,0.0002180521,0.01063311],"genre_scores_gemma":[0.9408014,0.000009601325,0.05854433,0.0001058647,0.0003993872,5.796459e-7,0.000003113963,0.00001872795,0.0001169656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5063429,"threshold_uncertainty_score":0.2782741,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004823836,0.0001420476,0.000128853,0.00008501181,0.0003579435,0.0003410703,0.0001437255,0.00006029195,0.00001245283],"category_scores_gemma":[0.00002580833,0.00008236067,0.0000404539,0.0001423642,0.00003239046,0.0001591787,0.00002041619,0.0006076411,0.000005293933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001662858,"about_ca_system_score_gemma":0.0000220202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002112796,"about_ca_topic_score_gemma":0.000003475503,"domain_scores_codex":[0.9992295,0.000004939141,0.0002617619,0.00007610524,0.0001598299,0.000267873],"domain_scores_gemma":[0.999337,0.0002547417,0.0001138158,0.0001028005,0.00009748437,0.00009422675],"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.0000106607,0.000008357406,0.0003650395,0.00004997204,0.00006861686,0.000002965196,0.001691881,0.4017515,0.0001860121,0.001302115,0.0002321513,0.5943308],"study_design_scores_gemma":[0.0009396694,0.000110761,0.0005018059,0.000153717,0.00001365413,0.0004152835,0.00005474735,0.9385872,0.000341705,0.0001590753,0.05852293,0.0001994429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03277739,0.00008670631,0.9601796,0.0003089892,0.0008319357,0.0003544044,0.000002815363,0.0001988374,0.005259342],"genre_scores_gemma":[0.9046798,0.00005216349,0.09407566,0.000532773,0.0005141559,0.000005883625,0.000002343692,0.00004738316,0.00008979822],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8719025,"threshold_uncertainty_score":0.3358571,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003981533,0.000222048,0.0002118792,0.0004719054,0.0004485741,0.0002649428,0.0001897121,0.00007502324,0.0000104849],"category_scores_gemma":[0.00003731542,0.0001968995,0.00008497301,0.001024457,0.000007244321,0.00083997,0.00004162817,0.0006724332,0.0000158847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003977049,"about_ca_system_score_gemma":0.00004364928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004721132,"about_ca_topic_score_gemma":4.284103e-7,"domain_scores_codex":[0.9982406,0.00001543258,0.0005078265,0.0001396888,0.0004352768,0.0006611499],"domain_scores_gemma":[0.9993659,0.00010829,0.0001733763,0.0001195793,0.000088952,0.0001438543],"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.00001073145,0.000002356566,0.00009747111,0.0000222383,0.00003028667,0.000009620861,0.0003298126,0.8706375,0.009640852,0.00009225535,0.00009479214,0.1190321],"study_design_scores_gemma":[0.000585135,0.00008703002,0.0006704426,0.0001876363,0.000009993762,0.00006627622,0.0001337089,0.9941375,0.003228731,0.0003751995,0.0002689627,0.0002493828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8863366,0.0001248976,0.111746,0.00003441308,0.0004202749,0.000118964,0.000001687336,0.0003455652,0.0008716582],"genre_scores_gemma":[0.9951229,0.00009687696,0.004208239,0.0001216649,0.0003733059,9.271913e-7,0.000007713867,0.00005041084,0.00001796045],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1235,"threshold_uncertainty_score":0.802933,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004750058,0.0001431554,0.0001428153,0.00008158478,0.000532133,0.0003161826,0.0001266774,0.00005702423,0.00003413059],"category_scores_gemma":[0.00004119159,0.0001052086,0.0001207118,0.000191612,0.00001676701,0.0001631475,0.00003240033,0.000395194,0.0000120379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001002052,"about_ca_system_score_gemma":0.00006237593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001110924,"about_ca_topic_score_gemma":0.000001413581,"domain_scores_codex":[0.998964,0.00001940953,0.0003964046,0.0000920897,0.0002493873,0.0002787531],"domain_scores_gemma":[0.9991523,0.0003605802,0.0001164716,0.0001046746,0.0001851619,0.00008079458],"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.00001378457,0.0000143391,0.00007475279,0.00002173699,0.00006661598,0.000006140569,0.0002633741,0.9738284,0.0002643103,0.006843178,0.0009725385,0.01763082],"study_design_scores_gemma":[0.001893944,0.00007646441,0.00009714138,0.000246864,0.00002234624,0.0003052307,0.00009909748,0.9827331,0.002368617,0.003861852,0.008069886,0.0002254969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1545965,0.0007937208,0.8007084,0.002411668,0.02046491,0.0009905453,0.00001727883,0.0007919942,0.019225],"genre_scores_gemma":[0.985348,0.00001563197,0.01342942,0.0004645851,0.0006672536,0.000002940678,0.00002016465,0.00003105479,0.00002094986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8307515,"threshold_uncertainty_score":0.4290283,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003364642,0.0001901332,0.0002825677,0.0002117351,0.0006715052,0.0003465608,0.0003242248,0.00008803368,0.000004897655],"category_scores_gemma":[0.002640286,0.0001250063,0.0001270847,0.0003785504,0.0001095809,0.0001260596,0.00008805726,0.0007565719,0.000008759758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003564928,"about_ca_system_score_gemma":0.0002873852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003289088,"about_ca_topic_score_gemma":0.000008071106,"domain_scores_codex":[0.997787,0.00006335428,0.0008518789,0.0001687653,0.00047416,0.0006548529],"domain_scores_gemma":[0.9968442,0.001990541,0.0004734263,0.0001880578,0.0003547305,0.0001489931],"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.000296463,0.0003151009,0.00023904,0.0001360328,0.0001050948,0.0001036632,0.001966136,0.2079942,0.00003898534,0.09159964,0.00008476693,0.6971209],"study_design_scores_gemma":[0.005985667,0.0004943135,0.00004671626,0.0007434143,0.00001155781,0.001266915,0.002476512,0.7734799,0.001223409,0.2115727,0.002315822,0.0003830788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03017402,0.00002432519,0.9662474,0.001273863,0.0002522395,0.0009893476,0.000004031336,0.00007405778,0.0009606694],"genre_scores_gemma":[0.01542339,0.000012757,0.9841545,0.0001319788,0.0001612234,0.00001235014,0.000003046126,0.00003531369,0.00006550954],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6967378,"threshold_uncertainty_score":0.5164743,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009641722,0.0001876258,0.0001927376,0.00008425561,0.0004336225,0.0001677771,0.0001969065,0.00006562645,0.000007216565],"category_scores_gemma":[0.00002795349,0.0001167311,0.00006303709,0.0001575324,0.00003652063,0.0002346441,0.00003064136,0.0004614228,0.000003194998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000521948,"about_ca_system_score_gemma":0.00003085662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007544641,"about_ca_topic_score_gemma":0.000004564747,"domain_scores_codex":[0.998905,0.00001516908,0.0004186283,0.0001118509,0.0001880968,0.0003612405],"domain_scores_gemma":[0.9991472,0.000329114,0.0001554323,0.0001338524,0.0001267278,0.0001076282],"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.00004991664,0.00001070498,0.001072497,0.00003271628,0.00009581151,0.000003462313,0.003104406,0.5924382,0.00002329404,0.0001569635,0.00002884898,0.4029832],"study_design_scores_gemma":[0.001847169,0.0001459805,0.001233239,0.0001592926,0.00002446093,0.0002323618,0.0002457353,0.9940172,0.001037338,0.0001199895,0.0007370047,0.0002001634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05973336,0.00006882583,0.937962,0.0000287775,0.0002419697,0.0003242717,0.000002108374,0.0001703708,0.001468319],"genre_scores_gemma":[0.5077121,0.00002066763,0.4919168,0.00007762592,0.0001991345,0.000005533726,0.000001166681,0.00004175644,0.00002523882],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4479787,"threshold_uncertainty_score":0.4760156,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004918813,0.0001481211,0.0001915795,0.0001157944,0.0001025934,0.0001439739,0.0001939112,0.00008422252,0.00003124573],"category_scores_gemma":[0.0000422897,0.0001114713,0.00008691264,0.0001827465,0.00001837001,0.0003490785,0.00003051199,0.0005217577,0.0001197901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001453192,"about_ca_system_score_gemma":0.00001631059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001306226,"about_ca_topic_score_gemma":2.376659e-7,"domain_scores_codex":[0.9989309,0.00001172911,0.0003715437,0.0001097714,0.0002282646,0.0003477966],"domain_scores_gemma":[0.9995148,0.00005055016,0.0000956416,0.0001695894,0.00007465989,0.00009479704],"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.0000211209,0.00001743307,0.0006974901,0.000056753,0.00002001214,0.000004870077,0.0002741,0.9746348,0.00006217934,0.002523149,0.001327939,0.02036016],"study_design_scores_gemma":[0.0008487524,0.0001197329,0.002249987,0.0002857411,0.000004687926,0.0002132638,0.0002078573,0.9855813,0.00008778759,0.0005433051,0.009609625,0.0002480016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4963787,0.00006556706,0.4304188,0.00005599293,0.002001656,0.0002587668,0.000001431868,0.0002504007,0.07056877],"genre_scores_gemma":[0.9919296,0.0000723525,0.00738139,0.000174999,0.0002428148,0.000001261217,0.000005386096,0.00002459346,0.0001676281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4955509,"threshold_uncertainty_score":0.4545668,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009089148,0.0001695503,0.0001599223,0.0001121242,0.0003243693,0.0006648729,0.0007404842,0.0000592286,0.0000263697],"category_scores_gemma":[0.00002603646,0.0001103817,0.00005263956,0.0002643105,0.00002797467,0.0003660272,0.00008633157,0.0005291282,0.00003622449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005640749,"about_ca_system_score_gemma":0.00004266479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003651773,"about_ca_topic_score_gemma":4.647471e-7,"domain_scores_codex":[0.9988523,0.0000206597,0.0004196126,0.0001241207,0.0002160681,0.0003672709],"domain_scores_gemma":[0.999338,0.00002715282,0.00009561041,0.0001973811,0.0001062543,0.0002355964],"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.0000116482,0.0000413333,0.0000517261,0.000006647801,0.00002716645,0.000004342796,0.003954827,0.7766873,0.000002638256,0.0007648505,0.00007162135,0.2183759],"study_design_scores_gemma":[0.0003832795,0.0001974568,0.0001280837,0.00007942989,0.000007832269,0.0003681629,0.00223229,0.9931008,0.0001809581,0.00002912668,0.003060018,0.0002325281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03038753,0.00002612882,0.9154805,0.00004974021,0.0004989668,0.0004220214,0.00000110386,0.0002591709,0.05287484],"genre_scores_gemma":[0.4224911,0.000002215189,0.577063,0.0001952236,0.0002082216,0.000004098201,0.000002273778,0.00002165626,0.00001216132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3921036,"threshold_uncertainty_score":0.6411385,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009747439,0.000248357,0.0004344235,0.000642721,0.0003474791,0.0006593197,0.0002614394,0.0000491632,0.00045136],"category_scores_gemma":[0.0001410722,0.0001663316,0.0002084417,0.0008514849,0.00007570905,0.001034371,0.00007678669,0.0002830664,0.00002456613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004557703,"about_ca_system_score_gemma":0.00001648152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009835445,"about_ca_topic_score_gemma":0.000004817523,"domain_scores_codex":[0.9987571,0.00003033724,0.0005090923,0.0002308636,0.0001814882,0.0002911226],"domain_scores_gemma":[0.9985611,0.0004739268,0.0004678664,0.0001357846,0.0003269545,0.00003436479],"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.001189662,0.000059405,0.005525805,0.00003669347,0.002047396,0.00001128095,0.0006474695,0.5171314,0.00001290232,0.008066725,0.000278691,0.4649926],"study_design_scores_gemma":[0.0008534412,0.0001719365,0.001359409,0.000142326,0.000426487,0.00004385426,0.000346033,0.9586173,0.00004191031,0.02098967,0.0166539,0.0003537451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6652342,0.00005866954,0.3308546,0.0003263175,0.0001270568,0.0001314248,0.000001029743,0.00009664516,0.003169997],"genre_scores_gemma":[0.9545107,0.000003779729,0.04280933,0.00205806,0.000363419,0.000001492904,0.00002054702,0.00002531488,0.0002072971],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4646388,"threshold_uncertainty_score":0.6782807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}