{"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":"a271bf8dbb5b","filters":{"venue":"Transportation Science"}},"results":[{"id":"W2066086285","doi":"10.1287/trsc.1030.0056","title":"Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1112,"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":"Emil Aaltosen Säätiö","keywords":"Vehicle routing problem; Heuristic; Benchmark (surveying); Pareto principle; Mathematical optimization; Set (abstract data type); Metaheuristic; Point (geometry); Routing (electronic design automation); Computer science; Interval (graph theory); Local search (optimization); Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0132602200802881,"gpt":0.2520301703643327,"spread":0.2387699502840446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007404433,0.0001201089,0.0001204386,0.0001133213,0.0002095225,0.00008479146,0.0001174594,0.00004272021,0.00004222411],"category_scores_gemma":[0.000006815329,0.0001139555,0.00001391182,0.0007650325,0.0004358123,0.0007519018,0.000003638809,0.0001394307,0.00001927977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007582192,"about_ca_system_score_gemma":0.00008055997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001644033,"about_ca_topic_score_gemma":0.00001874969,"domain_scores_codex":[0.9987337,0.00002388795,0.000246797,0.0002811087,0.0004132899,0.0003011994],"domain_scores_gemma":[0.9995419,0.00003719411,0.00003737911,0.0001255969,0.0001310725,0.0001267949],"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.000006576277,0.000006806341,0.006975449,0.00001583638,0.00000526089,0.00000162278,0.001144413,0.877481,0.004984897,0.0004044141,0.00000449177,0.1089692],"study_design_scores_gemma":[0.000454652,0.00003124717,0.02131861,0.00004100857,0.00001279156,0.00001440519,0.0002463672,0.9617651,0.01560047,0.00001719409,0.0003091231,0.0001890893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4034589,0.00002220584,0.5952296,0.0001089262,0.00003664822,0.00016147,0.000008547915,0.0002711708,0.0007025945],"genre_scores_gemma":[0.6993262,0.000009007581,0.3005314,0.00002072971,0.00003375479,0.000006456874,0.000008338528,0.00001452268,0.00004963214],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2958674,"threshold_uncertainty_score":0.4646972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168210873","doi":"10.1287/trsc.1090.0301","title":"Fifty Years of Vehicle Routing","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":981,"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":"Vehicle routing problem; Heuristics; Truck; Metaheuristic; Routing (electronic design automation); Mathematical optimization; Decomposition; Computer science; Operations research; Engineering; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01620746114889389,"gpt":0.2787206248230034,"spread":0.2625131636741095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004577014,0.00004739383,0.00007605713,0.00008807798,0.00003951664,0.00001389926,0.0001518233,0.00002168614,0.00002009904],"category_scores_gemma":[0.000037628,0.00005626586,0.00002154758,0.0007880446,0.00007153179,0.0002594677,7.825607e-7,0.00005203587,0.000004811629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001822521,"about_ca_system_score_gemma":0.00002689197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004308285,"about_ca_topic_score_gemma":0.000001694494,"domain_scores_codex":[0.999293,0.000007545733,0.0002013117,0.0001096396,0.0002467599,0.0001417658],"domain_scores_gemma":[0.9997098,0.00002640215,0.00003442731,0.0001184896,0.00006531381,0.00004554295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00000278648,0.00001293286,0.005281716,0.000009848149,0.000001944148,0.000001684409,0.002410843,0.7427246,0.1811836,0.00310606,0.00001143861,0.06525254],"study_design_scores_gemma":[0.0001565906,0.00001855073,0.7357615,0.00001545533,0.000004696985,3.652756e-7,0.00006670622,0.2095639,0.05406232,0.000205719,0.00005112025,0.0000930516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8815113,0.00001543364,0.116992,0.00002573815,0.00007386498,0.00004755947,0.00000303565,0.0001526196,0.00117838],"genre_scores_gemma":[0.9524834,0.000005465827,0.04745594,0.00002764932,0.000008816617,6.560352e-7,0.000002013822,0.000004855401,0.00001120215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7304798,"threshold_uncertainty_score":0.2294455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116675171","doi":"10.1287/trsc.1030.0057","title":"Vehicle Routing Problem with Time Windows, Part II: Metaheuristics","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":826,"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; Metaheuristic; Heuristics; Benchmark (surveying); Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Computer science; Point (geometry); Interval (graph theory); Operations research; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0140215721847575,"gpt":0.2471341688413525,"spread":0.233112596656595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007909327,0.0001373166,0.0001406621,0.0001084851,0.0002946833,0.00006350031,0.0002323891,0.0000367554,0.0001151464],"category_scores_gemma":[0.00002612254,0.0001278262,0.00002431628,0.0010132,0.00016321,0.000615305,0.000004109257,0.0001261396,0.00005783337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006120914,"about_ca_system_score_gemma":0.00007633153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004090481,"about_ca_topic_score_gemma":0.00001343158,"domain_scores_codex":[0.9986026,0.00001790558,0.0003143534,0.0002611702,0.0004691232,0.000334829],"domain_scores_gemma":[0.9994215,0.00004291369,0.00006264754,0.0002005345,0.000153311,0.0001190603],"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.000004458878,0.00001607478,0.001828876,0.00001007261,0.000007027676,0.000001749974,0.001242292,0.9810138,0.008563874,0.0008517219,0.00006044873,0.006399646],"study_design_scores_gemma":[0.0005137626,0.00005220836,0.01482659,0.00004751552,0.00003268174,0.000004089486,0.0000642402,0.9491122,0.02973916,0.00004837042,0.005207277,0.000351939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6929827,0.00004758595,0.2986113,0.0002661647,0.0001010447,0.0003192539,0.00001857727,0.0009288674,0.006724519],"genre_scores_gemma":[0.7557557,0.00000676918,0.2438504,0.00005013641,0.00004741929,0.000009840936,0.0000101882,0.00002198456,0.0002475348],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06277303,"threshold_uncertainty_score":0.5212602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096658257","doi":"10.1287/trsc.1090.0279","title":"Models for Evaluating and Planning City Logistics Systems","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":641,"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":"City logistics; Consolidation (business); Scheduling (production processes); Humanitarian Logistics; Traffic management; Computer science; Integrated business planning; Integrated logistics support; Operations research; Transport engineering; Business; Process management; Operations management; Engineering; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.161385543755704,"gpt":0.3205551225706211,"spread":0.1591695788149171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003667904,0.00009388474,0.0001139429,0.00007680897,0.0001345724,0.00005363654,0.0001105345,0.00003700974,0.000001661914],"category_scores_gemma":[0.00001976638,0.00009210793,0.00001783813,0.0002208338,0.000124773,0.0002701789,4.131642e-7,0.00006104109,4.805057e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002326224,"about_ca_system_score_gemma":0.0000293282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005257318,"about_ca_topic_score_gemma":0.000003165065,"domain_scores_codex":[0.9991425,0.000002541922,0.0002213997,0.0001793142,0.0002386365,0.0002156315],"domain_scores_gemma":[0.9996327,0.00004344412,0.00002691833,0.00009550853,0.0001188779,0.0000825077],"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.000005818805,0.000005577923,0.0008730444,0.00004139356,0.000002280822,0.00000227627,0.0008052493,0.9734637,0.002306943,0.02148173,0.00002707624,0.0009849536],"study_design_scores_gemma":[0.0002087019,0.00005272606,0.02365866,0.0000275875,0.00002085959,9.672341e-7,0.0001074737,0.9710458,0.0003221516,0.004368885,0.00005216011,0.0001340331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1535847,0.0003087049,0.8444621,0.000008957581,0.0002188424,0.0001865314,0.00004075279,0.0001539901,0.001035408],"genre_scores_gemma":[0.9885566,0.00001714934,0.01131226,0.00002637061,0.00003313589,0.000008679144,0.00002004447,0.000006688516,0.00001909207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8349718,"threshold_uncertainty_score":0.3756052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991149726","doi":"10.1287/trsc.1030.0079","title":"Traveling Salesman Problems with Profits","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":617,"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":"Travelling salesman problem; Mathematical optimization; Profit (economics); Generalization; Vertex (graph theory); Heuristic; Traveling purchaser problem; Operations research; Computer science; Combinatorial optimization; Bottleneck traveling salesman problem; Mathematics; Economics; Combinatorics; Microeconomics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01684428022553878,"gpt":0.2527487551312724,"spread":0.2359044749057337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004343075,0.00008831146,0.0000764706,0.00008554287,0.0001093423,0.0000419231,0.000159369,0.00002419204,0.00002867898],"category_scores_gemma":[0.000008334488,0.00007925955,0.00001280054,0.0008153219,0.0001142337,0.0005080436,8.120352e-7,0.00008166708,0.00001936369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004077157,"about_ca_system_score_gemma":0.00004842343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002381956,"about_ca_topic_score_gemma":0.00003660411,"domain_scores_codex":[0.9990821,0.000006995478,0.0001864771,0.0001838833,0.0003233145,0.0002171613],"domain_scores_gemma":[0.9996554,0.00001676168,0.00002804415,0.0001239733,0.00009792182,0.00007786317],"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.00000160085,0.000005534977,0.00293701,0.0000180303,0.000001933304,5.562813e-7,0.00160397,0.9713183,0.01527006,0.0005484516,0.00000401386,0.008290523],"study_design_scores_gemma":[0.0005188194,0.00003640343,0.1061895,0.0000694744,0.00001587132,0.000005470345,0.0001297188,0.831332,0.05999776,0.00004390246,0.001319898,0.0003412364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5230128,0.00002080558,0.473717,0.00007783555,0.00004963461,0.0001550378,0.000002611222,0.0003777014,0.002586611],"genre_scores_gemma":[0.8000012,0.000006286718,0.199855,0.00002575025,0.00002472202,0.00001181787,0.000004395094,0.00001422508,0.0000566223],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2769884,"threshold_uncertainty_score":0.3232111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127654349","doi":"10.1287/trsc.2013.0472","title":"Thirty Years of Inventory Routing","year":2013,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":578,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"Vehicle routing problem; Operations research; Scheduling (production processes); Computer science; Routing (electronic design automation); Metaheuristic; Class (philosophy); Categorization; Operations management; Engineering; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01910265373136389,"gpt":0.2644134794584833,"spread":0.2453108257271194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004052101,0.00004540052,0.00006905553,0.00009625927,0.0000330375,0.00001764358,0.0001552798,0.00002193619,0.0001007482],"category_scores_gemma":[0.00003985066,0.00005104213,0.00001980977,0.0005987892,0.0001230544,0.0003974046,0.000001702537,0.00005226794,0.00002424895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002008953,"about_ca_system_score_gemma":0.00003073493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003081963,"about_ca_topic_score_gemma":0.000003466263,"domain_scores_codex":[0.9993116,0.000009191207,0.0002025603,0.0001004266,0.0002438013,0.0001323686],"domain_scores_gemma":[0.9996722,0.00002574444,0.00003816839,0.0001158659,0.00009711171,0.00005089642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.000001028659,0.00001546811,0.08948469,0.00005559321,0.000007088391,9.657416e-7,0.006097064,0.7041531,0.1613896,0.003586648,0.00007562576,0.03513318],"study_design_scores_gemma":[0.0001158819,0.000007122742,0.6794265,0.00001875882,0.000004208225,2.295222e-7,0.0001766183,0.2983409,0.02155913,0.0002064289,0.00004626948,0.00009797162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9194403,0.00001225,0.07885283,0.00001107524,0.0001239469,0.0000806247,0.000001569012,0.0001299221,0.001347537],"genre_scores_gemma":[0.9577026,0.000004924182,0.04222933,0.00001592262,0.000007898501,0.000004871434,0.000001866304,0.000007554927,0.00002498438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5899418,"threshold_uncertainty_score":0.2081438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119097848","doi":"10.1287/trsc.1090.0272","title":"Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":462,"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":"Column generation; Pickup; Mathematical optimization; Set (abstract data type); Branch and cut; Relaxation (psychology); Linear programming relaxation; Lagrangian relaxation; Computer science; Path (computing); Integer programming; Linear programming; Shortest path problem; Branch and price; Vehicle routing problem; Column (typography); Mathematics; Routing (electronic design automation); Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01091285829767171,"gpt":0.2396820738027333,"spread":0.2287692155050615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003883927,0.00006603267,0.00006613821,0.00004194886,0.0001609655,0.00006141806,0.00005842203,0.00001812607,0.00000271603],"category_scores_gemma":[0.000009582536,0.0000475064,0.000005183922,0.0002553434,0.0001395514,0.0003056581,0.000001071671,0.00004092613,2.883282e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006562871,"about_ca_system_score_gemma":0.00002066584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000324957,"about_ca_topic_score_gemma":0.000007943318,"domain_scores_codex":[0.9995002,0.000005592808,0.00009909627,0.0001509386,0.0001199875,0.0001241826],"domain_scores_gemma":[0.9997118,0.00009239167,0.00002188296,0.00006679288,0.00005803681,0.00004908766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001215209,0.00003272762,0.0329287,0.0002514535,0.00003307662,0.000002798426,0.01713081,0.632996,0.09547345,0.003888609,0.00007786271,0.217063],"study_design_scores_gemma":[0.0007357716,0.0001108025,0.5604447,0.00003719052,0.00003384678,0.000009906421,0.00008122937,0.4341531,0.00356541,0.0003456165,0.0002951769,0.0001872722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6775494,0.0001832901,0.3215188,0.0001990593,0.00001146454,0.0002967013,0.000004316721,0.00006728969,0.0001696236],"genre_scores_gemma":[0.9228811,0.00006746071,0.07691897,0.00007249648,0.000007593977,0.000008389613,0.000001480964,0.000005662807,0.00003686295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5275159,"threshold_uncertainty_score":0.1937255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136871443","doi":"10.1287/trsc.1060.0188","title":"A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":426,"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":"Mathematical optimization; Stockout; Integer programming; Operations research; Vendor; Time horizon; Purchasing; Computer science; Economic order quantity; Linear programming; Set (abstract data type); Order (exchange); Vendor-managed inventory; Routing (electronic design automation); Branch and cut; Supply chain; Vehicle routing problem; Product (mathematics); Supply chain management; Mathematics; Operations management; Economics; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.02032142200990912,"gpt":0.2890078836574357,"spread":0.2686864616475266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002009491,0.000104135,0.0001138451,0.0001787241,0.0001962249,0.0000511731,0.0001487127,0.00003984186,0.000006410761],"category_scores_gemma":[0.00004412441,0.0001142856,0.00003202151,0.000723274,0.0001298066,0.0003544675,0.000002734656,0.00008608729,0.000002425478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000484565,"about_ca_system_score_gemma":0.00003312047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008994615,"about_ca_topic_score_gemma":0.00003000298,"domain_scores_codex":[0.9988627,0.000009434393,0.0002996196,0.0002384567,0.0002587336,0.0003310249],"domain_scores_gemma":[0.9995298,0.00008988586,0.0000522956,0.0001128641,0.0001053398,0.0001098468],"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.00001990157,0.0000399215,0.01002302,0.0002790896,0.00003080353,0.000008822553,0.0129037,0.150538,0.04697737,0.00880303,0.0000505317,0.7703258],"study_design_scores_gemma":[0.0008905999,0.00003695191,0.03891905,0.000059054,0.00002722189,0.000003857834,0.0003034193,0.9332026,0.0246431,0.0008615832,0.0007227837,0.000329837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1324579,0.00003404282,0.8662319,0.00002580487,0.0001393666,0.0002873233,0.000007614211,0.0002675178,0.000548568],"genre_scores_gemma":[0.6410026,0.000005742243,0.3588545,0.00003469192,0.00002818887,0.00001550157,0.000006564468,0.00001571241,0.00003647392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7826645,"threshold_uncertainty_score":0.4660432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968350460","doi":"10.1287/trsc.1050.0120","title":"Models and Tabu Search Heuristics for the Berth-Allocation Problem","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":397,"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":"HEC Montréal; Università della Calabria; Canada Research Chairs","keywords":"Tabu search; Heuristics; Mathematical optimization; Heuristic; Schedule; Computer science; Set (abstract data type); Minification; Branch and bound; Operations research; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03399212553211606,"gpt":0.2645859461542923,"spread":0.2305938206221762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003171494,0.00005209624,0.00004524548,0.00003437371,0.0001532552,0.00004891992,0.0001024222,0.00001803851,0.00001364378],"category_scores_gemma":[0.000007129287,0.00003971376,0.00001053608,0.0001562622,0.0001503167,0.0002151838,0.000001396804,0.00004701761,0.000001524093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001416532,"about_ca_system_score_gemma":0.00003168814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002475989,"about_ca_topic_score_gemma":0.0001259113,"domain_scores_codex":[0.9994402,0.000001724648,0.0001301799,0.0001088143,0.0001779838,0.0001410819],"domain_scores_gemma":[0.9996983,0.00005715497,0.0000119983,0.00008906698,0.00009979655,0.00004368233],"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.000002848413,0.000007702753,0.0002630309,0.00004621318,0.000002800337,2.176228e-7,0.001417491,0.9078562,0.000622723,0.04764792,0.0001482293,0.04198462],"study_design_scores_gemma":[0.00009884547,0.00000965379,0.008533531,0.000005150192,0.00001107181,6.412665e-7,0.00006507464,0.9857656,0.0008305638,0.001371783,0.003238698,0.00006940369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02868052,0.000173243,0.9688057,0.0004325002,0.00005942175,0.0002972085,0.00002584348,0.00007051647,0.001455013],"genre_scores_gemma":[0.9825574,0.0001197426,0.01708508,0.00004276255,0.0000345809,0.00002367626,0.00001120809,0.000006509849,0.000119079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9538769,"threshold_uncertainty_score":0.161948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126475333","doi":"10.1287/trsc.1050.0145","title":"A Tabu Search Algorithm for a Routing and Container Loading Problem","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":325,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Routing (electronic design automation); Guided Local Search; Container (type theory); Mathematical optimization; Algorithm; Computer science; Search algorithm; Engineering; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01246921401535756,"gpt":0.2430320924813416,"spread":0.2305628784659841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003201715,0.0000645819,0.00006629786,0.00009107279,0.0001410683,0.00007875682,0.00006359533,0.00002160618,0.000009703219],"category_scores_gemma":[0.000002938868,0.00006443155,0.00001438401,0.0003647553,0.00007750149,0.0002720483,0.000001102625,0.00004239432,0.000001778813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000199449,"about_ca_system_score_gemma":0.00002742014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005087683,"about_ca_topic_score_gemma":0.00004244477,"domain_scores_codex":[0.9993468,0.000002822335,0.0001526869,0.0001472156,0.0001529128,0.0001975663],"domain_scores_gemma":[0.9997751,0.00002537963,0.00001714909,0.0000494667,0.0000896984,0.00004318941],"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.000006441535,0.00002796087,0.01257628,0.0001853955,0.00000967353,0.000003082026,0.004785235,0.8440365,0.04349257,0.03077454,0.0001953658,0.06390691],"study_design_scores_gemma":[0.0004374667,0.00001764206,0.01111388,0.00002971446,0.000006272327,0.000001570993,0.0001174823,0.9811672,0.005942456,0.0003514484,0.0006722938,0.0001425663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06856596,0.0000465425,0.9293441,0.00004809601,0.00008751159,0.000279739,0.00001835894,0.0001793996,0.00143026],"genre_scores_gemma":[0.9046504,0.000006051647,0.09512366,0.00001801696,0.00002376414,0.0000197302,0.00001948393,0.00001019652,0.0001286978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8360844,"threshold_uncertainty_score":0.2627442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059559546","doi":"10.1287/trsc.35.4.375.10432","title":"Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":308,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew scheduling; Crew; Column generation; Scheduling (production processes); Integer programming; Mathematical optimization; Benders' decomposition; Engineering; Routing (electronic design automation); Branch and bound; Decomposition; Heuristic; Computer science; Iterated local search; Operations research; Metaheuristic; Aeronautics; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02012691727956976,"gpt":0.3079237455336067,"spread":0.287796828254037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005019603,0.00009001057,0.00009012685,0.0001117119,0.0002390692,0.00006616906,0.00009685444,0.00003634206,0.000009207227],"category_scores_gemma":[0.0000896295,0.0001025435,0.00002219672,0.0004716431,0.00008984158,0.0003741619,0.000001606303,0.00005931958,0.000001726127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003989193,"about_ca_system_score_gemma":0.00002615614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005764126,"about_ca_topic_score_gemma":0.00001392876,"domain_scores_codex":[0.9991583,0.000008387513,0.0002132406,0.0002104632,0.0001804588,0.0002291606],"domain_scores_gemma":[0.9995102,0.0001770129,0.00003403766,0.00008591256,0.0001091591,0.00008369231],"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.000005347201,0.000003891032,0.002027422,0.00001878122,0.000002525111,0.000001771205,0.0007489995,0.9693616,0.01673604,0.0004978445,8.154981e-7,0.01059494],"study_design_scores_gemma":[0.0002631284,0.00001576422,0.006347263,0.00002220792,0.00001172784,0.00000498601,0.0002181171,0.9878444,0.004919173,0.0001596935,0.0000630818,0.0001304309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4290377,0.00002539646,0.5704123,0.00004119256,0.00007339731,0.00010642,0.000003192452,0.0001668946,0.0001335096],"genre_scores_gemma":[0.7344263,0.00002199059,0.2654615,0.00003385512,0.00001873677,0.000007302664,0.000009227675,0.00001204357,0.00000907601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3053885,"threshold_uncertainty_score":0.4181604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2255469947","doi":"10.1287/trsc.2015.0646","title":"50th Anniversary Invited Article—Goods Distribution with Electric Vehicles: Review and Research Perspectives","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":299,"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":"Popularity; Distribution (mathematics); Electric vehicle; Marketing; Transport engineering; Market research; Business; Driving range; Engineering; Industrial organization; Operations research; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01209062669391626,"gpt":0.2664546609831448,"spread":0.2543640342892285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004276366,0.00008429831,0.000101433,0.0001114293,0.0001631613,0.00002880208,0.0001280614,0.00002964168,0.00002441727],"category_scores_gemma":[0.00002937125,0.00005455744,0.00001314481,0.001868341,0.0002800528,0.0004748792,0.000002246401,0.0001310656,0.000004673408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001088129,"about_ca_system_score_gemma":0.00004852249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009772243,"about_ca_topic_score_gemma":0.000008517997,"domain_scores_codex":[0.9989389,0.00001985567,0.0001248234,0.0002369901,0.000375258,0.0003041713],"domain_scores_gemma":[0.9994995,0.00004357626,0.00002034091,0.0001252339,0.0002092408,0.0001021015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00007318446,0.00006368026,0.03450655,0.0006327429,0.00004905571,0.00002590622,0.004421324,0.0003134192,0.8341035,0.00985157,0.006469036,0.1094901],"study_design_scores_gemma":[0.0006717909,0.0002869959,0.9320712,0.0004413158,0.00005315982,0.00001561499,0.0004922168,0.001196236,0.06159236,0.0008223412,0.002031825,0.000324943],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9889144,0.005194201,0.004343276,0.001039948,0.000009994376,0.0001973958,0.00002058995,0.0001046672,0.000175567],"genre_scores_gemma":[0.9960935,0.003605093,0.0001842412,0.00006050611,0.00001258971,0.000008227719,0.000004447367,0.000007780704,0.00002365302],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8975646,"threshold_uncertainty_score":0.2224788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134422508","doi":"10.1287/trsc.1030.0065","title":"Designing a Road Network for Hazardous Materials Transportation","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":290,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"McGill University","funders":"McGill University","keywords":"Hazardous waste; Deregulation; Dangerous goods; Transport engineering; Bilevel optimization; Government (linguistics); Business; Risk analysis (engineering); Flow network; Transport network; Engineering; Environmental planning; Computer science; Economics; Environmental science; Waste management; Optimization problem","retraction":null,"screen_n_in":null,"score":{"opus":0.07623691227594778,"gpt":0.3678143486371205,"spread":0.2915774363611727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005236181,0.0001755659,0.0003598093,0.0003332138,0.0007793301,0.0003523285,0.0008494262,0.00007244736,0.0001750533],"category_scores_gemma":[0.0003164335,0.0001424137,0.0001835578,0.002978603,0.0003615647,0.001290024,0.000001941418,0.00006595206,0.00009191297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005866044,"about_ca_system_score_gemma":0.0003878456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002635524,"about_ca_topic_score_gemma":0.001184767,"domain_scores_codex":[0.9957741,0.00004544916,0.001071727,0.0007721836,0.001831988,0.00050456],"domain_scores_gemma":[0.9980405,0.0002444547,0.0003887134,0.0004193083,0.0007236373,0.0001833613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.000427361,0.0001320497,0.008947384,0.00002095405,0.00003909533,0.00002521335,0.01242618,0.6759949,0.1849731,0.04820199,0.0004661267,0.06834565],"study_design_scores_gemma":[0.001978329,0.0002136643,0.5996581,0.0000582748,0.0001452562,0.000002617889,0.001881807,0.0008323999,0.1230902,0.2691485,0.002376326,0.0006145337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5115654,0.00003867806,0.486737,0.0007925775,0.0003280765,0.000297472,0.00008637884,0.00005552667,0.00009883272],"genre_scores_gemma":[0.941815,0.00003057265,0.05756538,0.0002078965,0.00009956086,0.00005534854,0.00006609072,0.00001152345,0.0001486733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6751625,"threshold_uncertainty_score":0.5994056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098090443","doi":"10.1287/trsc.1040.0103","title":"A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":273,"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":"Tabu search; Vehicle routing problem; Benchmark (surveying); Algorithm; Computer science; Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Residual; Route planning; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01970802792664043,"gpt":0.2744546307225553,"spread":0.2547466027959149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306915,0.00009606065,0.00008538162,0.00008284735,0.0003764944,0.0001017317,0.0002836445,0.00003301445,0.00001700894],"category_scores_gemma":[0.00001301827,0.00008097542,0.00004231634,0.0008929421,0.0001539985,0.0003442825,0.000003468747,0.0000982553,0.000007469143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005569974,"about_ca_system_score_gemma":0.00007224539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001197365,"about_ca_topic_score_gemma":0.00003365344,"domain_scores_codex":[0.9987956,0.00001490572,0.0002636415,0.0002171286,0.0003740411,0.0003347221],"domain_scores_gemma":[0.9993652,0.0001880892,0.00003395364,0.0001652816,0.0002016747,0.00004579897],"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.000001896534,0.000008540977,0.001434827,0.0000173277,0.000003589146,6.431303e-7,0.0005752073,0.9104491,0.01052518,0.002038107,0.00003568406,0.07490982],"study_design_scores_gemma":[0.0002179252,0.000009224444,0.039293,0.00001085792,0.00001086126,7.176306e-7,0.0001359206,0.9496039,0.01018211,0.000144141,0.0002836572,0.0001076586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1392037,0.00006239297,0.8595569,0.00008883684,0.0001074461,0.0003437385,0.00002057086,0.0002302301,0.0003862369],"genre_scores_gemma":[0.6573957,0.00000678427,0.3423711,0.00002364373,0.00005229669,0.00003633793,0.00001028206,0.00001602575,0.00008782493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5181921,"threshold_uncertainty_score":0.3302082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136611127","doi":"10.1287/trsc.1060.0187","title":"Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":260,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"Tabu search; Mathematical optimization; Vehicle routing problem; Routing (electronic design automation); Heuristics; Metaheuristic; Computer science; Relaxation (psychology); Heuristic; Local search (optimization); Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01782215380448123,"gpt":0.2770757188440929,"spread":0.2592535650396117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003811379,0.0001700723,0.0001386039,0.0001741588,0.0007193388,0.0001478084,0.0003684656,0.00006008611,0.00003418447],"category_scores_gemma":[0.0002262158,0.0001452679,0.00003070006,0.002986173,0.0003997285,0.000560518,0.000004333228,0.0002836626,0.00002195777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001298579,"about_ca_system_score_gemma":0.0001253338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001116428,"about_ca_topic_score_gemma":0.0001426109,"domain_scores_codex":[0.9979303,0.0000678931,0.000510613,0.0003268518,0.0006841929,0.0004801649],"domain_scores_gemma":[0.9985245,0.0003465587,0.00009011396,0.0002471368,0.0006639967,0.000127721],"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.000009718014,0.00002377718,0.00622691,0.00005305617,0.00001269305,0.000003706718,0.0210366,0.895071,0.0698673,0.003628121,0.00013668,0.003930387],"study_design_scores_gemma":[0.0007075767,0.00004862585,0.07594886,0.0001517828,0.00004529825,0.000006458899,0.004665728,0.8582441,0.05913224,0.0001740863,0.0003082346,0.0005670081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2706774,0.0001127165,0.7273492,0.0001342556,0.0001219339,0.0003606796,0.00001343639,0.0002935267,0.0009368859],"genre_scores_gemma":[0.965493,0.00001960122,0.03420775,0.00007271863,0.00002847687,0.0000176851,0.00005113587,0.00002950033,0.00008010636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6948156,"threshold_uncertainty_score":0.5923854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070175767","doi":"10.1287/trsc.1050.0114","title":"Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":245,"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é Laval","funders":"","keywords":"Exploit; Probabilistic logic; Vehicle routing problem; Computer science; Operations research; Real-time data; Field (mathematics); Travel time; Routing (electronic design automation); Transport engineering; Engineering; Computer security; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.008531559982207816,"gpt":0.2504757629453988,"spread":0.241944202963191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003138224,0.0001251243,0.0001207046,0.0001585358,0.0002976717,0.00005503831,0.0001678762,0.00004754966,0.00004061713],"category_scores_gemma":[0.000005801681,0.0001322523,0.0000572677,0.0008631092,0.0001036771,0.0005750845,8.081374e-7,0.00007424433,0.00001983701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004631388,"about_ca_system_score_gemma":0.00006452577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004166853,"about_ca_topic_score_gemma":0.0004697345,"domain_scores_codex":[0.9988775,0.000003940287,0.0003819146,0.0002401266,0.0002108088,0.0002856638],"domain_scores_gemma":[0.9994972,0.00004581157,0.00004407871,0.0001499014,0.0001998684,0.0000631911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00002432184,0.0001567281,0.02479625,0.0003130139,0.00001907142,0.000003131415,0.008408162,0.09976816,0.7106085,0.1390343,0.001020833,0.0158475],"study_design_scores_gemma":[0.0006967941,0.00002230241,0.9334244,0.00004388671,0.00002955979,5.794515e-7,0.0005481395,0.03667202,0.02146228,0.001077073,0.005667982,0.0003549972],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9362587,0.00004656847,0.05912902,0.0000926678,0.0002955277,0.0002694133,0.00008421228,0.0005120963,0.003311824],"genre_scores_gemma":[0.9944289,0.00001558137,0.004878228,0.00002037785,0.0001621533,0.00008657538,0.0002063509,0.00002099236,0.000180831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9086282,"threshold_uncertainty_score":0.5393091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108538642","doi":"10.1287/trsc.34.4.426.12325","title":"Diversion Issues in Real-Time Vehicle Dispatching","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":238,"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","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Heuristic; Vehicle routing problem; Operations research; Routing (electronic design automation); Service (business); Engineering; Computer network; Operations management; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0119139913638161,"gpt":0.2780669214422083,"spread":0.2661529300783922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004779069,0.00007458808,0.00008756237,0.00012224,0.0000944839,0.00003468776,0.0001747615,0.00002885911,0.0005795666],"category_scores_gemma":[0.00001059816,0.0000804625,0.00001764494,0.0008761818,0.00007470615,0.0005738688,0.000001551604,0.00007043833,0.0001103352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004901179,"about_ca_system_score_gemma":0.00001776762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001359141,"about_ca_topic_score_gemma":0.00002500551,"domain_scores_codex":[0.9991424,0.00001822852,0.0001865233,0.000178724,0.0002734587,0.0002006333],"domain_scores_gemma":[0.9997445,0.00003055769,0.00001449067,0.0001237028,0.00002756824,0.00005920851],"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.000005430078,0.00001094587,0.01722393,0.00001042043,9.577618e-7,0.000004474439,0.002976432,0.9049954,0.05278736,0.0001028065,0.00002426348,0.02185751],"study_design_scores_gemma":[0.0002452884,0.000009672055,0.4469493,0.00003209801,0.000003346811,3.661364e-7,0.00007835457,0.5433169,0.008855324,0.00009483474,0.000261241,0.0001532451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9921557,0.00001691867,0.00364185,0.00006745427,0.00005113672,0.00007540004,0.000004138682,0.0002664549,0.003720948],"genre_scores_gemma":[0.9752172,0.0001267554,0.02431828,0.00001621553,0.0000119428,0.000003007943,0.000007587314,0.00001057609,0.0002884785],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4297254,"threshold_uncertainty_score":0.6345848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163826616","doi":"10.1287/trsc.1030.0045","title":"Existence, Uniqueness, and Trip Cost Function Properties of User Equilibrium in the Bottleneck Model with Multiple User Classes","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":235,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Bottleneck; Uniqueness; Schedule; Travel time; Function (biology); Unit (ring theory); Computer science; Mathematical optimization; Unit of time; Total cost; Retard; Average cost; Operations research; Mathematics; Transport engineering; Economics; Engineering; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.04486344256649982,"gpt":0.279911263394904,"spread":0.2350478208284042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007707186,0.00008934803,0.0001090583,0.0001404858,0.0002842002,0.0000730204,0.000204702,0.00004830992,0.000003533357],"category_scores_gemma":[0.00004165166,0.00006185877,0.00001774014,0.001087671,0.0009232312,0.001154401,0.000001118783,0.00007810206,6.510496e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003433323,"about_ca_system_score_gemma":0.0005952999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001461302,"about_ca_topic_score_gemma":0.01118934,"domain_scores_codex":[0.9986544,0.00004047142,0.0002505551,0.0002404966,0.0006119345,0.0002021273],"domain_scores_gemma":[0.9994355,0.00004102428,0.000115397,0.0001146682,0.0002403739,0.00005306342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0002943896,0.000134733,0.2339837,0.00005647484,0.000005151544,0.000003315625,0.07243483,0.5874385,0.007300805,0.09806564,0.000007707754,0.0002747671],"study_design_scores_gemma":[0.001656407,0.0001284326,0.9659437,0.0002150417,0.00004276921,8.716506e-7,0.01986503,0.005312808,0.004644889,0.001454402,0.00045739,0.0002782676],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9723072,0.00004242822,0.02609198,0.000541849,0.00004154843,0.0004057174,0.00001046284,0.00004015632,0.000518647],"genre_scores_gemma":[0.9962356,0.00004522571,0.003439462,0.000116561,0.000008938375,0.00003819591,0.00001260552,0.000005837011,0.00009756936],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.73196,"threshold_uncertainty_score":0.6243917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135680984","doi":"10.1287/trsc.1070.0223","title":"Tabu Search, Partial Elementarity, and Generalized <i>k</i>-Path Inequalities for the Vehicle Routing Problem with Time Windows","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":227,"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":"Column generation; Vehicle routing problem; Tabu search; Mathematical optimization; Benchmark (surveying); Generalization; Heuristic; Routing (electronic design automation); Path (computing); Set (abstract data type); Computer science; Relaxation (psychology); Shortest path problem; Mathematics; Graph; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03526509438761437,"gpt":0.2763590414941016,"spread":0.2410939471064872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077044,0.0001123808,0.0001224617,0.00005602002,0.0005357256,0.00006436481,0.0001731067,0.00002429538,0.00002127016],"category_scores_gemma":[0.00001815835,0.00008422788,0.00002162185,0.0004464596,0.0003276221,0.0003935876,0.000005348725,0.00008619832,0.000001892493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002962169,"about_ca_system_score_gemma":0.00009005233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009405001,"about_ca_topic_score_gemma":0.00003777423,"domain_scores_codex":[0.9988167,0.00003115987,0.0002537287,0.0002162041,0.0003778682,0.0003043029],"domain_scores_gemma":[0.9994735,0.0001446698,0.00004422565,0.0001389256,0.000125317,0.0000734382],"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.00004895938,0.00001802092,0.03505726,0.00005923133,0.0000224835,0.000002808441,0.01314132,0.9169374,0.02996005,0.00263386,0.00005571728,0.00206296],"study_design_scores_gemma":[0.001122268,0.00006766857,0.03717532,0.0000237147,0.00002734129,0.00000613979,0.0003774705,0.9379273,0.02267597,0.00006040123,0.0003166034,0.0002198054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7052914,0.00003385648,0.2938739,0.0001273376,0.00003135904,0.0003977469,0.00002274722,0.0001381275,0.00008350238],"genre_scores_gemma":[0.8933262,0.00002734797,0.1063803,0.0000748908,0.00003300517,0.0000551323,0.00001515961,0.00001798587,0.00006997936],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1880349,"threshold_uncertainty_score":0.4120423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978976115","doi":"10.1287/trsc.1090.0262","title":"An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":225,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Heuristics; Linear programming; Revenue management; Column generation; Computer science; Heuristic; Markov decision process; Bellman equation; Multinomial logistic regression; Affine transformation; Revenue; Operations research; Markov process; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01442272745720435,"gpt":0.2521892451499171,"spread":0.2377665176927128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006761889,0.0001906262,0.0001472256,0.0003488219,0.0003884299,0.0004286139,0.0005831042,0.00002378797,0.00002415139],"category_scores_gemma":[0.000003893669,0.0001667187,0.00003087156,0.002478538,0.0001135846,0.001899526,0.00001106669,0.00007932225,0.00007437208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005000847,"about_ca_system_score_gemma":0.00001436823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008099448,"about_ca_topic_score_gemma":0.0001204285,"domain_scores_codex":[0.9979343,0.000005694505,0.0002491724,0.0006020136,0.0006795171,0.0005292852],"domain_scores_gemma":[0.9993166,0.000003853688,0.0001273432,0.0003834006,0.0001170306,0.0000517998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0003009921,0.001681718,0.04011833,0.0008240672,0.00006816404,0.00006587939,0.002326307,0.2043122,0.0011626,0.4682792,0.00465479,0.2762058],"study_design_scores_gemma":[0.001355155,0.000142569,0.7157449,0.0001953311,0.0001784821,0.000001248378,0.001677198,0.04457153,0.00002761247,0.001988877,0.2330096,0.001107581],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6684858,0.00008129379,0.1885594,0.001989057,0.0008453099,0.005517704,0.00001118472,0.001186386,0.1333239],"genre_scores_gemma":[0.975394,0.000003028755,0.02088416,0.002897763,0.000191479,0.00009414365,0.00006860579,0.00001747836,0.0004493948],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6756265,"threshold_uncertainty_score":0.6798591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114778474","doi":"10.1287/trsc.1120.0443","title":"Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":201,"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":"Heuristics; Mathematical optimization; Benchmark (surveying); Routing (electronic design automation); Heuristic; Computer science; Production (economics); Set (abstract data type); Vehicle routing problem; Operations research; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.03499057401878422,"gpt":0.297467522666346,"spread":0.2624769486475618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002404556,0.0001163664,0.00009200938,0.0001165743,0.0005194792,0.00005840567,0.0002213267,0.0000396207,0.00003364661],"category_scores_gemma":[0.0001092418,0.00009618169,0.00004085985,0.00118887,0.0001131965,0.0007353006,0.000002711616,0.0001129949,0.000004459044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000794942,"about_ca_system_score_gemma":0.0001051082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004827231,"about_ca_topic_score_gemma":0.000004720373,"domain_scores_codex":[0.998633,0.0000309814,0.0002587828,0.0002117032,0.0003969042,0.0004686312],"domain_scores_gemma":[0.9991097,0.0002291611,0.0000536933,0.0002008431,0.0003165502,0.0000900303],"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.000007028807,0.00002021297,0.005418184,0.0000189352,0.000005137797,3.319444e-8,0.001737298,0.9870836,0.0007991478,0.003672029,0.00001305436,0.001225365],"study_design_scores_gemma":[0.0001953098,0.00001413348,0.009277255,0.0000184983,0.00002068483,3.698176e-7,0.0004156358,0.9792958,0.01056171,0.00001244751,0.00006210696,0.0001260088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005541369,0.0000598983,0.9924003,0.0002110855,0.0003969904,0.0006814901,0.00001957492,0.0002737637,0.0004154929],"genre_scores_gemma":[0.7656955,0.000004655497,0.2340318,0.00003674468,0.00009179478,0.00008215562,0.00001519053,0.00002120127,0.00002106814],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7601541,"threshold_uncertainty_score":0.3995466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035893651","doi":"10.1287/trsc.35.4.345.10433","title":"A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","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; Université de Montréal","funders":"","keywords":"Toll; Bilevel optimization; Mathematical optimization; Flow network; Revenue; Set (abstract data type); Computer science; Mathematics; Operations research; Optimization problem; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.06522803791999959,"gpt":0.3404594592474697,"spread":0.2752314213274701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001256603,0.0001900922,0.0001990593,0.0002352931,0.001572729,0.0001296422,0.0003500879,0.0001292696,0.00009105042],"category_scores_gemma":[0.00009919085,0.0002031978,0.0001046476,0.001397838,0.0004250686,0.001068959,6.013414e-7,0.0001156446,0.000008552394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001153999,"about_ca_system_score_gemma":0.0005326755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002730173,"about_ca_topic_score_gemma":0.003640463,"domain_scores_codex":[0.9974248,0.0000434425,0.0005024177,0.0005521227,0.0009053814,0.0005718303],"domain_scores_gemma":[0.9985904,0.0001732968,0.0002285658,0.0002090782,0.0005583119,0.0002404174],"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.0001492576,0.0000791216,0.00712135,0.000008830813,0.000004485377,0.000001640119,0.01114429,0.9549472,0.00003762374,0.02470089,0.0001811943,0.001624134],"study_design_scores_gemma":[0.001014532,0.00007227062,0.06224529,0.00004944994,0.00004784915,1.778844e-7,0.0007327331,0.9311576,0.00004344068,0.001935713,0.002357721,0.0003432127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09750892,0.00001264614,0.8984694,0.000839352,0.0003469333,0.0008552496,0.0001479306,0.0002880541,0.001531552],"genre_scores_gemma":[0.9062107,0.0000857717,0.091962,0.0004133514,0.0001265691,0.0001319951,0.0004815321,0.00002150403,0.000566526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8087018,"threshold_uncertainty_score":0.9997271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128178859","doi":"10.1287/trsc.1090.0265","title":"A Study of Demand Stochasticity in Service Network Design","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":199,"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":"Consolidation (business); Flexibility (engineering); A priori and a posteriori; Computer science; Service (business); Operations research; Mathematical optimization; Demand patterns; Engineering; Economics; Demand management; Business; Mathematics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.05179541063175576,"gpt":0.3351415942230508,"spread":0.2833461835912951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609157,0.00006627137,0.0001219759,0.0001509211,0.0002952075,0.00002719485,0.000228701,0.00003467933,0.00001957968],"category_scores_gemma":[0.00004536607,0.00006946458,0.00001317895,0.002591987,0.0001233435,0.0004596743,5.042502e-7,0.00006386236,0.000001931377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002773038,"about_ca_system_score_gemma":0.0002653966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001024934,"about_ca_topic_score_gemma":0.01029922,"domain_scores_codex":[0.9985497,0.00008300924,0.0003153571,0.0002195106,0.0005990903,0.0002333356],"domain_scores_gemma":[0.9993821,0.00008213895,0.0001203037,0.00009252394,0.0002464245,0.00007651907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00003644548,0.0001572689,0.03918773,0.00000199386,0.000001034357,0.000003408976,0.08418991,0.8732043,0.0001109613,0.002722492,0.000006225799,0.0003782496],"study_design_scores_gemma":[0.0005537747,0.0001546344,0.9850152,0.00002704035,0.00001246527,6.980427e-8,0.009769117,0.003734816,0.00006514914,0.0005556326,0.00001459167,0.00009755629],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8031417,0.00001076048,0.195667,0.0001977349,0.00006448223,0.0003992957,0.000001783005,0.00004171166,0.0004755517],"genre_scores_gemma":[0.994297,0.000005423585,0.005530156,0.0001190238,0.00001742048,0.000006936747,0.000004175102,0.000002378415,0.00001746885],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9458274,"threshold_uncertainty_score":0.5747205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124521189","doi":"10.1287/trsc.1060.0166","title":"Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":198,"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":"Norges Forskningsråd","keywords":"Vehicle routing problem; Heuristic; Mathematical optimization; Stochastic programming; Routing (electronic design automation); Sample (material); Dynamic programming; Problem statement; Computer science; Statement (logic); Operations research; Mathematics; Engineering; Management science","retraction":null,"screen_n_in":null,"score":{"opus":0.007078761078080346,"gpt":0.2323668125458855,"spread":0.2252880514678052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005905919,0.0001394972,0.0001408865,0.0001576289,0.0002982622,0.0001262551,0.0001249712,0.00002912455,0.000007603262],"category_scores_gemma":[0.00004705997,0.0001356131,0.00001536155,0.0008351824,0.0001935631,0.000430091,0.000003961273,0.0001191762,0.000002508216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007759711,"about_ca_system_score_gemma":0.00005781316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001524679,"about_ca_topic_score_gemma":0.0002788482,"domain_scores_codex":[0.9987832,0.00001589875,0.0002805148,0.0002930088,0.0002819829,0.0003454211],"domain_scores_gemma":[0.9995311,0.0001202508,0.00006344202,0.0001297022,0.00007771167,0.00007775576],"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.000003986832,0.000007270011,0.007552402,0.00003699177,0.000002009717,0.000002102722,0.001040803,0.9770123,0.01177953,0.000578828,0.000001161832,0.001982579],"study_design_scores_gemma":[0.0002849519,0.00001775207,0.07504816,0.0000776223,0.00001493745,0.000004652425,0.0001063486,0.9235731,0.0003967516,0.0002859611,0.000006059617,0.0001836706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4089544,0.00003767086,0.5905302,0.00001657905,0.0000275149,0.0001334894,0.000004301456,0.0002032921,0.00009258614],"genre_scores_gemma":[0.7973598,0.000002037813,0.2025623,0.000009747837,0.0000109171,0.00001244288,0.000008424914,0.00002022151,0.00001414928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3884054,"threshold_uncertainty_score":0.5530142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170216278","doi":"10.1287/trsc.35.3.286.10153","title":"Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew scheduling; Scheduling (production processes); Column generation; Mathematical optimization; Homogeneous; Computer science; Crew; Heuristic; Branch and bound; Job shop scheduling; Operations research; Engineering; Mathematics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01521100390485595,"gpt":0.2606463954007527,"spread":0.2454353914958968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006326986,0.00009943132,0.0001262238,0.0001805625,0.00008497432,0.00007321506,0.000131757,0.00004634129,0.00001025171],"category_scores_gemma":[0.00004052563,0.000109867,0.00001400907,0.001029522,0.0001030274,0.0003737138,9.638601e-7,0.0001073858,0.000004765418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004673262,"about_ca_system_score_gemma":0.00003057302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003630184,"about_ca_topic_score_gemma":0.0000291509,"domain_scores_codex":[0.9989633,0.00002232251,0.0002752762,0.0002253258,0.0002627569,0.0002510384],"domain_scores_gemma":[0.9996052,0.00009425612,0.00002545678,0.0001172649,0.00006246607,0.00009535802],"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.000003991467,0.000004379386,0.01676654,0.00002774694,0.000001298974,0.00001830896,0.001323028,0.9577813,0.02233081,0.0002412831,4.255936e-7,0.001500911],"study_design_scores_gemma":[0.0002724446,0.000009525897,0.02700888,0.00003795525,0.000004767232,0.000003824136,0.0002437881,0.970915,0.001261985,0.00002127431,0.00008975247,0.0001308662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6962373,0.0001879624,0.3028174,0.0000243184,0.000103305,0.0001089108,0.000002688703,0.0001541691,0.000363964],"genre_scores_gemma":[0.9745452,0.0000728049,0.02529477,0.00001648899,0.00001734254,0.00000672087,0.000002864756,0.00001523746,0.00002859894],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2783079,"threshold_uncertainty_score":0.4480247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130310388","doi":"10.1287/trsc.34.2.165.12303","title":"Catastrophe Avoidance Models for Hazardous Materials Route Planning","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":188,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Hazardous waste; Population; Computer science; Catastrophe theory; Network model; Function (biology); Mathematical model; Variance (accounting); Path (computing); Operations research; Mathematical optimization; Engineering; Economics; Mathematics; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.1103022939366786,"gpt":0.3918502167928551,"spread":0.2815479228561765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003127212,0.0001365255,0.0002865982,0.0002386706,0.0006087777,0.0003690656,0.001060507,0.00004283946,0.0008273362],"category_scores_gemma":[0.0001365865,0.0001055643,0.0001122389,0.001577596,0.0003451766,0.001663696,0.000003997304,0.00005654522,0.0001758691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003046735,"about_ca_system_score_gemma":0.0001819844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001192789,"about_ca_topic_score_gemma":0.00007695856,"domain_scores_codex":[0.9965402,0.00004334879,0.0007558392,0.0006952674,0.001577619,0.0003876657],"domain_scores_gemma":[0.9985337,0.0002501063,0.0001902487,0.0004968713,0.0003792408,0.0001498208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003007706,0.00005439504,0.002253332,0.000007609341,0.00001383052,0.00001308425,0.006803959,0.8255594,0.02662969,0.008128066,0.0008270954,0.1294088],"study_design_scores_gemma":[0.002778602,0.0003300425,0.2756899,0.0001094974,0.000192034,0.00001404715,0.003551766,0.2320923,0.101338,0.3481422,0.03419705,0.001564486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8025708,0.00005884828,0.1950578,0.0005795625,0.0001631778,0.0001982488,0.000290322,0.00004586595,0.00103531],"genre_scores_gemma":[0.9879175,0.00003588081,0.009767971,0.0001777622,0.00004673338,0.00003045241,0.00003711812,0.000007645377,0.001978904],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5934671,"threshold_uncertainty_score":0.9058751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150889816","doi":"10.1287/trsc.34.2.133.12308","title":"A Benders Decomposition Approach for the Locomotive and Car Assignment Problem","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lagrangian relaxation; Decomposition; Column generation; Integer programming; Benders' decomposition; Mathematical optimization; Decomposition method (queueing theory); Simplex algorithm; Context (archaeology); Linear programming relaxation; Computer science; Dynamic programming; Linear programming; Set (abstract data type); Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01422500301572305,"gpt":0.2400552185029919,"spread":0.2258302154872689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001766555,0.00005226535,0.00004517508,0.00002125847,0.0001468723,0.00003604461,0.00006943565,0.00001457469,0.00005146542],"category_scores_gemma":[0.00000114056,0.00003849234,0.00001323186,0.0001140115,0.0001415972,0.0001095183,4.994172e-7,0.00003367827,7.121093e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001656543,"about_ca_system_score_gemma":0.00001295646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001977853,"about_ca_topic_score_gemma":0.00001336445,"domain_scores_codex":[0.9995436,0.000002258969,0.00009664612,0.0001130998,0.0001290909,0.0001152902],"domain_scores_gemma":[0.9998427,0.00002558401,0.00001049824,0.00006037463,0.00002455523,0.00003628387],"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.00001332499,0.00003374598,0.0007816778,0.00008896599,0.0000150038,0.000001078409,0.003898812,0.8999333,0.001337432,0.01134859,0.0001860474,0.08236202],"study_design_scores_gemma":[0.000573401,0.00008029753,0.1062386,0.00001684894,0.0000711165,0.000004318789,0.000766823,0.8824071,0.002547268,0.001502893,0.005503691,0.0002876792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05473192,0.00009498162,0.9348927,0.00009898211,0.00004494201,0.0006292579,0.0000363676,0.00008403837,0.009386802],"genre_scores_gemma":[0.988292,0.00003748454,0.01149711,0.00002951468,0.00001047438,0.00005376846,0.00001885691,0.000004539932,0.00005620497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9335601,"threshold_uncertainty_score":0.1569672,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2524034199","doi":"10.1287/trsc.2016.0709","title":"50th Anniversary Invited Article—Future Research Directions in Stochastic Vehicle Routing","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":147,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Routing (electronic design automation); Operations research; Stochastic modelling; Service (business); Sketch; Key (lock); Stochastic process; Stochastic optimization; Mathematical optimization; Management science; Engineering; Mathematics; Marketing; Computer security; Algorithm; Computer network; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.03834316816566709,"gpt":0.3306429495440477,"spread":0.2922997813783806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001729415,0.00008924102,0.00009765093,0.0004918837,0.00021959,0.00004159773,0.0002213161,0.00005368845,0.00004066682],"category_scores_gemma":[0.0001801872,0.0000771401,0.00002172819,0.003223253,0.0002526042,0.0007140439,0.000005622318,0.0001853979,0.00002760474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001909538,"about_ca_system_score_gemma":0.00006089016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003292911,"about_ca_topic_score_gemma":0.0001046985,"domain_scores_codex":[0.9984684,0.00007316053,0.0002578185,0.0002789507,0.0004978495,0.0004238411],"domain_scores_gemma":[0.9992527,0.0002156643,0.00002615646,0.000193676,0.0001968655,0.0001149047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00002447883,0.00005806996,0.04491832,0.0000200608,0.000007631355,0.00001455484,0.007994147,0.4583557,0.4312591,0.002255878,0.00008969058,0.05500237],"study_design_scores_gemma":[0.0008651707,0.00003024958,0.7214192,0.0001301673,0.000006701026,0.000002011177,0.001250325,0.2550168,0.02026711,0.0004085334,0.0003168437,0.0002869162],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8760771,0.0000480832,0.1222463,0.0006763124,0.0002199824,0.0001524684,0.000009086029,0.0002696825,0.0003010057],"genre_scores_gemma":[0.9931231,0.00002821078,0.006694063,0.00002859015,0.00005070685,0.00001341239,0.000001836416,0.0000165251,0.00004358294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6765008,"threshold_uncertainty_score":0.3145682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120324231","doi":"10.1287/trsc.1100.0317","title":"A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":137,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Liquefied natural gas; Column generation; Operations research; Variable (mathematics); Routing (electronic design automation); Branch and price; Inventory theory; Natural gas; Computer science; Engineering; Integer programming; Waste management; Inventory control; Mathematical optimization; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01463907020419531,"gpt":0.30146552957012,"spread":0.2868264593659247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001675194,0.0001145152,0.00012609,0.0001377073,0.0001794294,0.00006855739,0.0001904454,0.00005637396,0.0000119037],"category_scores_gemma":[0.0001494026,0.0001168823,0.00003652988,0.0005923208,0.0001112281,0.0004331852,0.000003580624,0.0002194395,0.000001679982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002282819,"about_ca_system_score_gemma":0.00006859994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001695929,"about_ca_topic_score_gemma":0.00007221307,"domain_scores_codex":[0.9989399,0.00001906516,0.0002657166,0.0002681946,0.0002286682,0.0002785101],"domain_scores_gemma":[0.999392,0.0001449633,0.00005904526,0.0001428177,0.0001584173,0.0001027994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001943881,0.0000174094,0.005321206,0.0001916754,0.00001351184,0.000001035975,0.007656401,0.08667129,0.8380628,0.02357883,0.00002984733,0.03843652],"study_design_scores_gemma":[0.0004533272,0.00001634264,0.02012679,0.00002308569,0.00001656031,0.000004569186,0.00006849939,0.9366684,0.04075123,0.001261491,0.0003771934,0.0002325324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3658668,0.00002008,0.6328875,0.0000987526,0.0002694143,0.0002473509,0.000004105108,0.0002491658,0.0003568637],"genre_scores_gemma":[0.5633854,0.000002921018,0.4364673,0.00004788545,0.00002453235,0.00002726321,0.000004133325,0.00001288968,0.00002767516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8499971,"threshold_uncertainty_score":0.4766321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1832376799","doi":"10.1287/trsc.2015.0635","title":"A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Branch and cut; Benchmark (surveying); Routing (electronic design automation); Mathematical optimization; Branch and price; Computer science; Vehicle routing problem; Set (abstract data type); State (computer science); Algorithm; Operations research; Integer programming; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0419161086913205,"gpt":0.2980385804930498,"spread":0.2561224718017293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551005,0.00008313928,0.0000818292,0.00006599062,0.0001799866,0.00007186536,0.0001941904,0.00002785454,0.000004372064],"category_scores_gemma":[0.00006691457,0.00006704798,0.00002245126,0.000572955,0.0001506016,0.0003300714,0.000003287098,0.00007045136,0.000003192725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004066608,"about_ca_system_score_gemma":0.00007661812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001379469,"about_ca_topic_score_gemma":0.00001178941,"domain_scores_codex":[0.9991134,0.0000127147,0.0002032779,0.0001722531,0.0002812238,0.0002171628],"domain_scores_gemma":[0.9994648,0.00009611018,0.00004162493,0.0001255482,0.0001651586,0.0001067806],"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.000006618925,0.00001597864,0.004206785,0.00006220444,0.00001951975,9.763939e-7,0.01579253,0.6754132,0.00321185,0.005857509,0.0002354219,0.2951774],"study_design_scores_gemma":[0.0003388827,0.00001455886,0.004133115,0.00001286429,0.00001354683,0.000001514479,0.0002679592,0.991372,0.001910071,0.0007523007,0.001073106,0.0001100482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02454681,0.0001007085,0.9740245,0.0001389152,0.0002145418,0.0003017112,0.000007408256,0.0001986339,0.0004667279],"genre_scores_gemma":[0.6549415,0.0000132234,0.3448056,0.00006546065,0.000043739,0.00004826787,0.000004095212,0.00001605421,0.00006208447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6303947,"threshold_uncertainty_score":0.2734137,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023445393","doi":"10.1287/trsc.1030.0086","title":"Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministerio de Ciencia y Tecnología; Canada Research Chairs","keywords":"Travelling salesman problem; Pickup; Heuristics; Traveling purchaser problem; Mathematical optimization; Heuristic; Product (mathematics); Computer science; Greedy algorithm; 2-opt; Vehicle routing problem; Commodity; Mathematics; Operations research; Routing (electronic design automation); Economics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03870615525915687,"gpt":0.2777857777228835,"spread":0.2390796224637266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007643418,0.00008659843,0.00008892392,0.00004752437,0.0003061781,0.00006064938,0.0001980217,0.00003213076,0.000003905792],"category_scores_gemma":[0.00003875691,0.00007584882,0.00002666514,0.0003709302,0.0001914026,0.0002208274,0.000002425175,0.0000945494,0.000002099471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004370357,"about_ca_system_score_gemma":0.00006698161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001940325,"about_ca_topic_score_gemma":0.00005246175,"domain_scores_codex":[0.9991707,0.000007581678,0.0002215447,0.0001742379,0.0002300202,0.0001959373],"domain_scores_gemma":[0.9995083,0.0001403622,0.00003564102,0.0001400246,0.000115914,0.00005981568],"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.000003827879,0.000008951968,0.0005496281,0.0000431767,0.000004995566,3.010622e-7,0.001892517,0.9817227,0.00414628,0.006998509,0.000004364532,0.00462481],"study_design_scores_gemma":[0.001565222,0.00006959094,0.1625255,0.0001041815,0.0001129801,0.00000422445,0.000493119,0.7989179,0.02636436,0.008659879,0.0006633278,0.000519663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2177409,0.00005179268,0.7814001,0.0001774921,0.0001107029,0.0002378804,0.0000177541,0.0001493782,0.0001140653],"genre_scores_gemma":[0.7581933,0.00004827248,0.2416493,0.00004179712,0.00002361908,0.00001868137,0.000006322146,0.00001148584,0.000007167987],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5404525,"threshold_uncertainty_score":0.3093025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114217004","doi":"10.1287/trsc.1090.0290","title":"An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":127,"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":"Arc routing; Vehicle routing problem; Mathematical optimization; Computer science; Neighbourhood (mathematics); Heuristic; Routing (electronic design automation); Arc (geometry); Context (archaeology); Mathematics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.02389590442027428,"gpt":0.2914730769878286,"spread":0.2675771725675543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001304895,0.0001411256,0.0001279855,0.0001172118,0.0004731537,0.00009749724,0.0003097841,0.00003438324,0.00001351288],"category_scores_gemma":[0.00004212,0.000104504,0.00002622319,0.001050925,0.0001458401,0.000446797,0.000001181684,0.0001550252,0.000002056317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004915846,"about_ca_system_score_gemma":0.0001035539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001045139,"about_ca_topic_score_gemma":0.00004127217,"domain_scores_codex":[0.9985729,0.00002886201,0.0002490011,0.0002830715,0.0004195754,0.0004465978],"domain_scores_gemma":[0.999125,0.000199972,0.00005003024,0.0002144764,0.0002933861,0.0001171552],"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.00003206249,0.00002099661,0.000228886,0.0000100437,0.000006554916,9.940894e-7,0.004561128,0.9843597,0.002291511,0.005383502,0.000001513205,0.003103112],"study_design_scores_gemma":[0.0004927304,0.000234992,0.04416442,0.00003224014,0.0000290821,0.00000231773,0.0009517677,0.9525621,0.001105359,0.0002655899,0.000002207985,0.0001571774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1422912,0.00001784499,0.8567044,0.00007490492,0.00004131172,0.0004694453,0.00002747077,0.0002313795,0.0001420442],"genre_scores_gemma":[0.8869116,0.000001589113,0.1129402,0.00004880869,0.00002466714,0.00002913492,0.00001526075,0.0000185566,0.00001012796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7446204,"threshold_uncertainty_score":0.4261549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886343885","doi":"10.1287/trsc.2018.0844","title":"Branch-and-Price–Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; TKI DINALOG; Université de Montréal","keywords":"Vehicle routing problem; Path (computing); Set (abstract data type); Column generation; Computer science; Routing (electronic design automation); Mathematical optimization; Algorithm; Operations research; Engineering; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02525336733336839,"gpt":0.2377814720255807,"spread":0.2125281046922123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003893833,0.0001225065,0.0001060188,0.00005631692,0.0003071614,0.00005624993,0.0002046825,0.00002920428,0.00002900103],"category_scores_gemma":[0.000006019693,0.0000841838,0.0000251519,0.0004920255,0.0005449151,0.0002258668,0.000001034991,0.00008169464,0.00001250693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002317915,"about_ca_system_score_gemma":0.00006316632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002421579,"about_ca_topic_score_gemma":0.0001011007,"domain_scores_codex":[0.9990247,0.000003717172,0.0001892821,0.00022689,0.0002658844,0.0002895512],"domain_scores_gemma":[0.9995013,0.00008918699,0.00003503277,0.0001611344,0.0001370844,0.0000762023],"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.0005311004,0.0002473297,0.08158546,0.000661226,0.0002121033,0.00003030911,0.02185524,0.3997963,0.3597118,0.03377481,0.0005331617,0.1010612],"study_design_scores_gemma":[0.001235356,0.0001566105,0.09390707,0.00004562699,0.00006541225,0.000001588231,0.000053067,0.8757302,0.02691402,0.0002854243,0.001319055,0.0002865805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1465338,0.00005937476,0.8510736,0.0001238037,0.0001069538,0.0004928925,0.00003931077,0.0002400432,0.001330244],"genre_scores_gemma":[0.9814378,0.000003534835,0.01825877,0.00009410491,0.00006978404,0.00003502311,0.00001319807,0.00001885277,0.00006893539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.834904,"threshold_uncertainty_score":0.3432916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001478667","doi":"10.1287/trsc.2014.0533","title":"Scheduling Twin Yard Cranes in a Container Block","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":123,"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; Block (permutation group theory); Scheduling (production processes); Computer science; Container (type theory); Heuristic; Yard; Mathematical optimization; Truck; Travelling salesman problem; Job shop scheduling; Stacking; Schedule; Engineering; Algorithm; Mathematics; Automotive engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01053360702691465,"gpt":0.2270025886966646,"spread":0.21646898166975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003559174,0.00006567804,0.00008664739,0.0001060503,0.00003996311,0.00002899404,0.0001142035,0.00002441352,0.00005794489],"category_scores_gemma":[0.00003068413,0.00006336147,0.0000153436,0.0003374773,0.00010002,0.000145519,0.000001024735,0.00007005174,0.00001206313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001532078,"about_ca_system_score_gemma":0.00002063679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007827198,"about_ca_topic_score_gemma":0.0004072588,"domain_scores_codex":[0.9993178,0.000004140389,0.0001820975,0.0001315561,0.0001858305,0.0001785685],"domain_scores_gemma":[0.9997644,0.00002665618,0.00001500831,0.00009748464,0.00004130314,0.00005512058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.000007386526,0.00002893654,0.07170323,0.00009901835,0.000003339112,0.00001908845,0.001996485,0.8846431,0.0156799,0.01762286,0.00006104596,0.008135663],"study_design_scores_gemma":[0.0004560246,0.00002272639,0.6786185,0.00004294514,0.00000825831,0.000002119773,0.0001351442,0.3118376,0.003157745,0.000876195,0.004573625,0.0002691115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9606985,0.00002750427,0.032747,0.00006995557,0.000167537,0.0000713508,0.00000330851,0.0001143967,0.006100392],"genre_scores_gemma":[0.9972559,0.000006779259,0.002589844,0.00005833509,0.0000246447,0.000005476256,0.000004234339,0.000006524291,0.00004831413],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6069153,"threshold_uncertainty_score":0.2583806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010359686","doi":"10.1287/trsc.1110.0387","title":"Robust Inventory Routing Under Demand Uncertainty","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":122,"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":"Robust optimization; Mathematical optimization; Time horizon; Interval (graph theory); Routing (electronic design automation); Operations research; Computer science; Inventory theory; Product (mathematics); Integer programming; Inventory control; Set (abstract data type); Holding cost; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0778347292160422,"gpt":0.2723011943071366,"spread":0.1944664650910944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008262208,0.00009805663,0.00009089176,0.0001266565,0.000146481,0.00002795226,0.0002237921,0.00003941494,0.0001428591],"category_scores_gemma":[0.00002686021,0.0001018404,0.00002834685,0.0007537685,0.0001800295,0.0004345997,0.000002749694,0.00009560677,0.00001865103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006229501,"about_ca_system_score_gemma":0.00005718446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003646887,"about_ca_topic_score_gemma":0.00004239491,"domain_scores_codex":[0.9989951,0.00001965154,0.000243394,0.0002071246,0.0002809049,0.0002538711],"domain_scores_gemma":[0.9995698,0.00002243425,0.00004083395,0.0001657416,0.00009654948,0.0001046085],"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.000002140962,0.000007250922,0.009901885,0.00001059869,0.000003526776,0.000001329899,0.003003543,0.9797788,0.002620036,0.003932092,0.00001084822,0.0007279306],"study_design_scores_gemma":[0.0002621161,0.0000136958,0.2096509,0.00002576973,0.00001644008,0.000001602527,0.000600344,0.7781336,0.01033621,0.0006601146,0.00004521861,0.000254022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4180298,0.0000194526,0.5769064,0.000009153612,0.0002104742,0.00007105326,0.00000216836,0.0002969288,0.004454587],"genre_scores_gemma":[0.9336215,0.000007801909,0.06623831,0.00005078155,0.00001624951,0.000005620054,0.00000438095,0.00001482016,0.00004049443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5155917,"threshold_uncertainty_score":0.415293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089938056","doi":"10.1287/trsc.35.3.238.10152","title":"A Modeling Framework for Passenger Assignment on a Transport Network with Timetables","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":121,"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","funders":"","keywords":"Computer science; FIFO (computing and electronics); Mathematical optimization; Flow network; Graph; Travel time; Graph theory; Operations research; Transport engineering; Engineering; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03983165338560238,"gpt":0.3230617755105982,"spread":0.2832301221249958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115766,0.0001546803,0.0001737846,0.0001398316,0.00120245,0.00008370382,0.0002623966,0.00009089235,0.0001124019],"category_scores_gemma":[0.00003795248,0.0001370589,0.00006201145,0.001376298,0.0003050346,0.0005868076,4.321834e-7,0.0001221681,0.0000078883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006567742,"about_ca_system_score_gemma":0.0004124865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002960456,"about_ca_topic_score_gemma":0.002959132,"domain_scores_codex":[0.9976872,0.0000293697,0.0003138474,0.0004632612,0.0009658864,0.0005404135],"domain_scores_gemma":[0.9990787,0.0001511694,0.000100272,0.0001719613,0.0002982066,0.0001997152],"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.0001819356,0.00005282446,0.01430919,0.000006270963,0.000008810323,0.000005078407,0.007678633,0.8583484,0.00002268905,0.1185248,0.00001827769,0.0008431534],"study_design_scores_gemma":[0.007415208,0.002074786,0.3684308,0.001934045,0.0008680411,0.000005953842,0.03012802,0.4349403,0.0007197956,0.07963564,0.06949161,0.004355783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1697389,0.00002517379,0.8263348,0.0008040697,0.0001764592,0.0005034705,0.00001648225,0.0001700063,0.002230647],"genre_scores_gemma":[0.9453878,0.00006753948,0.05357649,0.0003148917,0.0001386396,0.0001015901,0.00006597215,0.00001759641,0.0003294612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7756489,"threshold_uncertainty_score":0.9248398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2806571857","doi":"10.1287/trsc.2018.0822","title":"Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":120,"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":"Column generation; Yard; Heuristic; Computer science; Container (type theory); Mathematical optimization; Integer programming; Dual (grammatical number); Integer (computer science); Assignment problem; Branch and price; Key (lock); Linear programming; Operations research; Algorithm; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02673421821792907,"gpt":0.2523975719556721,"spread":0.225663353737743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004989147,0.00008694082,0.00007243388,0.00004244653,0.0002996069,0.0001030532,0.0001166652,0.00002940979,0.00008789295],"category_scores_gemma":[0.00001956518,0.00006475827,0.00001451032,0.0002435656,0.0003065148,0.0001876611,0.00000165776,0.00004503659,0.000003465126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003904203,"about_ca_system_score_gemma":0.00005927046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006132211,"about_ca_topic_score_gemma":0.0007205617,"domain_scores_codex":[0.9991875,0.000006452066,0.0002190968,0.0001872384,0.0002346746,0.0001650708],"domain_scores_gemma":[0.9995296,0.0000440589,0.000040345,0.0001266342,0.0002021067,0.00005726002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007523011,0.0001975233,0.01476208,0.0003072259,0.0001317155,0.000003949609,0.01553127,0.148033,0.5783652,0.05705605,0.02361746,0.1619193],"study_design_scores_gemma":[0.0006950609,0.0002320417,0.06806067,0.00003343496,0.00008747508,0.000002340831,0.0004145893,0.8410587,0.04748355,0.0007285972,0.04081514,0.0003883792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05402637,0.00006420742,0.9438466,0.0003695483,0.0002974491,0.0005860602,0.00004007377,0.00008935328,0.0006803432],"genre_scores_gemma":[0.9928635,0.00004389933,0.006499097,0.00009203957,0.00008132715,0.00009709007,0.00005862028,0.000009130044,0.000255279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9388372,"threshold_uncertainty_score":0.2640766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142169698","doi":"10.1287/trsc.2014.0525","title":"Service Network Design with Resource Constraints","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Infrastructure Canada; Compute Canada","keywords":"Column generation; Solver; Benchmark (surveying); Heuristic; Network planning and design; Computer science; Service (business); Consolidation (business); Quality of service; Operations research; Mathematical optimization; Computer network; Engineering; Business; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02109923420486267,"gpt":0.2463486574531667,"spread":0.225249423248304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146005,0.00008912999,0.00008882144,0.00005725257,0.0001361982,0.00004368006,0.000201533,0.00002794958,0.00004251679],"category_scores_gemma":[0.0000217092,0.00008254968,0.000009757438,0.001210272,0.0001962694,0.0002189255,0.000001245841,0.00007757734,0.00001633717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001930523,"about_ca_system_score_gemma":0.00004412231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000364871,"about_ca_topic_score_gemma":0.00001625636,"domain_scores_codex":[0.9990802,0.00003781524,0.0001587991,0.000182341,0.0002945513,0.0002463025],"domain_scores_gemma":[0.9994856,0.0001077049,0.00003261075,0.0001690385,0.0001113709,0.00009367211],"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.000004251299,0.000002021401,0.0007648841,0.00000951937,0.000001942657,5.756354e-7,0.0004575822,0.9915117,0.001043911,0.0008559976,0.00004389681,0.005303719],"study_design_scores_gemma":[0.0003341243,0.00003067131,0.02631764,0.00004297202,0.00001309605,0.000003615636,0.0001097123,0.9675389,0.004051827,0.0001605689,0.0011844,0.0002124572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04155078,0.000006407105,0.9554045,0.00006724775,0.0000588303,0.0001054935,0.000001357379,0.0003235554,0.002481837],"genre_scores_gemma":[0.6329598,9.921453e-7,0.3668183,0.0001692273,0.00002251877,0.000004879613,0.00000323474,0.00001154025,0.000009492124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.591409,"threshold_uncertainty_score":0.3366278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989947400","doi":"10.1287/trsc.2021.1111","title":"The Electric Vehicle Routing Problem with Capacitated Charging Stations","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Vehicle routing problem; Iterated local search; Routing (electronic design automation); Electric vehicle; Mathematical optimization; Set (abstract data type); Generator (circuit theory); Computer science; Charging station; Iterated function; Local search (optimization); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01335210345303599,"gpt":0.2486815788830525,"spread":0.2353294754300164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007071841,0.00009325932,0.00007807461,0.00007909479,0.0006430399,0.0001629833,0.000167017,0.00002073213,0.00001720477],"category_scores_gemma":[0.00006097506,0.00007407751,0.00001829542,0.002718943,0.0001113608,0.0004057897,0.000001879224,0.0001376533,0.000007504164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006567864,"about_ca_system_score_gemma":0.0001967886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009002841,"about_ca_topic_score_gemma":0.00007516341,"domain_scores_codex":[0.9988089,0.00003407327,0.0002361509,0.0002071184,0.0003844322,0.000329297],"domain_scores_gemma":[0.9992145,0.0001389692,0.0000491371,0.0001756351,0.0003502588,0.00007147167],"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.000004002458,0.000009920927,0.00404149,0.00001732855,0.00001201583,0.000007758044,0.003515372,0.8421325,0.133791,0.009887277,0.00001571679,0.006565583],"study_design_scores_gemma":[0.0003599084,0.00001966538,0.06332941,0.00003852414,0.0000210363,0.000007650855,0.001114401,0.8335217,0.1007476,0.0003278385,0.0002707282,0.0002415532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6000351,0.0000850372,0.3965459,0.0002713735,0.0000944757,0.0001582416,0.000005762701,0.0003928569,0.00241133],"genre_scores_gemma":[0.9490362,0.00002905078,0.05074094,0.00003095925,0.00001145476,0.00001904738,0.00001046382,0.00001800736,0.0001038404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3490012,"threshold_uncertainty_score":0.4945808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2468943938","doi":"10.1287/trsc.2015.0659","title":"Predicting the Potential Market for Electric Vehicles","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Transport Canada","funders":"","keywords":"Market share; Market penetration; Demand forecasting; Econometrics; Economics; Market share analysis; Product (mathematics); Supply and demand; New product development; Microeconomics; Industrial organization; Computer science; Operations research; Marketing; Business; Market microstructure; Order (exchange); Engineering; Operations management; Mathematics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.06016170162792984,"gpt":0.3409432967948951,"spread":0.2807815951669653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006180657,0.00008396616,0.00009914644,0.0003072758,0.0008132234,0.0002094664,0.0008499732,0.00003063435,0.000398852],"category_scores_gemma":[0.002269422,0.00003842899,0.00007146455,0.002542156,0.0003179993,0.0007037886,0.000008936928,0.00005140077,0.00004084529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002425498,"about_ca_system_score_gemma":0.0001799774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005865892,"about_ca_topic_score_gemma":0.00001553643,"domain_scores_codex":[0.9971193,0.00003733336,0.0005684942,0.0004131244,0.001552157,0.0003095683],"domain_scores_gemma":[0.9974781,0.0009398472,0.0002716627,0.0002900439,0.0009542084,0.00006610429],"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.0001094997,0.00003407413,0.04428736,0.000003459878,0.000004234863,0.000001702993,0.001114793,0.0001009559,0.4263496,0.03017464,0.004378828,0.4934408],"study_design_scores_gemma":[0.0008633179,0.0000788925,0.8934613,0.00002270567,0.00001164521,0.0000056063,0.0008823879,0.03967404,0.02259244,0.03266444,0.009544387,0.0001988196],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8417221,0.00000970287,0.1521615,0.003109758,0.0003839976,0.0002558618,0.00002334008,0.00005013316,0.002283573],"genre_scores_gemma":[0.9961702,0.000003046861,0.0008589402,0.0003503665,0.00008160825,0.00002429655,0.000001011586,0.000005488066,0.002505066],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.849174,"threshold_uncertainty_score":0.6254739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1876351940","doi":"10.1287/trsc.2014.0581","title":"Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":107,"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":"Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Probability distribution; Set (abstract data type); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08101912272087147,"gpt":0.2989574792719695,"spread":0.217938356551098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006124677,0.00008003444,0.0000924327,0.00006952761,0.0001017001,0.00005793637,0.00006323298,0.00002303554,5.204721e-7],"category_scores_gemma":[0.00003821332,0.00007243631,0.000006296586,0.0003092571,0.0001375158,0.0005017748,0.000002054051,0.0000411855,2.078521e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000172926,"about_ca_system_score_gemma":0.00004431998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001055473,"about_ca_topic_score_gemma":0.00001628359,"domain_scores_codex":[0.9993227,0.000006515533,0.0001364771,0.0001856921,0.0001847328,0.000163917],"domain_scores_gemma":[0.9995535,0.00006243079,0.00002704461,0.00007001981,0.0001650619,0.0001219633],"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.000005962385,0.000002221851,0.0005309915,0.00001391725,0.000001828313,3.044196e-7,0.001468997,0.9941004,0.000339338,0.0006636663,0.000001571583,0.002870826],"study_design_scores_gemma":[0.0004568892,0.00003086339,0.003409758,0.00001797631,0.00001158168,0.00000263508,0.0003232914,0.9948269,0.0004501942,0.0003638761,0.000002841366,0.0001032156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3230946,0.0000425807,0.6765633,0.00002974313,0.00003207725,0.0001154449,0.000005383373,0.00008463965,0.00003216281],"genre_scores_gemma":[0.6890135,0.000002576161,0.3109294,0.00001139694,0.0000115993,0.00001075287,0.000002845515,0.00001008716,0.000007886822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3659188,"threshold_uncertainty_score":0.2953867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167917756","doi":"10.1287/trsc.1070.0217","title":"An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":107,"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","funders":"Norges Forskningsråd","keywords":"Metaheuristic; Vehicle routing problem; Simulated annealing; Mathematical optimization; Computer science; Benchmark (surveying); Integer programming; Local search (optimization); Heuristics; Heuristic; Integer (computer science); Routing (electronic design automation); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01505666634643012,"gpt":0.2684418700792295,"spread":0.2533852037327994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009996586,0.0001578458,0.0001704112,0.00006543877,0.0006233499,0.0000684314,0.0002033777,0.00003539863,0.000005235608],"category_scores_gemma":[0.0001650177,0.0001191592,0.00002538541,0.0005160152,0.0003880107,0.0004192572,0.00000258731,0.000103149,0.000002070742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003137597,"about_ca_system_score_gemma":0.00005318109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001727115,"about_ca_topic_score_gemma":0.00001806574,"domain_scores_codex":[0.9987875,0.00004575873,0.0002586186,0.0003220431,0.0002870018,0.0002991164],"domain_scores_gemma":[0.9983896,0.001067591,0.00007190104,0.0001984842,0.0001643884,0.00010804],"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.00004250196,0.00001394063,0.006539883,0.00005787425,0.00001677338,0.000007572212,0.005356669,0.9508954,0.03062901,0.00007742467,0.000002142544,0.006360834],"study_design_scores_gemma":[0.0005045591,0.0001026643,0.1596775,0.00002974769,0.00005118865,0.00001075483,0.0001020922,0.8351968,0.004120089,0.0000249035,0.00001541804,0.0001642667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6718024,0.00002895608,0.3271849,0.00002129772,0.00004046094,0.0006768469,0.00001748628,0.0001844943,0.00004307114],"genre_scores_gemma":[0.8566129,0.00000620084,0.1431878,0.00002837672,0.00002391881,0.00009335513,0.00000594104,0.00002619924,0.00001530249],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1848105,"threshold_uncertainty_score":0.485917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160968569","doi":"10.1287/trsc.1100.0326","title":"The Dynamic Uncapacitated Hub Location Problem","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"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":"Lagrangian relaxation; Mathematical optimization; Lagrangian; Reduction (mathematics); Set (abstract data type); Exploit; Relaxation (psychology); Upper and lower bounds; Tree (set theory); Function (biology); Computer science; Branch and bound; Mathematics; Applied mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.008700321292497787,"gpt":0.263498863399777,"spread":0.2547985421072791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009611094,0.00007433932,0.0000504626,0.00007298324,0.0003302209,0.00009189219,0.00027259,0.0000346644,0.00001651391],"category_scores_gemma":[0.00006389643,0.00005941708,0.00001501797,0.001236921,0.0002891686,0.0003469442,0.00000132975,0.0001700399,0.00002390119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002626371,"about_ca_system_score_gemma":0.00006965539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006457593,"about_ca_topic_score_gemma":0.0002076092,"domain_scores_codex":[0.99914,0.00001184097,0.0002082708,0.0001477025,0.0002906174,0.0002015773],"domain_scores_gemma":[0.9993953,0.00007026151,0.00003690429,0.0002050997,0.0002322987,0.00006016427],"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.00000329612,0.000008824373,0.001491014,0.00002216327,0.000004444311,5.663792e-7,0.001805827,0.6694593,0.2897162,0.01010852,0.00003444168,0.02734535],"study_design_scores_gemma":[0.0001682628,0.000009783476,0.1112319,0.000009992335,0.000007847961,0.00000182736,0.0001567622,0.8708845,0.01510416,0.001157851,0.001099182,0.0001679009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.596822,0.00001950497,0.4001324,0.0002065487,0.0005509635,0.0001917682,0.000003559404,0.0004303119,0.001642984],"genre_scores_gemma":[0.9357206,0.00001116416,0.06412217,0.00001575577,0.000009718112,0.00001623819,0.000007858237,0.00001189904,0.00008460102],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3388986,"threshold_uncertainty_score":0.2539825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118493070","doi":"10.1287/trsc.1100.0333","title":"Branch and Price for Service Network Design with Asset Management Constraints","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd; Université de Montréal","keywords":"Column generation; Transshipment (information security); Network planning and design; Integer programming; Computer science; Mathematical optimization; Flow network; Service (business); Operations research; Path (computing); Integer (computer science); Branch and price; Shortest path problem; Engineering; Computer network; Economics; Mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01866279634969389,"gpt":0.2654168289073473,"spread":0.2467540325576534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008165037,0.0000796364,0.00007284887,0.00005250269,0.0001293953,0.00005339842,0.0001250479,0.00002713182,0.00001558327],"category_scores_gemma":[0.000008294082,0.00007527017,0.000007261023,0.0006383623,0.0001367173,0.0002444319,0.000001512273,0.00007087333,0.000001499592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000799063,"about_ca_system_score_gemma":0.00002793405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001278459,"about_ca_topic_score_gemma":0.00001804291,"domain_scores_codex":[0.9992946,0.000007706424,0.0001299912,0.0001833302,0.0001743329,0.0002100773],"domain_scores_gemma":[0.9995881,0.00008134823,0.00002860598,0.0001145817,0.000112319,0.00007505435],"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.00001094762,0.000005283304,0.002535826,0.00008036677,0.000008399174,0.000001004044,0.0004683039,0.9769722,0.006804627,0.004428421,0.0000236609,0.008660912],"study_design_scores_gemma":[0.001187247,0.00004854739,0.2822239,0.00005821504,0.0000526138,0.00000942902,0.0001242306,0.7078208,0.006314466,0.0010878,0.000667876,0.0004049588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.139117,0.000004381867,0.8596891,0.00005083644,0.0001195074,0.0003272707,0.000005574514,0.0001251284,0.0005612897],"genre_scores_gemma":[0.5239498,0.00000301,0.4759408,0.00005418114,0.00001111535,0.00002095244,0.000003600986,0.000007666361,0.000008867524],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3848329,"threshold_uncertainty_score":0.3069429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005562592","doi":"10.1287/trsc.1080.0236","title":"Toll Policies for Mitigating Hazardous Materials Transport Risk","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Toll; Hazardous waste; Transport engineering; Flow network; Computer science; Business; Risk analysis (engineering); Operations research; Engineering; Mathematical optimization; Waste management","retraction":null,"screen_n_in":null,"score":{"opus":0.09910634419173589,"gpt":0.3799160839008588,"spread":0.2808097397091229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004639026,0.0001777046,0.000413915,0.0004777888,0.001424334,0.0001250224,0.001019041,0.00006287646,0.0003459512],"category_scores_gemma":[0.0008042472,0.0001372966,0.0002353551,0.002287531,0.001026732,0.001060501,0.000004464928,0.00008085394,0.00007491645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000021379,"about_ca_system_score_gemma":0.000296915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006639122,"about_ca_topic_score_gemma":0.0006601328,"domain_scores_codex":[0.9955179,0.0000686635,0.001126281,0.0007279684,0.002089115,0.0004700881],"domain_scores_gemma":[0.9974945,0.0005894636,0.0004691881,0.0005183451,0.0007255826,0.0002029511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0003706321,0.0002529344,0.673913,0.00003442566,0.00007745679,0.00006544788,0.0543061,0.02245031,0.1755831,0.02241238,0.00151948,0.04901472],"study_design_scores_gemma":[0.0005543317,0.00007503008,0.9149374,0.00001066296,0.00005954742,0.000007952522,0.001699131,0.0008489157,0.06540822,0.01143398,0.004655718,0.0003090945],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9437277,0.00003361775,0.05368286,0.0007209337,0.0002837883,0.0002667009,0.000377933,0.00006819648,0.0008382201],"genre_scores_gemma":[0.9891894,0.0001449386,0.009605055,0.0001660715,0.00007881194,0.00003393125,0.00002666825,0.00001078119,0.0007443131],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2410244,"threshold_uncertainty_score":0.9998757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138868522","doi":"10.1287/trsc.2013.0477","title":"Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment","year":2013,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle emissions and performance","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Université de Montréal","funders":"","keywords":"Transport engineering; European union; Truck; Service (business); Engineering; Business; Operations research; Risk analysis (engineering); International trade; Marketing; Automotive engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01241733130484501,"gpt":0.2614500720696989,"spread":0.2490327407648539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001811361,0.00008193625,0.00008859259,0.0002404048,0.00005543323,0.00002038042,0.000259822,0.00003523692,0.0006021512],"category_scores_gemma":[0.000002184774,0.00008160384,0.00001986128,0.0009169917,0.00006342983,0.001024446,8.634771e-7,0.00007436775,0.000003923046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004471634,"about_ca_system_score_gemma":0.0001183532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003125808,"about_ca_topic_score_gemma":0.0003136103,"domain_scores_codex":[0.999042,0.000006008645,0.0003122061,0.0001547713,0.0003435281,0.0001414782],"domain_scores_gemma":[0.9994853,0.00001182513,0.00004535838,0.0001614706,0.0002130839,0.00008292986],"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.000001514609,0.00003126692,0.05647891,0.00001272158,0.000001457682,3.482158e-7,0.0005075657,0.9363115,0.005375164,0.0001460142,0.000003648819,0.001129825],"study_design_scores_gemma":[0.0001482748,0.000006125201,0.4662707,0.00001804682,0.000001737645,9.220955e-8,0.000070509,0.5321886,0.001217089,0.00001455192,0.00001031793,0.00005399471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9508173,0.000005863686,0.04678472,0.0002494193,0.0001430467,0.0001589944,0.00002878471,0.00006695169,0.001744876],"genre_scores_gemma":[0.9806404,0.00000793353,0.01910345,0.00006245494,0.00001154176,0.00002986338,0.0001255257,0.000008951457,0.000009922995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4097917,"threshold_uncertainty_score":0.6593133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106541949","doi":"10.1287/trsc.37.1.1.12822","title":"Models and Methods for Merge-in-Transit Operations","year":2003,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"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":"Heuristics; Mathematical optimization; Rounding; Integer programming; Merge (version control); Linear programming; Cutting-plane method; Computer science; Piecewise linear function; Branch and bound; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0382183339225108,"gpt":0.3652933841581758,"spread":0.327075050235665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130138,0.00007375949,0.00009635251,0.0001449917,0.0001068842,0.00003685306,0.00007845369,0.0000307191,0.00001245588],"category_scores_gemma":[0.00005870279,0.00007957116,0.00001730323,0.0006409538,0.00007814565,0.0005103981,4.872795e-7,0.00005030125,5.001692e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002168547,"about_ca_system_score_gemma":0.00004540704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000672948,"about_ca_topic_score_gemma":0.00004858137,"domain_scores_codex":[0.9992991,0.00003318318,0.0002113918,0.0001842144,0.00009888987,0.0001732398],"domain_scores_gemma":[0.9996757,0.00007619391,0.00000946019,0.00009707337,0.00007950328,0.00006205485],"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":[9.104475e-7,0.000004017404,0.0001573126,0.00001278573,0.00000124766,1.212358e-7,0.001199564,0.9515331,0.01680601,0.02695134,0.000001196471,0.003332376],"study_design_scores_gemma":[0.0002500399,0.000007146253,0.002154915,0.000006703304,0.00000666404,7.262161e-7,0.0001033384,0.9761643,0.01888955,0.002123709,0.0001852094,0.0001076349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05683659,0.000105942,0.9419506,0.00003525378,0.0001081681,0.0002039221,0.000005092504,0.00008271943,0.0006716806],"genre_scores_gemma":[0.4731925,0.00002453013,0.5267179,0.00001654738,0.000002075534,0.00002289957,0.000002089168,0.000007055757,0.00001436028],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4163559,"threshold_uncertainty_score":0.3244818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158354221","doi":"10.1287/trsc.1100.0363","title":"Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"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; Université Laval","funders":"","keywords":"Vehicle routing problem; Column generation; Tabu search; Mathematical optimization; Routing (electronic design automation); Path (computing); Computer science; Branch and cut; Mathematics; Integer programming; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01725819034614307,"gpt":0.2402429470521979,"spread":0.2229847567060548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003709662,0.00008732756,0.0001000916,0.0000572287,0.0001559087,0.00004392893,0.00005628752,0.00002612907,0.00000938379],"category_scores_gemma":[0.00002280682,0.00008215477,0.000006273922,0.0002485544,0.0002225432,0.000486713,0.000002932595,0.0000417478,6.232013e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008601941,"about_ca_system_score_gemma":0.00001948036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000011012,"about_ca_topic_score_gemma":0.00001283593,"domain_scores_codex":[0.9993567,0.000007570191,0.0001379247,0.0002137063,0.0001156146,0.0001684997],"domain_scores_gemma":[0.9996779,0.00005781812,0.00003486059,0.00007240798,0.00008214737,0.00007489193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0002948153,0.00004499623,0.08912767,0.0006108946,0.00005479916,0.000004610713,0.0909577,0.04164398,0.6807545,0.01007647,0.000006745342,0.08642286],"study_design_scores_gemma":[0.0009498409,0.0001413683,0.6175725,0.00006346824,0.00003356256,0.000005591824,0.0003305561,0.2734932,0.1068184,0.0002593817,0.00002202514,0.0003100605],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6949833,0.00002877538,0.3044165,0.000008064416,0.00001335981,0.0001500109,0.000004833268,0.00007325473,0.0003218949],"genre_scores_gemma":[0.8911614,0.0000207244,0.1087435,0.0000176435,0.00000583305,0.0000116748,0.000001851197,0.0000110977,0.00002629886],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.573936,"threshold_uncertainty_score":0.3350174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138596841","doi":"10.1287/trsc.1100.0328","title":"European Driver Rules in Vehicle Routing with Time Windows","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":98,"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":"Tabu search; Vehicle routing problem; Heuristics; Column generation; Computer science; Task (project management); Routing (electronic design automation); Heuristic; Mathematical optimization; Operations research; Algorithm; Engineering; Artificial intelligence; Mathematics; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.009295564871308826,"gpt":0.2376110851423939,"spread":0.228315520271085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285805,0.00009150301,0.00008542114,0.0001428222,0.00008874455,0.00005341287,0.0002229821,0.00002357535,0.00007691323],"category_scores_gemma":[0.00002926317,0.00008656265,0.00001356506,0.0007338507,0.0001617146,0.0004644456,0.000002704749,0.0001929775,0.00008686992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001904846,"about_ca_system_score_gemma":0.00003521822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001082504,"about_ca_topic_score_gemma":0.00006684564,"domain_scores_codex":[0.9990824,0.00002338311,0.0001990361,0.0002021995,0.0002631624,0.0002298602],"domain_scores_gemma":[0.9996305,0.00003600757,0.00003288333,0.0001638172,0.00006389544,0.00007295631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.000005687178,0.0000157957,0.08090855,0.00001052485,0.00000257054,0.00001614465,0.003152447,0.540055,0.3672904,0.0008198277,0.000005881303,0.007717158],"study_design_scores_gemma":[0.0003194282,0.000009748991,0.698351,0.00001880789,0.000003716661,0.000001770089,0.0000467257,0.2896192,0.01136731,0.00002099158,0.00009025998,0.0001510365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9597995,0.000002363668,0.03370975,0.00002742145,0.00008078614,0.00009248776,0.000003718448,0.000242278,0.006041655],"genre_scores_gemma":[0.9263962,0.000001002677,0.07348745,0.00002260287,0.00001877713,0.000002559904,0.000005736511,0.00002011056,0.00004558618],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6174424,"threshold_uncertainty_score":0.3529922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111837930","doi":"10.1287/trsc.34.4.402.12322","title":"On the Existence of Solutions to the Dynamic User Equilibrium Problem","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":97,"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":"Variational inequality; FIFO (computing and electronics); Path (computing); Mathematical optimization; Flow network; Computer science; Flow (mathematics); Mathematical economics; Mathematics; Applied mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02973688415505185,"gpt":0.3035717216101579,"spread":0.2738348374551061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344868,0.0000722142,0.00007087863,0.00007483958,0.0009807644,0.00006425165,0.0005616496,0.00002904607,0.0005411716],"category_scores_gemma":[0.00006352465,0.00004585813,0.00004076793,0.001640674,0.0007544695,0.0003315608,0.000001317215,0.00008269637,0.00007515631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003307712,"about_ca_system_score_gemma":0.0002787877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005162897,"about_ca_topic_score_gemma":0.002842916,"domain_scores_codex":[0.9984139,0.00006329863,0.0002473193,0.000222891,0.0007756781,0.0002769085],"domain_scores_gemma":[0.9992482,0.0001777557,0.00007483378,0.0002202508,0.0001962223,0.00008271756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00006332726,0.00009371269,0.002161122,0.000009577541,0.000007200699,0.000001295889,0.09954108,0.3373237,0.001431245,0.5519986,0.0009463374,0.006422774],"study_design_scores_gemma":[0.000724501,0.0003405283,0.8752729,0.0002910999,0.00009623436,0.000001070696,0.01984752,0.01019542,0.00152685,0.01511585,0.07579744,0.0007905304],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9550395,0.00002044488,0.008194485,0.01590934,0.0001507307,0.0006405078,0.0000523325,0.00009123905,0.01990142],"genre_scores_gemma":[0.9957992,0.00001956958,0.001313526,0.0005137892,0.00001297473,0.00003267317,0.00001042034,0.000004751571,0.002293064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8731118,"threshold_uncertainty_score":0.7543346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}