{"meta":{"query_hash":"a271bf8dbb5b","filters":{"venue":"Transportation Science"},"cohort_total":201,"direct_labels_cover":0,"predictions_cover":201,"exported":201,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/a271bf8dbb5b","api":"https://metacan.xera.ac/api/v1/cohort?venue=Transportation+Science"},"results":[{"id":"W1557185721","doi":"10.1287/trsc.1100.0322","title":"Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Heuristics; Crew; Computer science; Selection (genetic algorithm); Computation; Core (optical fiber); Column (typography); Mathematical optimization; Lagrangian; Operations research; Algorithm; Engineering; Mathematics; Artificial intelligence; Computer network","score_opus":0.007950100100018846,"score_gpt":0.22755699092012055,"score_spread":0.2196068908201017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557185721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.747133,0.000010683365,0.25162554,0.000019553117,0.00045893597,0.00016918422,0.0000057831303,0.00015357872,0.00042375195],"genre_scores_gemma":[0.98327905,0.0000037663767,0.016401146,0.000011591356,0.000075957985,0.00006625585,0.000025163255,0.000016759031,0.00012030615],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990748,0.0000034233572,0.00019864505,0.00023618528,0.0002609292,0.0002260056],"domain_scores_gemma":[0.9995835,0.000015575652,0.000037727314,0.00011778207,0.00017210642,0.00007332121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038169153,0.00009725372,0.000089729365,0.00011556545,0.0002734198,0.00007951777,0.00012470098,0.000049999944,0.000019888254],"category_scores_gemma":[0.000013834123,0.00008850804,0.00002472126,0.000617507,0.00009627375,0.0004405525,5.7499e-7,0.000097548625,0.0000043592363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005319402,0.000007860189,0.00070748234,0.000021452208,0.0000026887762,2.7621243e-7,0.00037346233,0.31444684,0.68082887,0.0017347148,0.000017662884,0.0018533707],"study_design_scores_gemma":[0.0003141305,0.00006173071,0.021045215,0.000012599074,0.00001062202,0.000005501702,0.00006564199,0.92690545,0.050189752,0.000030895866,0.0011671967,0.00019126949],"about_ca_topic_score_codex":0.00005834638,"about_ca_topic_score_gemma":0.004135928,"teacher_disagreement_score":0.63063914,"about_ca_system_score_codex":0.000033961413,"about_ca_system_score_gemma":0.000085489686,"threshold_uncertainty_score":0.36092532},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0419161086913205,"score_gpt":0.2980385804930498,"score_spread":0.2561224718017293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832376799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024546813,0.00010070853,0.97402453,0.00013891519,0.00021454184,0.0003017112,0.0000074082564,0.00019863386,0.0004667279],"genre_scores_gemma":[0.6549415,0.000013223396,0.34480557,0.00006546065,0.000043738997,0.00004826787,0.0000040952123,0.000016054211,0.00006208447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991134,0.000012714698,0.0002032779,0.00017225312,0.00028122377,0.00021716281],"domain_scores_gemma":[0.99946475,0.000096110176,0.000041624935,0.00012554819,0.00016515864,0.00010678064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015510046,0.00008313928,0.0000818292,0.00006599062,0.0001799866,0.00007186536,0.00019419039,0.000027854545,0.000004372064],"category_scores_gemma":[0.000066914574,0.00006704798,0.000022451262,0.000572955,0.00015060164,0.0003300714,0.0000032870985,0.00007045136,0.0000031927254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066189245,0.000015978636,0.0042067845,0.00006220444,0.000019519754,9.76394e-7,0.015792534,0.6754132,0.0032118503,0.0058575086,0.00023542192,0.29517743],"study_design_scores_gemma":[0.00033888273,0.000014558861,0.004133115,0.000012864294,0.000013546833,0.000001514479,0.0002679592,0.99137205,0.0019100715,0.00075230066,0.0010731057,0.00011004818],"about_ca_topic_score_codex":0.000013794685,"about_ca_topic_score_gemma":0.000011789414,"teacher_disagreement_score":0.6303947,"about_ca_system_score_codex":0.000040666084,"about_ca_system_score_gemma":0.00007661812,"threshold_uncertainty_score":0.27341372},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08101912272087147,"score_gpt":0.2989574792719695,"score_spread":0.217938356551098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876351940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32309464,0.000042580697,0.6765633,0.000029743125,0.00003207725,0.0001154449,0.000005383373,0.00008463965,0.000032162814],"genre_scores_gemma":[0.6890135,0.0000025761615,0.3109294,0.000011396941,0.000011599302,0.000010752867,0.0000028455152,0.000010087162,0.000007886822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932265,0.000006515533,0.0001364771,0.00018569207,0.00018473275,0.00016391704],"domain_scores_gemma":[0.9995535,0.000062430794,0.000027044607,0.000070019814,0.00016506188,0.000121963276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006124677,0.00008003444,0.0000924327,0.00006952761,0.000101700054,0.000057936366,0.00006323298,0.000023035538,5.204721e-7],"category_scores_gemma":[0.000038213322,0.00007243631,0.0000062965864,0.00030925713,0.00013751583,0.0005017748,0.0000020540506,0.0000411855,2.0785208e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005962385,0.0000022218508,0.0005309915,0.000013917251,0.0000018283134,3.0441961e-7,0.0014689974,0.9941004,0.000339338,0.0006636663,0.0000015715825,0.0028708258],"study_design_scores_gemma":[0.00045688922,0.000030863386,0.0034097577,0.000017976308,0.000011581677,0.0000026350804,0.00032329137,0.99482685,0.00045019423,0.00036387614,0.0000028413658,0.00010321562],"about_ca_topic_score_codex":0.000010554728,"about_ca_topic_score_gemma":0.000016283593,"teacher_disagreement_score":0.36591884,"about_ca_system_score_codex":0.000017292597,"about_ca_system_score_gemma":0.00004431998,"threshold_uncertainty_score":0.2953867},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03399212553211606,"score_gpt":0.26458594615429226,"score_spread":0.2305938206221762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968350460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028680516,0.00017324297,0.96880573,0.00043250015,0.00005942175,0.00029720846,0.000025843485,0.00007051647,0.0014550132],"genre_scores_gemma":[0.98255736,0.000119742595,0.017085077,0.000042762553,0.0000345809,0.000023676263,0.000011208093,0.0000065098493,0.000119079006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994402,0.000001724648,0.00013017989,0.000108814274,0.0001779838,0.00014108187],"domain_scores_gemma":[0.9996983,0.000057154968,0.000011998297,0.00008906698,0.000099796554,0.000043682332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031714945,0.00005209624,0.00004524548,0.000034373712,0.00015325515,0.000048919923,0.0001024222,0.000018038505,0.000013643782],"category_scores_gemma":[0.0000071292866,0.00003971376,0.000010536081,0.0001562622,0.00015031669,0.00021518377,0.0000013968042,0.000047017606,0.0000015240929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028484133,0.0000077027535,0.00026303093,0.000046213183,0.0000028003371,2.1762277e-7,0.0014174912,0.9078562,0.000622723,0.04764792,0.00014822926,0.041984618],"study_design_scores_gemma":[0.00009884547,0.00000965379,0.008533531,0.0000051501925,0.000011071806,6.4126647e-7,0.000065074644,0.9857656,0.00083056383,0.0013717829,0.003238698,0.000069403686],"about_ca_topic_score_codex":0.00002475989,"about_ca_topic_score_gemma":0.00012591135,"teacher_disagreement_score":0.95387685,"about_ca_system_score_codex":0.000014165316,"about_ca_system_score_gemma":0.00003168814,"threshold_uncertainty_score":0.16194801},"labels":[],"label_agreement":null},{"id":"W1969579058","doi":"10.1287/trsc.1040.0106","title":"The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Arc routing; Column generation; Mathematical optimization; Minimum-cost flow problem; Profit (economics); Integer programming; Limiting; Directed graph; Arc (geometry); Branch and price; Mathematics; Graph; Computer science; Flow network; Algorithm; Routing (electronic design automation); Economics; Engineering; Combinatorics","score_opus":0.011446536960808825,"score_gpt":0.249086160234552,"score_spread":0.23763962327374316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969579058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08145272,0.000118653275,0.91601783,0.00042424575,0.000053494292,0.00024577562,0.000003560614,0.00024123039,0.0014425017],"genre_scores_gemma":[0.63497657,0.00003645447,0.36470237,0.000030731753,0.00002627518,0.000027805327,0.0000023541263,0.000011485729,0.00018592867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990262,0.000014206403,0.00018003181,0.00018367429,0.00032663025,0.00026926718],"domain_scores_gemma":[0.9995896,0.000048222275,0.00003879891,0.00013368175,0.00011875179,0.00007093185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007940785,0.00008845321,0.000070002905,0.00006058588,0.00036710245,0.00009386145,0.00015524752,0.000023964436,0.000010782356],"category_scores_gemma":[0.000013024006,0.0000639808,0.000011511157,0.00070453517,0.00019245481,0.0005811567,0.000002431368,0.000094046016,0.000007334153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011628413,0.000017643008,0.0027875688,0.000040527117,0.000011221155,0.0000011231589,0.0031815127,0.6802675,0.017119529,0.0026082455,0.00009373059,0.29385975],"study_design_scores_gemma":[0.00040079313,0.000033467706,0.057564545,0.000030195375,0.000014431053,0.00000769164,0.00010730801,0.9277228,0.010916169,0.00021646504,0.0027752283,0.00021091568],"about_ca_topic_score_codex":0.000012670316,"about_ca_topic_score_gemma":0.00008075431,"teacher_disagreement_score":0.55352384,"about_ca_system_score_codex":0.00004570938,"about_ca_system_score_gemma":0.00006245802,"threshold_uncertainty_score":0.28234923},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014422727457204347,"score_gpt":0.25218924514991714,"score_spread":0.2377665176927128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978976115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6684858,0.00008129379,0.18855938,0.0019890573,0.00084530987,0.005517704,0.000011184722,0.0011863861,0.13332388],"genre_scores_gemma":[0.97539395,0.0000030287551,0.020884158,0.0028977634,0.00019147905,0.00009414365,0.00006860579,0.000017478358,0.00044939484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99793434,0.0000056945055,0.0002491724,0.0006020136,0.0006795171,0.00052928523],"domain_scores_gemma":[0.9993166,0.0000038536878,0.00012734316,0.00038340065,0.000117030584,0.000051799798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067618885,0.00019062623,0.00014722555,0.00034882192,0.00038842994,0.00042861394,0.0005831042,0.000023787974,0.000024151386],"category_scores_gemma":[0.000003893669,0.00016671869,0.000030871557,0.0024785383,0.00011358465,0.0018995262,0.000011066694,0.00007932225,0.00007437208],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003009921,0.0016817179,0.040118333,0.00082406716,0.00006816404,0.000065879394,0.0023263074,0.2043122,0.0011625995,0.46827918,0.0046547903,0.27620578],"study_design_scores_gemma":[0.0013551553,0.00014256904,0.71574485,0.00019533107,0.00017848206,0.0000012483785,0.0016771982,0.044571526,0.000027612474,0.0019888768,0.23300959,0.0011075814],"about_ca_topic_score_codex":0.000080994476,"about_ca_topic_score_gemma":0.00012042852,"teacher_disagreement_score":0.6756265,"about_ca_system_score_codex":0.00005000847,"about_ca_system_score_gemma":0.000014368234,"threshold_uncertainty_score":0.6798591},"labels":[],"label_agreement":null},{"id":"W1985971056","doi":"10.1287/trsc.2015.0593","title":"A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and cut; Mathematical optimization; Branch and price; Integer programming; Linear programming; Arc (geometry); Branch and bound; Column generation; Mathematics; Minification; Integer (computer science); Set (abstract data type); Vehicle routing problem; Routing (electronic design automation); Algorithm; Computer science","score_opus":0.027579331617463003,"score_gpt":0.2762793489469292,"score_spread":0.24870001732946617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985971056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013054153,0.000104027735,0.9858073,0.00015031302,0.00018466495,0.00019555005,0.000010469172,0.0002120658,0.0002814278],"genre_scores_gemma":[0.7288464,0.000026955759,0.27083644,0.000090431415,0.00004807549,0.000051416697,0.000011326913,0.000019921375,0.000069026435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898607,0.000019551184,0.00024602044,0.00021036011,0.0003041997,0.0002337991],"domain_scores_gemma":[0.99929523,0.00015635211,0.000056487734,0.00013752964,0.00024860888,0.00010576529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088043755,0.00009952846,0.00009371846,0.000078649864,0.0002200335,0.000090310095,0.00019326143,0.00003792555,0.000004343045],"category_scores_gemma":[0.00006875512,0.00008401774,0.000022799994,0.0008048132,0.00012905757,0.00043645286,0.000004040137,0.000054818953,0.0000013915235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055823302,0.000010237203,0.00073220057,0.000018746312,0.000009374803,3.948316e-7,0.0040320302,0.83575183,0.003149986,0.004377481,0.0001250332,0.1517871],"study_design_scores_gemma":[0.00037375066,0.000016727377,0.0030267066,0.000010453955,0.000014983496,0.0000013336398,0.0002148483,0.988463,0.0060808565,0.00036410254,0.0013157754,0.000117470125],"about_ca_topic_score_codex":0.000030066052,"about_ca_topic_score_gemma":0.000018980449,"teacher_disagreement_score":0.71579224,"about_ca_system_score_codex":0.00004572792,"about_ca_system_score_gemma":0.00008139785,"threshold_uncertainty_score":0.34261438},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01684428022553878,"score_gpt":0.25274875513127243,"score_spread":0.23590447490573366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991149726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52301276,0.00002080558,0.473717,0.000077835546,0.00004963461,0.00015503776,0.0000026112225,0.00037770142,0.0025866106],"genre_scores_gemma":[0.8000012,0.0000062867184,0.19985498,0.000025750254,0.000024722023,0.000011817866,0.000004395094,0.000014225081,0.000056622295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908215,0.000006995478,0.00018647707,0.00018388328,0.00032331454,0.00021716133],"domain_scores_gemma":[0.9996554,0.000016761678,0.00002804415,0.00012397328,0.00009792182,0.00007786317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004343075,0.000088311455,0.0000764706,0.000085542866,0.00010934228,0.0000419231,0.00015936897,0.000024192035,0.00002867898],"category_scores_gemma":[0.0000083344885,0.00007925955,0.000012800543,0.00081532187,0.00011423368,0.00050804357,8.120352e-7,0.00008166708,0.000019363688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016008504,0.000005534977,0.0029370098,0.000018030296,0.0000019333042,5.562813e-7,0.0016039703,0.9713183,0.015270063,0.00054845156,0.00000401386,0.008290523],"study_design_scores_gemma":[0.00051881943,0.000036403435,0.106189474,0.0000694744,0.000015871321,0.000005470345,0.00012971881,0.83133197,0.059997763,0.000043902455,0.0013198981,0.0003412364],"about_ca_topic_score_codex":0.0000023819562,"about_ca_topic_score_gemma":0.00003660411,"teacher_disagreement_score":0.27698845,"about_ca_system_score_codex":0.000040771574,"about_ca_system_score_gemma":0.000048423426,"threshold_uncertainty_score":0.32321107},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010533607026914655,"score_gpt":0.22700258869666465,"score_spread":0.21646898166974998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001478667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96069854,0.000027504268,0.032747004,0.00006995557,0.00016753704,0.0000713508,0.0000033085098,0.000114396746,0.006100392],"genre_scores_gemma":[0.99725586,0.000006779259,0.0025898437,0.000058335092,0.000024644698,0.0000054762563,0.0000042343386,0.0000065242907,0.00004831413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993178,0.000004140389,0.00018209746,0.00013155611,0.00018583052,0.00017856846],"domain_scores_gemma":[0.99976444,0.000026656176,0.000015008308,0.00009748464,0.000041303138,0.000055120585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035591738,0.00006567804,0.00008664739,0.0001060503,0.000039963106,0.000028994038,0.000114203496,0.000024413519,0.000057944886],"category_scores_gemma":[0.000030684132,0.00006336147,0.000015343601,0.00033747734,0.00010002001,0.00014551899,0.0000010247351,0.00007005174,0.000012063135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073865262,0.00002893654,0.071703225,0.00009901835,0.000003339112,0.00001908845,0.0019964848,0.8846431,0.015679901,0.017622862,0.00006104596,0.008135663],"study_design_scores_gemma":[0.00045602463,0.000022726388,0.6786185,0.00004294514,0.00000825831,0.0000021197727,0.00013514416,0.3118376,0.0031577449,0.000876195,0.004573625,0.00026911154],"about_ca_topic_score_codex":0.00007827198,"about_ca_topic_score_gemma":0.00040725883,"teacher_disagreement_score":0.6069153,"about_ca_system_score_codex":0.000015320778,"about_ca_system_score_gemma":0.000020636788,"threshold_uncertainty_score":0.2583806},"labels":[],"label_agreement":null},{"id":"W2003793882","doi":"10.1287/trsc.1090.0276","title":"<b>Guest Editorial</b>—Focused Issue on Freight Transportation","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"Traffic management; Transport engineering; Business; Transportation planning; Humanitarian Logistics; Transportation industry; Engineering; Industrial organization","score_opus":0.013395566103160445,"score_gpt":0.272174827976024,"score_spread":0.25877926187286354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003793882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55138224,0.00010236688,0.33096796,0.0012205149,0.093835495,0.0012162552,0.0001665105,0.0042313174,0.016877323],"genre_scores_gemma":[0.97070843,0.000024216843,0.021637145,0.00017420606,0.0072752205,0.000010918927,0.00006705579,0.000026594884,0.0000762332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9981003,0.000021047319,0.00040253522,0.00034548424,0.00079789315,0.00033276467],"domain_scores_gemma":[0.99926275,0.000059243055,0.00006247182,0.00026677648,0.00018925454,0.0001594952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061476603,0.00018594995,0.00017055286,0.0002532651,0.00018355985,0.00007302244,0.00029933805,0.0000995068,0.000077874836],"category_scores_gemma":[0.00004250645,0.00019300026,0.000051414063,0.0012940335,0.00010373798,0.0006343193,3.2534373e-7,0.00018923396,0.00009139562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004430485,0.00010029544,0.0010333452,0.000037826365,0.000009238441,0.000011489315,0.0044371295,0.90985763,0.054800004,0.0038350113,0.01044943,0.015384294],"study_design_scores_gemma":[0.002970738,0.0005794078,0.47462934,0.00019332727,0.00009987442,0.0000016542508,0.0002611413,0.07517497,0.29238164,0.0012797461,0.15065785,0.0017703023],"about_ca_topic_score_codex":0.000008890308,"about_ca_topic_score_gemma":0.000017118156,"teacher_disagreement_score":0.83468264,"about_ca_system_score_codex":0.000073327625,"about_ca_system_score_gemma":0.00006182807,"threshold_uncertainty_score":0.78703225},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09910634419173589,"score_gpt":0.3799160839008588,"score_spread":0.28080973970912293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005562592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94372773,0.000033617755,0.053682864,0.0007209337,0.0002837883,0.00026670092,0.00037793303,0.00006819648,0.0008382201],"genre_scores_gemma":[0.98918945,0.00014493857,0.009605055,0.00016607152,0.00007881194,0.000033931254,0.000026668253,0.00001078119,0.00074431306],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9955179,0.000068663496,0.0011262805,0.0007279684,0.0020891149,0.00047008807],"domain_scores_gemma":[0.99749446,0.0005894636,0.00046918806,0.0005183451,0.00072558265,0.0002029511],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004639026,0.00017770457,0.00041391503,0.0004777888,0.0014243335,0.0001250224,0.0010190406,0.00006287646,0.00034595124],"category_scores_gemma":[0.00080424716,0.00013729664,0.00023535507,0.0022875308,0.001026732,0.0010605005,0.0000044649278,0.00008085394,0.00007491645],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037063207,0.00025293438,0.673913,0.000034425655,0.00007745679,0.00006544788,0.054306097,0.022450313,0.17558311,0.022412378,0.0015194801,0.049014717],"study_design_scores_gemma":[0.0005543317,0.00007503008,0.91493744,0.000010662963,0.000059547423,0.000007952522,0.0016991306,0.00084891566,0.06540822,0.011433976,0.0046557183,0.00030909447],"about_ca_topic_score_codex":0.00066391216,"about_ca_topic_score_gemma":0.0006601328,"teacher_disagreement_score":0.2410244,"about_ca_system_score_codex":0.000021379003,"about_ca_system_score_gemma":0.00029691495,"threshold_uncertainty_score":0.99987566},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0778347292160422,"score_gpt":0.2723011943071366,"score_spread":0.19446646509109441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010359686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41802981,0.000019452596,0.5769064,0.000009153612,0.00021047417,0.00007105326,0.0000021683595,0.0002969288,0.0044545867],"genre_scores_gemma":[0.9336215,0.000007801909,0.06623831,0.000050781553,0.000016249505,0.0000056200543,0.00000438095,0.000014820158,0.00004049443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899507,0.000019651536,0.00024339398,0.00020712464,0.0002809049,0.00025387105],"domain_scores_gemma":[0.99956983,0.000022434253,0.00004083395,0.00016574156,0.000096549484,0.0001046085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008262208,0.000098056626,0.000090891765,0.00012665651,0.00014648098,0.000027952263,0.0002237921,0.000039414936,0.00014285906],"category_scores_gemma":[0.000026860213,0.000101840385,0.000028346847,0.00075376855,0.00018002954,0.00043459967,0.0000027496937,0.00009560677,0.000018651028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021409617,0.0000072509224,0.009901885,0.000010598694,0.000003526776,0.0000013298994,0.0030035425,0.9797788,0.0026200358,0.0039320923,0.000010848217,0.00072793063],"study_design_scores_gemma":[0.00026211605,0.000013695803,0.2096509,0.000025769727,0.000016440084,0.0000016025266,0.00060034404,0.7781336,0.010336215,0.0006601146,0.00004521861,0.00025402202],"about_ca_topic_score_codex":0.00003646887,"about_ca_topic_score_gemma":0.000042394913,"teacher_disagreement_score":0.51559174,"about_ca_system_score_codex":0.00006229501,"about_ca_system_score_gemma":0.000057184465,"threshold_uncertainty_score":0.41529304},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03870615525915687,"score_gpt":0.2777857777228835,"score_spread":0.2390796224637266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023445393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21774086,0.000051792682,0.7814001,0.0001774921,0.00011070293,0.00023788036,0.000017754099,0.0001493782,0.00011406535],"genre_scores_gemma":[0.7581933,0.000048272483,0.24164934,0.000041797117,0.00002361908,0.000018681367,0.0000063221455,0.0000114858385,0.000007167987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917066,0.000007581678,0.0002215447,0.00017423791,0.00023002025,0.00019593735],"domain_scores_gemma":[0.99950826,0.00014036219,0.00003564102,0.00014002458,0.00011591402,0.000059815684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007643418,0.000086598426,0.00008892392,0.000047524365,0.00030617812,0.00006064938,0.00019802168,0.000032130763,0.000003905792],"category_scores_gemma":[0.00003875691,0.000075848824,0.000026665142,0.00037093024,0.00019140259,0.00022082741,0.0000024251754,0.000094549396,0.000002099471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003827879,0.000008951968,0.00054962805,0.000043176697,0.000004995566,3.0106216e-7,0.001892517,0.98172265,0.0041462798,0.0069985087,0.0000043645323,0.00462481],"study_design_scores_gemma":[0.0015652216,0.00006959094,0.16252552,0.000104181534,0.00011298014,0.00000422445,0.000493119,0.79891795,0.026364356,0.008659879,0.00066332775,0.00051966304],"about_ca_topic_score_codex":0.000019403251,"about_ca_topic_score_gemma":0.000052461746,"teacher_disagreement_score":0.5404525,"about_ca_system_score_codex":0.00004370357,"about_ca_system_score_gemma":0.000066981615,"threshold_uncertainty_score":0.3093025},"labels":[],"label_agreement":null},{"id":"W2025149700","doi":"10.1287/trsc.1030.0064","title":"Designing Distribution Networks: Formulations and Solution Heuristic","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transshipment (information security); Tabu search; Computer science; Truck; Metaheuristic; Heuristic; Mathematical optimization; Operations research; Consolidation (business); Context (archaeology); Engineering; Algorithm; Mathematics; Economics; Artificial intelligence","score_opus":0.017720834199634494,"score_gpt":0.2662849077816137,"score_spread":0.24856407358197918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025149700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17106669,0.0000379748,0.82838297,0.000034188826,0.000098130724,0.00008692024,0.0000071818595,0.00021701938,0.000068924914],"genre_scores_gemma":[0.88695645,0.00002279116,0.11292934,0.000010663095,0.000016277118,0.000006907009,0.000046328,0.000007606954,0.0000036461533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999297,0.000008209653,0.00018254672,0.00014871707,0.00017523489,0.00018828032],"domain_scores_gemma":[0.9997039,0.000031734864,0.000028921777,0.000083204795,0.00007839989,0.000073879724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040522267,0.00007306882,0.000064120686,0.00006559192,0.0002628628,0.00005247195,0.00006900531,0.00003224025,0.00000430781],"category_scores_gemma":[0.000042270076,0.00008103037,0.0000136962535,0.0006806051,0.0001240955,0.00051147485,0.000001727255,0.00006755484,0.000002553712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011154021,0.0000034010677,0.0010944096,0.000006866786,0.0000011978352,4.6187446e-7,0.00027038855,0.98726,0.004550957,0.004922122,0.000002487272,0.0018865892],"study_design_scores_gemma":[0.00029161692,0.000013116663,0.1497459,0.00002607511,0.000013710332,0.0000026228413,0.000033252454,0.8440568,0.004467002,0.0011794227,0.000032964886,0.00013755696],"about_ca_topic_score_codex":0.0000102857,"about_ca_topic_score_gemma":0.000012805349,"teacher_disagreement_score":0.71588975,"about_ca_system_score_codex":0.000087373824,"about_ca_system_score_gemma":0.000034548328,"threshold_uncertainty_score":0.33043224},"labels":[],"label_agreement":null},{"id":"W2029961998","doi":"10.1287/trsc.2014.0570","title":"Guest Editorial: Special Issue on Energy and Transportation","year":2014,"lang":"en","type":"editorial","venue":"Transportation Science","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Greenhouse gas; Energy management; Variety (cybernetics); Environmental economics; Transport engineering; Operations research; Business; Engineering; Computer science; Economics; Energy (signal processing)","score_opus":0.003047336757641957,"score_gpt":0.2109321888448099,"score_spread":0.20788485208716795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029961998","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009309677,0.000052731684,0.000460929,0.000019243716,0.99622273,0.00009991061,0.0002350194,0.00018743673,0.0017910284],"genre_scores_gemma":[0.006954983,0.00032686602,0.000106119995,0.000024379438,0.99168974,0.000014665029,0.0006552313,0.00005121024,0.00017681069],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972983,0.000011575904,0.00042096674,0.0005118438,0.0013885279,0.00036880048],"domain_scores_gemma":[0.9991129,0.00013018331,0.00010549297,0.00022915388,0.0002543748,0.00016790308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028208795,0.00033206426,0.0003282358,0.0002629131,0.00016521304,0.000116264266,0.00033213323,0.00055357855,0.00007192175],"category_scores_gemma":[0.000039829833,0.0003283842,0.000058763002,0.0005635601,0.00019548672,0.0003390905,9.903205e-7,0.00046013086,0.000013704406],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001702168,0.0000057589814,0.000010525277,0.00006378993,0.0000074070495,0.000002625282,0.00029217167,0.0013974382,0.00042057707,0.00031723923,0.9930906,0.0043748193],"study_design_scores_gemma":[0.0003157738,0.00011054935,0.0007876962,0.000054316435,0.000035260295,1.478126e-7,0.000011445646,0.00023833568,0.0014235723,0.00021564859,0.996456,0.00035120014],"about_ca_topic_score_codex":0.000073062976,"about_ca_topic_score_gemma":0.00044014357,"teacher_disagreement_score":0.0060240156,"about_ca_system_score_codex":0.00008673087,"about_ca_system_score_gemma":0.00015156706,"threshold_uncertainty_score":0.9999168},"labels":[],"label_agreement":null},{"id":"W2031202838","doi":"10.1287/trsc.2013.0493","title":"Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Université de Montréal; Université du Québec à Montréal","keywords":"Solver; Network planning and design; Cutting-plane method; Dimension (graph theory); Variable (mathematics); Computer science; Mathematical optimization; Service (business); Quality of service; Plane (geometry); Distributed computing; Integer programming; Mathematics; Computer network","score_opus":0.04324152256923113,"score_gpt":0.2835365767714388,"score_spread":0.24029505420220765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031202838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013074686,0.000008914593,0.9857731,0.0000418774,0.00015229672,0.00043110148,0.0000047685003,0.00032882887,0.0001844453],"genre_scores_gemma":[0.43923363,0.0000020551786,0.56055814,0.0000918467,0.00003138409,0.000037641905,0.000010061063,0.00001991864,0.000015333677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987517,0.00004548466,0.00025668088,0.0002625229,0.00032270653,0.00036088526],"domain_scores_gemma":[0.9991359,0.0002887511,0.00007699291,0.00019949774,0.00020657937,0.000092268325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017804571,0.00013541064,0.0001449124,0.000067740235,0.00020328822,0.00005813405,0.00026029756,0.00003580981,0.000011439438],"category_scores_gemma":[0.000059576258,0.00012644555,0.000014921443,0.0008807339,0.00006534799,0.00026352555,0.0000014813269,0.000060220616,0.000009850561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027038006,0.0000052251507,0.0005403163,0.00004476449,0.0000048119896,4.236558e-7,0.0003469298,0.99327236,0.0041252077,0.00045208665,0.000047196325,0.0011336311],"study_design_scores_gemma":[0.0005300824,0.0000810754,0.007442018,0.00006138621,0.00002628466,0.0000013445427,0.000018676681,0.9842376,0.0066400804,0.00063406664,0.00012756702,0.00019978314],"about_ca_topic_score_codex":0.0000038771473,"about_ca_topic_score_gemma":0.0000050372864,"teacher_disagreement_score":0.42615893,"about_ca_system_score_codex":0.00003559978,"about_ca_system_score_gemma":0.000056060228,"threshold_uncertainty_score":0.51562995},"labels":[],"label_agreement":null},{"id":"W2032484872","doi":"10.1287/trsc.37.4.365.23279","title":"Foreword to the Special Issue on Aviation Operations Research: Commemorating 100 Years of Aviation","year":2003,"lang":"en","type":"article","venue":"Transportation Science","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Aviation; Aeronautics; Aviation engineering; Wright; Air traffic control; Engineering; Transport engineering; Operations research; Civil aviation; Systems engineering; Aerospace engineering","score_opus":0.047235725824330235,"score_gpt":0.31314222203212666,"score_spread":0.26590649620779644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032484872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67580247,0.000012003651,0.30118307,0.0009699284,0.0009485221,0.0011317382,0.000028350927,0.00015160053,0.019772306],"genre_scores_gemma":[0.995571,0.000009029559,0.0038341538,0.00006449019,0.00020176527,0.000023319571,0.00002604485,0.00000826374,0.00026192566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988818,0.00003187887,0.00022448383,0.0001443465,0.0005536521,0.00016380582],"domain_scores_gemma":[0.9995391,0.000054067572,0.000019695854,0.00016786913,0.000177844,0.000041446285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010407714,0.000059853643,0.0000628465,0.0002431661,0.00024234311,0.00004888756,0.0001829264,0.000023957244,0.00016393352],"category_scores_gemma":[0.000117674834,0.00005561684,0.000017984612,0.0015170755,0.00007714506,0.00032383736,0.000002068251,0.00009338844,0.000054050113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003525356,0.000013549232,0.0001754483,0.0000070596802,0.0000019825602,2.2573809e-7,0.003754923,0.956336,0.00038910532,0.028328013,0.0015825585,0.009407605],"study_design_scores_gemma":[0.0007258044,0.0002550434,0.14714678,0.00009378862,0.000027358517,3.3442274e-7,0.003850872,0.7959537,0.015190076,0.00069100346,0.035653267,0.00041199158],"about_ca_topic_score_codex":0.000015413672,"about_ca_topic_score_gemma":0.00044527635,"teacher_disagreement_score":0.31976855,"about_ca_system_score_codex":0.000050809278,"about_ca_system_score_gemma":0.000034715766,"threshold_uncertainty_score":0.2267989},"labels":[],"label_agreement":null},{"id":"W2035551247","doi":"10.1287/trsc.1060.0186","title":"The Minisum Multipurpose Trip Location Problem on Networks","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Network topology; Service (business); TRIPS architecture; Computer science; Mathematical optimization; Set (abstract data type); Facility location problem; Integer programming; Simple (philosophy); Type (biology); Linear programming; Operations research; Mathematics; Computer network","score_opus":0.021713250281691587,"score_gpt":0.2578306280513072,"score_spread":0.2361173777696156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035551247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6479367,0.00012447574,0.29151726,0.007591814,0.0029745067,0.0020261577,0.0000022272507,0.00050914,0.047317695],"genre_scores_gemma":[0.9977254,0.000013089809,0.00024199697,0.0012358725,0.00015672279,0.000023078794,0.000021192454,0.0000067967594,0.0005757944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984262,0.00000392693,0.00035985967,0.00029725334,0.0005820938,0.00033065715],"domain_scores_gemma":[0.9992369,0.000035959412,0.00009196505,0.00025384023,0.00036051753,0.0000208517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023715722,0.00010797666,0.00006574354,0.00018827344,0.0007557388,0.00021831639,0.00038359375,0.000030286852,0.00004966738],"category_scores_gemma":[0.000066066495,0.00008037177,0.000034398963,0.0017933968,0.00023199903,0.0008717481,0.0000076219185,0.00009178789,0.00023750888],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000323674,0.00033406654,0.018893857,0.0001431616,0.000017754117,0.000006142403,0.00085745,0.1846968,0.0008691773,0.5643714,0.004200634,0.2252859],"study_design_scores_gemma":[0.0006418169,0.000025386318,0.74896705,0.000036437526,0.000028050687,1.3424203e-7,0.0011968964,0.10166005,0.00032512538,0.0011372601,0.14564799,0.00033376625],"about_ca_topic_score_codex":0.00030515433,"about_ca_topic_score_gemma":0.002604,"teacher_disagreement_score":0.7300732,"about_ca_system_score_codex":0.000035575562,"about_ca_system_score_gemma":0.000028773553,"threshold_uncertainty_score":0.58126086},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06522803791999959,"score_gpt":0.34045945924746973,"score_spread":0.27523142132747014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035893651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09750892,0.000012646142,0.8984694,0.000839352,0.0003469333,0.00085524964,0.00014793056,0.0002880541,0.0015315524],"genre_scores_gemma":[0.9062107,0.0000857717,0.091962,0.00041335137,0.00012656907,0.0001319951,0.0004815321,0.000021504025,0.000566526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974248,0.0000434425,0.00050241774,0.00055212266,0.0009053814,0.00057183026],"domain_scores_gemma":[0.99859035,0.00017329681,0.00022856578,0.0002090782,0.0005583119,0.00024041743],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012566028,0.00019009219,0.00019905927,0.00023529315,0.0015727289,0.00012964218,0.0003500879,0.00012926957,0.00009105042],"category_scores_gemma":[0.000099190846,0.00020319784,0.00010464757,0.0013978381,0.00042506863,0.0010689585,6.013414e-7,0.000115644594,0.000008552394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001492576,0.0000791216,0.0071213497,0.000008830813,0.0000044853773,0.000001640119,0.011144287,0.9549472,0.000037623737,0.024700886,0.00018119432,0.0016241344],"study_design_scores_gemma":[0.0010145323,0.000072270625,0.062245287,0.00004944994,0.000047849146,1.7788439e-7,0.0007327331,0.9311576,0.00004344068,0.0019357135,0.0023577206,0.0003432127],"about_ca_topic_score_codex":0.00027301733,"about_ca_topic_score_gemma":0.0036404626,"teacher_disagreement_score":0.8087018,"about_ca_system_score_codex":0.00011539993,"about_ca_system_score_gemma":0.0005326755,"threshold_uncertainty_score":0.9997271},"labels":[],"label_agreement":null},{"id":"W2045466512","doi":"10.1287/trsc.1070.0197","title":"A Theoretical Comparison of Feasibility Cuts for the Integrated Aircraft-Routing and Crew-Pairing Problem","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Routing (electronic design automation); Pairing; Set (abstract data type); Decomposition; Computer science; Benders' decomposition; Mathematical optimization; Crew scheduling; Engineering; Operations research; Aeronautics; Computer network; Mathematics","score_opus":0.048540676101435594,"score_gpt":0.3307044574312802,"score_spread":0.2821637813298446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045466512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5211246,0.00003607673,0.47830102,0.000041810366,0.000036887875,0.00023616804,0.0000060491975,0.000083803396,0.00013361704],"genre_scores_gemma":[0.8673841,0.000008223887,0.13256226,0.000008809061,0.0000065895792,0.00001414116,0.0000030803583,0.000008742806,0.000004097002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990275,0.000024591965,0.00034578535,0.00018608489,0.00023542022,0.00018062643],"domain_scores_gemma":[0.99922353,0.00033821823,0.00005748132,0.00014345754,0.00018528325,0.000052012267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011493906,0.00008661394,0.00014633972,0.000057907426,0.00024932544,0.000018506713,0.00017104621,0.000033190787,0.000013089481],"category_scores_gemma":[0.00016465879,0.0000656791,0.000031217412,0.0005659867,0.0008014246,0.00017612318,0.00000349826,0.000100375095,3.6400527e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043502543,0.000050820363,0.21725515,0.00014859266,0.000015371294,6.7018675e-7,0.017891949,0.6857549,0.030458648,0.040354557,0.000018110177,0.008007709],"study_design_scores_gemma":[0.00023707034,0.000026569642,0.15083069,0.000027099606,0.000013693041,0.0000016932686,0.00044867472,0.83309036,0.014853569,0.00037705345,0.000012365328,0.0000811764],"about_ca_topic_score_codex":0.000009650801,"about_ca_topic_score_gemma":0.000011526214,"teacher_disagreement_score":0.34625947,"about_ca_system_score_codex":0.00002752585,"about_ca_system_score_gemma":0.000059948114,"threshold_uncertainty_score":0.29528823},"labels":[],"label_agreement":null},{"id":"W2046349969","doi":"10.1287/trsc.1100.0339","title":"A Tactical Planning Model for Railroad Transportation of Dangerous Goods","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; McGill University; Memorial University of Newfoundland","funders":"","keywords":"Train; Dangerous goods; Transportation planning; Transport engineering; Operations research; Truck; Genetic algorithm; Flow network; Population; Yard; Hazardous waste; Component (thermodynamics); Engineering; Computer science; Mathematical optimization; Geography","score_opus":0.13276997164653903,"score_gpt":0.4402819861719345,"score_spread":0.30751201452539545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046349969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54425484,0.000008875981,0.45477346,0.00033537505,0.00013476807,0.00013326372,0.000087004184,0.000019953195,0.00025247698],"genre_scores_gemma":[0.95367,0.0000054135585,0.04595868,0.00006439425,0.000025247959,0.000021097303,0.000028086277,0.000007659662,0.00021941736],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963496,0.000020622749,0.0009216969,0.0005841563,0.0018239968,0.00029996454],"domain_scores_gemma":[0.9977144,0.0005580953,0.00036663527,0.00044986838,0.000734354,0.00017666949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033738513,0.00013115058,0.00030849467,0.00044457152,0.0003006982,0.00009134816,0.0008079929,0.00008884717,0.00008460284],"category_scores_gemma":[0.0006713363,0.00010470936,0.00020588146,0.0019651034,0.0005956375,0.0010729051,0.0000020931977,0.00016640723,0.000009999636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005736207,0.00033861323,0.073383816,0.000039513096,0.000039379946,0.000010292286,0.044023868,0.29319403,0.3551362,0.10942438,0.00042084383,0.12341546],"study_design_scores_gemma":[0.0009437483,0.00010994997,0.31108165,0.00001566014,0.00011575351,0.0000014915872,0.0015186184,0.611042,0.018084215,0.05530766,0.0014318345,0.00034738088],"about_ca_topic_score_codex":0.00004900058,"about_ca_topic_score_gemma":0.000600269,"teacher_disagreement_score":0.40941516,"about_ca_system_score_codex":0.000010997838,"about_ca_system_score_gemma":0.000311163,"threshold_uncertainty_score":0.4269924},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020126917279569764,"score_gpt":0.30792374553360674,"score_spread":0.28779682825403696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059559546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42903775,0.00002539646,0.5704123,0.000041192558,0.000073397314,0.00010642,0.0000031924524,0.00016689459,0.00013350965],"genre_scores_gemma":[0.73442626,0.000021990594,0.2654615,0.00003385512,0.00001873677,0.0000073026645,0.000009227675,0.000012043567,0.0000090760095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915826,0.000008387513,0.00021324062,0.00021046316,0.00018045877,0.0002291606],"domain_scores_gemma":[0.99951017,0.00017701286,0.000034037665,0.00008591256,0.00010915908,0.00008369231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005019603,0.00009001057,0.00009012685,0.00011171194,0.00023906915,0.000066169065,0.00009685444,0.000036342062,0.000009207227],"category_scores_gemma":[0.000089629495,0.00010254354,0.000022196718,0.00047164314,0.00008984158,0.00037416193,0.0000016063029,0.000059319576,0.0000017261268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053472013,0.0000038910316,0.0020274224,0.000018781224,0.000002525111,0.000001771205,0.0007489995,0.9693616,0.016736036,0.00049784454,8.1549814e-7,0.01059494],"study_design_scores_gemma":[0.00026312843,0.000015764224,0.0063472628,0.000022207922,0.000011727838,0.00000498601,0.00021811711,0.9878444,0.004919173,0.00015969346,0.0000630818,0.00013043093],"about_ca_topic_score_codex":0.000005764126,"about_ca_topic_score_gemma":0.0000139287595,"teacher_disagreement_score":0.3053885,"about_ca_system_score_codex":0.000039891926,"about_ca_system_score_gemma":0.000026156142,"threshold_uncertainty_score":0.4181604},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0132602200802881,"score_gpt":0.2520301703643327,"score_spread":0.23876995028404457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066086285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40345886,0.000022205839,0.59522957,0.000108926215,0.000036648224,0.00016146996,0.000008547915,0.00027117084,0.00070259447],"genre_scores_gemma":[0.6993262,0.000009007581,0.30053136,0.000020729709,0.000033754794,0.0000064568744,0.0000083385285,0.0000145226795,0.000049632145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987337,0.000023887946,0.00024679702,0.0002811087,0.00041328993,0.00030119935],"domain_scores_gemma":[0.99954194,0.000037194113,0.00003737911,0.0001255969,0.00013107252,0.00012679493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007404433,0.000120108896,0.000120438555,0.00011332133,0.00020952252,0.000084791456,0.00011745941,0.00004272021,0.000042224114],"category_scores_gemma":[0.000006815329,0.000113955524,0.00001391182,0.00076503254,0.00043581225,0.0007519018,0.0000036388094,0.00013943067,0.000019279772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065762774,0.000006806341,0.0069754487,0.000015836382,0.0000052608902,0.0000016227805,0.0011444127,0.87748104,0.0049848966,0.00040441414,0.00000449177,0.1089692],"study_design_scores_gemma":[0.00045465204,0.000031247175,0.021318605,0.000041008574,0.000012791558,0.000014405188,0.00024636718,0.96176505,0.015600466,0.00001719409,0.0003091231,0.0001890893],"about_ca_topic_score_codex":0.000016440328,"about_ca_topic_score_gemma":0.00001874969,"teacher_disagreement_score":0.29586735,"about_ca_system_score_codex":0.000075821925,"about_ca_system_score_gemma":0.00008055997,"threshold_uncertainty_score":0.46469715},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008531559982207816,"score_gpt":0.2504757629453988,"score_spread":0.241944202963191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070175767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9362587,0.00004656847,0.059129022,0.000092667804,0.00029552772,0.00026941326,0.000084212275,0.0005120963,0.003311824],"genre_scores_gemma":[0.99442893,0.000015581369,0.0048782276,0.000020377847,0.0001621533,0.000086575375,0.00020635092,0.000020992362,0.00018083096],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9988775,0.000003940287,0.00038191464,0.00024012664,0.0002108088,0.00028566382],"domain_scores_gemma":[0.9994972,0.000045811572,0.00004407871,0.00014990136,0.00019986836,0.000063191095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031382244,0.00012512428,0.000120704644,0.0001585358,0.0002976717,0.00005503831,0.00016787622,0.00004754966,0.00004061713],"category_scores_gemma":[0.000005801681,0.00013225226,0.0000572677,0.0008631092,0.00010367708,0.00057508453,8.0813743e-7,0.00007424433,0.000019837007],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024321844,0.00015672809,0.024796251,0.00031301388,0.00001907142,0.0000031314146,0.008408162,0.09976816,0.7106085,0.13903433,0.0010208327,0.015847502],"study_design_scores_gemma":[0.0006967941,0.000022302413,0.9334244,0.000043886714,0.00002955979,5.794515e-7,0.0005481395,0.03667202,0.021462277,0.0010770728,0.005667982,0.0003549972],"about_ca_topic_score_codex":0.00004166853,"about_ca_topic_score_gemma":0.00046973454,"teacher_disagreement_score":0.90862817,"about_ca_system_score_codex":0.00004631388,"about_ca_system_score_gemma":0.00006452577,"threshold_uncertainty_score":0.5393091},"labels":[],"label_agreement":null},{"id":"W2070596728","doi":"10.1287/trsc.2014.0560","title":"A Numerical Study of the Logit Network Pricing Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Logit; Flow network; Local optimum; Computer science; Mixed logit; Operations research; Logistic regression; Mathematics; Machine learning","score_opus":0.051917756121479815,"score_gpt":0.3266476400342023,"score_spread":0.2747298839127225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070596728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97896576,0.000014668471,0.0132353995,0.00041437897,0.00032991992,0.0005228145,0.0000021465455,0.00007811744,0.0064367796],"genre_scores_gemma":[0.9977683,0.0000013076572,0.0019804416,0.000053011572,0.000034467856,0.000011039386,0.0000023315656,0.0000037541233,0.0001453338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99827224,0.00008115627,0.0002700507,0.00019266715,0.00097358297,0.00021032667],"domain_scores_gemma":[0.99919415,0.000043203996,0.00016560547,0.00013433937,0.00035467773,0.00010800427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013760895,0.00005865774,0.00009320098,0.000050854105,0.0005032053,0.000037731203,0.00035906516,0.000027742948,0.00001335904],"category_scores_gemma":[0.00007766906,0.000043996002,0.00002490164,0.002123429,0.00034872396,0.0003626192,0.0000017890192,0.000071934344,0.0000030489598],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013770117,0.00010143733,0.43250173,0.0000029508308,0.000002691499,8.128142e-7,0.112466395,0.4475133,0.000020920168,0.0068278243,0.00009369123,0.00045446138],"study_design_scores_gemma":[0.000592118,0.00012489902,0.97161204,0.00002978976,0.000028501167,1.7423413e-7,0.023675622,0.0014930201,0.000082787825,0.001055066,0.0011733378,0.00013266865],"about_ca_topic_score_codex":0.0017431789,"about_ca_topic_score_gemma":0.0014577945,"teacher_disagreement_score":0.53911024,"about_ca_system_score_codex":0.000039399067,"about_ca_system_score_gemma":0.0005376509,"threshold_uncertainty_score":0.3870299},"labels":[],"label_agreement":null},{"id":"W2070782744","doi":"10.1287/trsc.35.2.192.10134","title":"Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dynamic programming; Product (mathematics); Operations research; Computer science; Routing (electronic design automation); Stochastic programming; Mathematical optimization; Point (geometry); Vehicle routing problem; Process (computing); Operations management; Engineering; Mathematics; Computer network","score_opus":0.03205989915677017,"score_gpt":0.31410429240534504,"score_spread":0.2820443932485749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070782744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5715195,0.000013934128,0.42807037,0.00000469162,0.00005692976,0.00012871221,8.8680605e-7,0.00017197033,0.000032987387],"genre_scores_gemma":[0.81408614,0.000002966645,0.18585628,0.000007848591,0.000007907536,0.000010277451,0.000006688552,0.000017734399,0.0000041646167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987268,0.000025637557,0.00032954407,0.00025738555,0.00030741777,0.00035323194],"domain_scores_gemma":[0.9995936,0.00002000522,0.00005270175,0.00013954216,0.000100117366,0.00009400604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007714935,0.000117606905,0.00011572557,0.0002738404,0.00015244949,0.000088118424,0.00020404642,0.00003921718,0.000012942523],"category_scores_gemma":[0.000027876997,0.00013573495,0.000018884562,0.001561387,0.00015123392,0.001036957,0.0000031901,0.00011712017,0.00000217717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030968067,0.000011876567,0.02470156,0.000015136204,0.0000010432716,0.000004445045,0.0031382605,0.9546834,0.008824826,0.00016173099,4.4946432e-8,0.008454545],"study_design_scores_gemma":[0.00017215185,0.0000149994585,0.03500145,0.000052949756,0.000006032474,0.0000036754248,0.0005447089,0.96373856,0.00022657374,0.000074506584,0.0000055493956,0.00015887208],"about_ca_topic_score_codex":0.00004953309,"about_ca_topic_score_gemma":0.00037939046,"teacher_disagreement_score":0.24256663,"about_ca_system_score_codex":0.00015568938,"about_ca_system_score_gemma":0.00007437539,"threshold_uncertainty_score":0.553511},"labels":[],"label_agreement":null},{"id":"W2074972460","doi":"10.1287/trsc.34.3.289.12299","title":"A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Tariff; Bilevel optimization; Mathematical optimization; Heuristic; Revenue; Schedule; Integer programming; Set (abstract data type); Integer (computer science); Computer science; Branch and bound; Class (philosophy); Operations research; Mathematics; Economics; Optimization problem; Finance","score_opus":0.01632194362349718,"score_gpt":0.24908545337920993,"score_spread":0.23276350975571275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074972460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003970245,0.000012955446,0.99418956,0.0010925417,0.00002331286,0.00019429874,0.000023719169,0.00007753307,0.0004158081],"genre_scores_gemma":[0.21154596,0.00001361163,0.7875404,0.0002826334,0.000012144202,0.00003644361,0.000019788216,0.000003314641,0.0005457382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987829,0.000009013092,0.00023626411,0.00041205893,0.00035679367,0.00020300843],"domain_scores_gemma":[0.99943554,0.000032269345,0.0000701681,0.00014416814,0.00022541812,0.00009242503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047645642,0.00008492692,0.0000888025,0.00015402654,0.00042109712,0.00016452404,0.00031592243,0.000029563935,0.00003855748],"category_scores_gemma":[0.000008370637,0.00007802624,0.000038079237,0.00088534865,0.00009287857,0.0013369534,0.000004886396,0.00003954342,0.0000061796222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064284,0.000083350475,0.0003318261,0.000016352451,0.000012276261,8.18315e-7,0.003712406,0.2330069,0.002074028,0.17372084,0.00010207413,0.5869327],"study_design_scores_gemma":[0.00025591138,0.000016779279,0.004993312,0.0000058624873,0.00000961164,9.570915e-7,0.000007074272,0.9832517,0.00019303431,0.010941572,0.0002153065,0.00010891369],"about_ca_topic_score_codex":0.0000326405,"about_ca_topic_score_gemma":0.00002356322,"teacher_disagreement_score":0.75024474,"about_ca_system_score_codex":0.000024199917,"about_ca_system_score_gemma":0.00018012093,"threshold_uncertainty_score":0.3238781},"labels":[],"label_agreement":null},{"id":"W2078415021","doi":"10.1287/trsc.1110.0398","title":"Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"","keywords":"Mathematical optimization; Robustness (evolution); Benders' decomposition; Benchmark (surveying); Enumeration; Reduction (mathematics); Decomposition; Linear programming; Scale (ratio); Integer programming; Mathematics; Computer science; Algorithm","score_opus":0.038280818502688885,"score_gpt":0.27657885353136896,"score_spread":0.23829803502868008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078415021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.474704,0.000017915001,0.5248524,0.00000809325,0.0000689233,0.00010899818,0.000011970365,0.000089079076,0.00013863671],"genre_scores_gemma":[0.86878157,0.0000029207933,0.13114524,0.0000075105763,0.000016118052,0.000012225108,0.000011159885,0.000012119245,0.000011117339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9989103,0.000022109873,0.00025308758,0.00014384981,0.00037671413,0.00029395003],"domain_scores_gemma":[0.99938697,0.00003742631,0.00008056591,0.00016565989,0.00023742772,0.00009194163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010555951,0.00009345533,0.00010935728,0.00012070552,0.00010915158,0.000013777031,0.00012469053,0.00004074573,0.000024091967],"category_scores_gemma":[0.000035446745,0.000087813736,0.000017782455,0.0010449329,0.00014953864,0.00095388026,0.0000017413375,0.00007646903,0.000005666554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045361976,0.000048003472,0.12757571,0.000106450534,0.0000044559997,5.5273517e-8,0.0074741896,0.7660756,0.09756491,0.0002986738,0.000004443696,0.00084296596],"study_design_scores_gemma":[0.0002951181,0.000017416418,0.62673575,0.000038337294,0.00001181389,9.3705006e-7,0.00016986707,0.28057927,0.09195728,0.000013980986,0.00005483202,0.0001253759],"about_ca_topic_score_codex":0.00002975921,"about_ca_topic_score_gemma":0.000106073734,"teacher_disagreement_score":0.49916005,"about_ca_system_score_codex":0.00005592358,"about_ca_system_score_gemma":0.00004356823,"threshold_uncertainty_score":0.358094},"labels":[],"label_agreement":null},{"id":"W2082715400","doi":"10.1287/trsc.1070.0206","title":"Passenger Flow Model for Airline Networks","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Aviation Industry Analysis and Trends","field":"Economics, Econometrics and Finance","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Flow network; Flow (mathematics); Variable (mathematics); Distribution (mathematics); Air travel; Travel time; Computer science; Transport engineering; Operations research; Aviation; Econometrics; Engineering; Economics; Mathematics; Mathematical optimization; Aerospace engineering","score_opus":0.09076692494924822,"score_gpt":0.25742615871488067,"score_spread":0.16665923376563246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082715400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07815315,0.000082426246,0.9197004,0.00038713161,0.00011655986,0.000076157325,0.00010913572,0.000028167651,0.0013468739],"genre_scores_gemma":[0.9904034,0.000037370435,0.0074347,0.000181179,0.00005384728,0.00002687858,0.00006620887,0.00000665698,0.0017897631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990398,0.0000014887698,0.000394895,0.00031152036,0.000058850852,0.00019341266],"domain_scores_gemma":[0.99949527,0.00001812672,0.00016685696,0.00015926763,0.0000861469,0.00007433627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003809034,0.000073203206,0.00015643147,0.0001546658,0.00035370525,0.0000221037,0.00016165881,0.000049715614,0.0001583906],"category_scores_gemma":[0.000020662776,0.00008035268,0.00008555529,0.0006154349,0.0001366025,0.00042131386,0.0000016223697,0.00006348659,0.000033031673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006693937,0.000038129034,0.047725,0.0000026860089,0.000008221759,8.9457467e-7,0.00059699995,0.8820557,0.000010171725,0.068617664,0.00050421833,0.00043362696],"study_design_scores_gemma":[0.0002251189,0.000010096975,0.08157781,0.0000013694963,0.0000041578064,3.9474364e-7,0.000012881151,0.9145925,0.000029153212,0.0022491931,0.0011970776,0.0001002531],"about_ca_topic_score_codex":0.000013419902,"about_ca_topic_score_gemma":0.000025093275,"teacher_disagreement_score":0.9122657,"about_ca_system_score_codex":0.000025177025,"about_ca_system_score_gemma":0.000039170038,"threshold_uncertainty_score":0.3276687},"labels":[],"label_agreement":null},{"id":"W2085285568","doi":"10.1287/trsc.1070.0195","title":"Vehicle Routing for Urban Snow Plowing Operations","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Université de Moncton","keywords":"Routing (electronic design automation); Truck; Vehicle routing problem; Heuristic; Flow network; Transport engineering; Computer science; Snow removal; Set (abstract data type); Class (philosophy); Level of service; Operations research; Fleet management; Snow; Flow routing; Engineering; Mathematical optimization; Computer network; Mathematics; Geography","score_opus":0.03569784321385178,"score_gpt":0.28784008291687985,"score_spread":0.25214223970302807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085285568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46571493,0.000012594274,0.53334886,0.000036920424,0.0001516186,0.00013898997,0.000008732014,0.0002681429,0.000319198],"genre_scores_gemma":[0.8423076,0.0000069429047,0.15745424,0.000045464934,0.000043764296,0.000028392538,0.000015427086,0.000018298819,0.000079838544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899894,0.000010450061,0.00026345468,0.00021016426,0.0002539284,0.00026307945],"domain_scores_gemma":[0.9995086,0.0000809144,0.000018797504,0.00014949677,0.00015670538,0.00008546307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005008678,0.00009306414,0.000100005345,0.00011681979,0.00055877044,0.000043660104,0.00018906283,0.000033379707,0.000018857085],"category_scores_gemma":[0.000121237594,0.000103083235,0.00004116287,0.000758339,0.00012712661,0.000632094,0.0000018565479,0.00007128504,0.000008917749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017817285,0.0000076905235,0.0056392127,0.000009163581,0.0000031891755,0.0000011577582,0.0038078884,0.9526523,0.035235837,0.0016157281,0.000052414267,0.000973681],"study_design_scores_gemma":[0.0003003446,0.000013468062,0.04173888,0.00001622171,0.000007997004,0.0000019475422,0.00013532082,0.9206492,0.036712583,0.000023222115,0.00023756266,0.00016329435],"about_ca_topic_score_codex":0.00000981692,"about_ca_topic_score_gemma":0.000014717638,"teacher_disagreement_score":0.3765927,"about_ca_system_score_codex":0.000051352003,"about_ca_system_score_gemma":0.000083347084,"threshold_uncertainty_score":0.4297667},"labels":[],"label_agreement":null},{"id":"W2086411701","doi":"10.1287/trsc.1100.0336","title":"Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"Canada Research Chairs","keywords":"Mathematical optimization; Computer science; Constraint (computer-aided design); Reduction (mathematics); Dynamic programming; Algorithm; Constraint programming; Stochastic programming; Mathematics","score_opus":0.056624502328832,"score_gpt":0.34097344120089756,"score_spread":0.2843489388720656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086411701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7939838,0.00001096083,0.20522316,0.000017812212,0.00026274694,0.00015769765,0.000004300852,0.00009179426,0.00024768987],"genre_scores_gemma":[0.8321443,0.000002026244,0.16781844,0.0000063396515,0.000016167955,0.0000035642008,0.0000011209379,0.000006839378,0.0000011708092],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990136,0.000017113429,0.00030032982,0.00016187821,0.0003207212,0.00018636018],"domain_scores_gemma":[0.99943376,0.0000785212,0.00008147131,0.00020621582,0.00015110732,0.000048954615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015606665,0.00007871571,0.00010151222,0.00006826027,0.00016557323,0.00004366863,0.00025113538,0.000032383665,0.000019585525],"category_scores_gemma":[0.00013542282,0.00006322387,0.00003315037,0.00082807784,0.0007174388,0.00032122392,0.0000028067066,0.00016603297,5.148631e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003849213,0.000015996966,0.072207116,0.000052690953,0.000004727264,9.907056e-7,0.0037998941,0.31876224,0.57456464,0.003257039,4.11155e-7,0.027330426],"study_design_scores_gemma":[0.00037797118,0.000019878802,0.27848777,0.000059050693,0.000031179563,0.00000684266,0.0011486888,0.49997488,0.21906956,0.00041329965,0.00011366282,0.00029724304],"about_ca_topic_score_codex":0.000024909978,"about_ca_topic_score_gemma":0.000104146195,"teacher_disagreement_score":0.35549507,"about_ca_system_score_codex":0.00002346628,"about_ca_system_score_gemma":0.000106017214,"threshold_uncertainty_score":0.26434332},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03983165338560238,"score_gpt":0.32306177551059817,"score_spread":0.28323012212499576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089938056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1697389,0.000025173786,0.8263348,0.0008040697,0.00017645922,0.00050347054,0.000016482254,0.00017000633,0.0022306473],"genre_scores_gemma":[0.94538784,0.00006753948,0.05357649,0.0003148917,0.00013863962,0.000101590085,0.00006597215,0.000017596407,0.00032946118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976872,0.0000293697,0.00031384744,0.00046326118,0.0009658864,0.00054041354],"domain_scores_gemma":[0.9990787,0.00015116937,0.00010027195,0.0001719613,0.00029820664,0.00019971518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011576597,0.00015468025,0.00017378465,0.00013983157,0.0012024504,0.000083703824,0.00026239658,0.00009089235,0.000112401925],"category_scores_gemma":[0.000037952483,0.00013705895,0.00006201145,0.001376298,0.00030503457,0.0005868076,4.321834e-7,0.00012216813,0.0000078883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018193561,0.00005282446,0.014309189,0.0000062709632,0.000008810323,0.000005078407,0.0076786326,0.85834837,0.000022689048,0.11852475,0.000018277688,0.0008431534],"study_design_scores_gemma":[0.0074152085,0.0020747865,0.36843076,0.0019340453,0.0008680411,0.0000059538424,0.030128019,0.43494034,0.00071979564,0.07963564,0.06949161,0.0043557826],"about_ca_topic_score_codex":0.00029604556,"about_ca_topic_score_gemma":0.0029591322,"teacher_disagreement_score":0.7756489,"about_ca_system_score_codex":0.00006567742,"about_ca_system_score_gemma":0.00041248652,"threshold_uncertainty_score":0.9248398},"labels":[],"label_agreement":null},{"id":"W2090864414","doi":"10.1287/trsc.1030.0067","title":"Issues in Real-Time Fleet Management","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Fleet management; Transport engineering; Operations research; Computer science; Engineering","score_opus":0.012522031910038967,"score_gpt":0.2703561003757492,"score_spread":0.2578340684657102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090864414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98485386,0.000011386853,0.004656317,0.00021861195,0.00010737713,0.00019337407,0.000011824094,0.00032381807,0.00962345],"genre_scores_gemma":[0.9930368,0.00008812477,0.0066214153,0.00003874454,0.000006522126,0.000027767885,0.00003770364,0.000007881043,0.00013503217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99912536,0.0000019152214,0.00025762894,0.00017008364,0.00026261446,0.00018239146],"domain_scores_gemma":[0.9997405,0.0000046916707,0.000014720742,0.00014560107,0.000047782974,0.000046703593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019818448,0.00007807465,0.000076687065,0.0002690888,0.00005252636,0.00002229095,0.00014790731,0.00002222228,0.000090740265],"category_scores_gemma":[0.0000017389966,0.00008577207,0.000018198883,0.0013634088,0.00010707567,0.00037329603,6.1693123e-7,0.000051606505,0.00008970105],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010964374,0.00013657803,0.009734894,0.000112654365,0.000014372356,0.000043049567,0.010407642,0.6904236,0.09230529,0.19252367,0.00010743209,0.0041798702],"study_design_scores_gemma":[0.0005636267,0.000011241704,0.98493403,0.000032110096,0.0000069159923,3.8418116e-7,0.00037223645,0.0005937841,0.0101385135,0.002176249,0.0010051213,0.00016579055],"about_ca_topic_score_codex":0.00009044802,"about_ca_topic_score_gemma":0.00036204924,"teacher_disagreement_score":0.9751991,"about_ca_system_score_codex":0.00006946752,"about_ca_system_score_gemma":0.000029654051,"threshold_uncertainty_score":0.34976837},"labels":[],"label_agreement":null},{"id":"W2091630182","doi":"10.1287/trsc.2014.0575","title":"Dynamic Facility Location with Generalized Modular Capacities","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Facility location problem; Flexibility (engineering); Software deployment; Computer science; Mathematical optimization; Schedule; Modular design; 1-center problem; Operations research; Dynamic programming; Linear programming; Mathematics","score_opus":0.03941980682832121,"score_gpt":0.2458820487372758,"score_spread":0.20646224190895457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091630182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94124436,0.000022666643,0.054400347,0.0007777397,0.00025238903,0.0002539684,0.0000068847426,0.00015737588,0.0028842622],"genre_scores_gemma":[0.99794185,0.000002607697,0.000864192,0.0006307568,0.000022195896,0.000030514795,0.00012062421,0.000004799746,0.00038247922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99850684,0.0000050620556,0.00023582767,0.00033319375,0.00070336123,0.00021570438],"domain_scores_gemma":[0.9989289,0.0000024939532,0.000060003804,0.00025650792,0.00072090275,0.00003121207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069108716,0.00011824294,0.000101577854,0.00022822387,0.00019681815,0.000136732,0.00025245707,0.000020406525,0.000115506635],"category_scores_gemma":[0.000040385225,0.00010158089,0.00002130821,0.0013712774,0.00040054694,0.0021316994,0.000006851476,0.000047133166,0.00027754586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032044871,0.0003473292,0.044094995,0.0006128449,0.00004084614,0.000011102934,0.006742914,0.7600478,0.004077106,0.17377545,0.0014581508,0.008471029],"study_design_scores_gemma":[0.0025687132,0.000055061617,0.50018954,0.000048339392,0.00010866788,9.667211e-7,0.010369083,0.43378136,0.00053349783,0.0058831736,0.045469113,0.0009924683],"about_ca_topic_score_codex":0.0021524695,"about_ca_topic_score_gemma":0.003226368,"teacher_disagreement_score":0.45609456,"about_ca_system_score_codex":0.00006529562,"about_ca_system_score_gemma":0.000102341684,"threshold_uncertainty_score":0.41423485},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.161385543755704,"score_gpt":0.3205551225706211,"score_spread":0.15916957881491708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096658257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15358473,0.00030870485,0.8444621,0.000008957581,0.00021884235,0.00018653141,0.00004075279,0.00015399013,0.0010354083],"genre_scores_gemma":[0.98855656,0.000017149341,0.011312264,0.000026370606,0.000033135886,0.000008679144,0.000020044472,0.0000066885164,0.000019092067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914247,0.0000025419217,0.00022139972,0.0001793142,0.00023863652,0.00021563146],"domain_scores_gemma":[0.9996327,0.000043444117,0.000026918335,0.00009550853,0.00011887793,0.0000825077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036679042,0.00009388474,0.00011394287,0.000076808974,0.0001345724,0.000053636544,0.0001105345,0.000037009737,0.000001661914],"category_scores_gemma":[0.000019766381,0.000092107926,0.000017838134,0.00022083381,0.00012477301,0.00027017895,4.1316423e-7,0.000061041086,4.805057e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058188048,0.0000055779233,0.0008730444,0.000041393556,0.0000022808222,0.0000022762704,0.0008052493,0.97346365,0.0023069426,0.02148173,0.000027076243,0.0009849536],"study_design_scores_gemma":[0.00020870192,0.000052726064,0.023658665,0.000027587497,0.000020859588,9.672341e-7,0.000107473745,0.9710458,0.00032215155,0.0043688854,0.000052160107,0.00013403314],"about_ca_topic_score_codex":0.0000052573178,"about_ca_topic_score_gemma":0.0000031650648,"teacher_disagreement_score":0.83497185,"about_ca_system_score_codex":0.000023262235,"about_ca_system_score_gemma":0.000029328205,"threshold_uncertainty_score":0.37560523},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01970802792664043,"score_gpt":0.2744546307225553,"score_spread":0.2547466027959149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098090443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13920365,0.000062392966,0.8595569,0.000088836845,0.00010744612,0.00034373847,0.000020570858,0.00023023009,0.0003862369],"genre_scores_gemma":[0.65739566,0.0000067842698,0.3423711,0.000023643734,0.00005229669,0.00003633793,0.000010282063,0.000016025751,0.00008782493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879557,0.000014905723,0.00026364153,0.00021712859,0.0003740411,0.0003347221],"domain_scores_gemma":[0.9993652,0.00018808915,0.000033953642,0.0001652816,0.00020167472,0.000045798966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306915,0.00009606065,0.000085381624,0.00008284735,0.0003764944,0.00010173165,0.00028364453,0.000033014454,0.000017008942],"category_scores_gemma":[0.000013018266,0.00008097542,0.000042316344,0.0008929421,0.00015399845,0.00034428254,0.0000034687466,0.0000982553,0.000007469143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001896534,0.000008540977,0.0014348266,0.000017327702,0.0000035891462,6.431303e-7,0.00057520735,0.91044915,0.010525182,0.0020381075,0.000035684065,0.07490982],"study_design_scores_gemma":[0.00021792519,0.000009224444,0.039293,0.000010857916,0.0000108612585,7.176306e-7,0.00013592058,0.9496039,0.01018211,0.00014414095,0.00028365717,0.00010765858],"about_ca_topic_score_codex":0.0001197365,"about_ca_topic_score_gemma":0.000033653436,"teacher_disagreement_score":0.51819205,"about_ca_system_score_codex":0.00005569974,"about_ca_system_score_gemma":0.00007224539,"threshold_uncertainty_score":0.33020818},"labels":[],"label_agreement":null},{"id":"W2099192488","doi":"10.1287/trsc.1060.0173","title":"Integrated Production-Inventory-Distribution System Design with Risk Pooling: Model Formulation and Heuristic Solution","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Safety stock; Mathematical optimization; Pooling; Integer programming; Heuristic; Linear programming; Computer science; Upper and lower bounds; Piecewise linear function; Relaxation (psychology); Mathematics; Supply chain","score_opus":0.03524095080698834,"score_gpt":0.23833021948593866,"score_spread":0.20308926867895033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099192488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40459964,0.000009200598,0.59455687,0.00009117455,0.00014083402,0.00030547913,0.000004047552,0.00012805752,0.00016470662],"genre_scores_gemma":[0.9972781,0.0000053599,0.0023742267,0.000043932883,0.00006150154,0.000016389438,0.00014986983,0.0000074093514,0.00006320299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985059,0.0000070521082,0.00033431238,0.00038319707,0.00052023807,0.0002493289],"domain_scores_gemma":[0.99913776,0.0000075489247,0.0001475699,0.00015649403,0.0005235891,0.000027015722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020869474,0.00012790033,0.000095731564,0.00025061454,0.0005658743,0.00013409748,0.00012405065,0.000031849988,0.000008007322],"category_scores_gemma":[0.00008524135,0.0001122851,0.000019436622,0.0012137209,0.00014060258,0.0017692196,0.0000057213397,0.000076705124,0.000022417133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004763889,0.00015487945,0.04340054,0.000541688,0.000024523877,0.000004155441,0.00087237277,0.813271,0.0037208162,0.12633069,0.00039997153,0.010802991],"study_design_scores_gemma":[0.00026768268,0.00001323109,0.10318419,0.000045637807,0.00006347579,6.206984e-7,0.0005629924,0.8946423,0.0003625891,0.00041821625,0.00027341564,0.00016566731],"about_ca_topic_score_codex":0.0008648383,"about_ca_topic_score_gemma":0.0010714305,"teacher_disagreement_score":0.5926785,"about_ca_system_score_codex":0.00012398713,"about_ca_system_score_gemma":0.0000564265,"threshold_uncertainty_score":0.45788535},"labels":[],"label_agreement":null},{"id":"W2099343322","doi":"10.1287/trsc.1090.0295","title":"A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo method; Vehicle routing problem; Mathematical optimization; Integer programming; Branching (polymer chemistry); Computer science; Routing (electronic design automation); Local search (optimization); Algorithm; Mathematics","score_opus":0.011128396429053071,"score_gpt":0.2433868474478958,"score_spread":0.2322584510188427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099343322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24174315,0.000016241182,0.75743777,0.000051108575,0.00017077717,0.00031553573,0.000012711893,0.00020793601,0.000044769833],"genre_scores_gemma":[0.7485476,5.5463795e-7,0.25129712,0.000025836971,0.000040926712,0.0000456007,0.0000028041404,0.000024585761,0.000014948345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987293,0.000010754309,0.0002653459,0.00027021588,0.00037051496,0.0003538551],"domain_scores_gemma":[0.9992231,0.0002235176,0.000066541055,0.00021068977,0.00018484012,0.00009129624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009933149,0.00014076295,0.00012577804,0.000081384875,0.00043931117,0.00012191941,0.0002960119,0.00003206537,0.0000066022826],"category_scores_gemma":[0.00003940117,0.00010665268,0.000037128317,0.00051507034,0.00027894147,0.0004497027,0.0000035818684,0.00022617764,0.0000016105074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004556594,0.000008796775,0.00014804606,0.000011982044,0.000006178949,8.6806364e-7,0.0010546325,0.89618254,0.009979462,0.00016079479,0.0000024810245,0.092439696],"study_design_scores_gemma":[0.0003911308,0.00003747437,0.0035272127,0.000026035455,0.000027306403,0.0000065017302,0.00014829835,0.987553,0.008030937,0.000055991793,0.000037606464,0.0001584921],"about_ca_topic_score_codex":0.000036684047,"about_ca_topic_score_gemma":0.0001564985,"teacher_disagreement_score":0.50680447,"about_ca_system_score_codex":0.000036065376,"about_ca_system_score_gemma":0.00007391199,"threshold_uncertainty_score":0.434917},"labels":[],"label_agreement":null},{"id":"W2100654121","doi":"10.1287/trsc.1110.0392","title":"Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Price elasticity of demand; Queueing theory; Operations research; Profit (economics); Computer science; Service (business); Variable (mathematics); Service level; Queue; Mathematical optimization; Economics; Engineering; Microeconomics; Marketing; Business; Computer network; Mathematics","score_opus":0.036240923766381786,"score_gpt":0.22766571457181337,"score_spread":0.19142479080543157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100654121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7137781,0.00003205646,0.28456664,0.00049928145,0.0001808134,0.0003827662,0.0000037927819,0.00014316339,0.00041341747],"genre_scores_gemma":[0.99854255,0.0000022424026,0.0010875502,0.00022000748,0.000050155293,0.000033323395,0.000040033014,0.000006005803,0.000018132176],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989905,0.0000065324034,0.00018686317,0.00021718962,0.00034934032,0.00024960918],"domain_scores_gemma":[0.999526,0.00001169615,0.00006645206,0.000116654446,0.00024813152,0.000031017866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007635427,0.000103977676,0.000088257,0.00013846715,0.0002941083,0.0001326783,0.000120212775,0.000019548215,0.000030593234],"category_scores_gemma":[0.000019487848,0.00008628657,0.000009204626,0.0010212197,0.000096169904,0.0022071996,0.0000073222936,0.000040414616,0.00007502067],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035076015,0.00017795712,0.5881407,0.0037689123,0.000052878466,0.000008229113,0.0026795743,0.13074923,0.005085637,0.26431248,0.000285306,0.0043883105],"study_design_scores_gemma":[0.00041306746,0.000009325739,0.93819225,0.00008367191,0.00008384683,0.000001256005,0.0014316224,0.05857603,0.00017545548,0.000043294003,0.00078138465,0.00020877595],"about_ca_topic_score_codex":0.00027806716,"about_ca_topic_score_gemma":0.00019546458,"teacher_disagreement_score":0.35005152,"about_ca_system_score_codex":0.000030715546,"about_ca_system_score_gemma":0.000021452113,"threshold_uncertainty_score":0.35186642},"labels":[],"label_agreement":null},{"id":"W2105200492","doi":"10.1287/trsc.1040.0109","title":"Route Choice on Transit Networks with Online Information at Stops","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Headway; Transit (satellite); Line (geometry); Set (abstract data type); Computer science; Queueing theory; Operations research; Transport engineering; Travel time; Public transport; Engineering; Computer network; Mathematics","score_opus":0.014884257003874827,"score_gpt":0.2855968884167197,"score_spread":0.2707126314128449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105200492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87884235,0.000018849358,0.108926825,0.0030568105,0.00020530164,0.00040152614,0.000101175,0.0003245582,0.008122598],"genre_scores_gemma":[0.9933638,0.000039557286,0.0045302324,0.00096049864,0.00010365079,0.000011574729,0.00039975872,0.0000074564546,0.0005834603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9981167,0.000029145283,0.0003129105,0.00024505163,0.000952725,0.00034347462],"domain_scores_gemma":[0.99914414,0.00007390188,0.00015345738,0.000146028,0.00029493327,0.0001875719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005092368,0.000126214,0.000112403264,0.00019886842,0.0009945175,0.00010811435,0.00025727882,0.00007182233,0.00015246168],"category_scores_gemma":[0.000027914835,0.000114117545,0.000034025557,0.0012000874,0.00042633418,0.0023464365,8.2874595e-7,0.00012879373,0.000042442567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089113455,0.000053657877,0.02402428,0.0000045339034,0.0000041304224,0.000001182098,0.020030325,0.9367772,0.00003061658,0.006490108,0.00010535029,0.012389554],"study_design_scores_gemma":[0.000987828,0.00011245214,0.88964206,0.00005227906,0.000029643112,6.0122903e-7,0.0015226033,0.015989726,0.0002006541,0.00001248847,0.091118366,0.0003313212],"about_ca_topic_score_codex":0.0005195041,"about_ca_topic_score_gemma":0.020962106,"teacher_disagreement_score":0.9207874,"about_ca_system_score_codex":0.00016990876,"about_ca_system_score_gemma":0.00026297453,"threshold_uncertainty_score":0.99690276},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.038218333922510804,"score_gpt":0.3652933841581758,"score_spread":0.327075050235665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106541949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056836594,0.00010594202,0.9419506,0.00003525378,0.00010816815,0.00020392211,0.0000050925037,0.00008271943,0.0006716806],"genre_scores_gemma":[0.4731925,0.000024530133,0.5267179,0.000016547381,0.0000020755335,0.000022899565,0.0000020891675,0.000007055757,0.000014360282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992991,0.000033183176,0.00021139185,0.0001842144,0.00009888987,0.00017323982],"domain_scores_gemma":[0.9996757,0.00007619391,0.00000946019,0.00009707337,0.000079503276,0.000062054845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013013805,0.00007375949,0.00009635251,0.00014499175,0.00010688421,0.00003685306,0.00007845369,0.000030719104,0.00001245588],"category_scores_gemma":[0.00005870279,0.00007957116,0.000017303231,0.00064095383,0.00007814565,0.0005103981,4.8727946e-7,0.000050301245,5.0016916e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.104475e-7,0.000004017404,0.00015731256,0.000012785732,0.0000012476597,1.2123576e-7,0.0011995642,0.95153314,0.01680601,0.026951343,0.0000011964713,0.0033323755],"study_design_scores_gemma":[0.00025003986,0.000007146253,0.0021549154,0.000006703304,0.0000066640405,7.262161e-7,0.00010333844,0.97616434,0.01888955,0.0021237088,0.00018520941,0.00010763486],"about_ca_topic_score_codex":0.0000067294804,"about_ca_topic_score_gemma":0.00004858137,"teacher_disagreement_score":0.4163559,"about_ca_system_score_codex":0.000021685466,"about_ca_system_score_gemma":0.000045407043,"threshold_uncertainty_score":0.3244818},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011913991363816104,"score_gpt":0.27806692144220835,"score_spread":0.26615293007839225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108538642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921557,0.000016918668,0.0036418498,0.00006745427,0.000051136718,0.00007540004,0.0000041386825,0.0002664549,0.0037209475],"genre_scores_gemma":[0.97521716,0.00012675543,0.024318278,0.000016215527,0.000011942799,0.0000030079427,0.0000075873136,0.00001057609,0.00028847848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991424,0.000018228522,0.00018652328,0.00017872403,0.00027345875,0.00020063327],"domain_scores_gemma":[0.9997445,0.000030557687,0.0000144906735,0.0001237028,0.000027568238,0.000059208513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004779069,0.000074588075,0.000087562374,0.00012223999,0.000094483905,0.000034687757,0.0001747615,0.000028859105,0.0005795666],"category_scores_gemma":[0.000010598161,0.0000804625,0.000017644943,0.00087618176,0.00007470615,0.0005738688,0.000001551604,0.00007043833,0.00011033525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054300776,0.00001094587,0.017223928,0.000010420426,9.577618e-7,0.000004474439,0.0029764324,0.90499544,0.052787356,0.000102806545,0.000024263476,0.021857515],"study_design_scores_gemma":[0.00024528836,0.000009672055,0.4469493,0.000032098014,0.0000033468114,3.6613645e-7,0.00007835457,0.5433169,0.008855324,0.00009483474,0.000261241,0.00015324507],"about_ca_topic_score_codex":0.00013591406,"about_ca_topic_score_gemma":0.000025005507,"teacher_disagreement_score":0.42972538,"about_ca_system_score_codex":0.00004901179,"about_ca_system_score_gemma":0.000017767625,"threshold_uncertainty_score":0.6345848},"labels":[],"label_agreement":null},{"id":"W2108693756","doi":"10.1287/trsc.1030.0061","title":"Economies of Scale in Empty Freight Car Distribution in Scheduled Railways","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Economies of scale; Tabu search; Flow network; Constraint (computer-aided design); Distribution (mathematics); Scale (ratio); Heuristic; Computer science; Transport engineering; Operations research; Mathematical optimization; Engineering; Economics; Mathematics; Microeconomics; Geography","score_opus":0.015025830092528251,"score_gpt":0.28379457351207643,"score_spread":0.2687687434195482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108693756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913255,0.000022929762,0.006771038,0.00037116735,0.00011043835,0.00018123034,0.000049006067,0.000032870328,0.0011358078],"genre_scores_gemma":[0.9980746,0.00004539914,0.0017052776,0.0000205819,0.000010846778,0.000011767001,0.000105019266,0.0000034597117,0.000023071838],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987292,0.000028524317,0.00040210914,0.00024549456,0.00035671517,0.00023794542],"domain_scores_gemma":[0.99955535,0.00003130036,0.0001207182,0.00009291104,0.00012799616,0.000071699185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009504377,0.00007260459,0.0001389052,0.00023287954,0.0001712484,0.00002695677,0.00019815828,0.00006387467,0.000041889485],"category_scores_gemma":[0.00005512607,0.000080240796,0.0000304176,0.0015045996,0.00057197636,0.0008259957,9.276348e-7,0.00008223732,0.000005600254],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034201756,0.00010629033,0.7027652,0.000016268981,0.000001346949,0.0000032772193,0.047572084,0.17487326,0.0015177769,0.072674826,0.0000031139043,0.00043233536],"study_design_scores_gemma":[0.0007030621,0.000015311634,0.9894082,0.000053242446,0.0000037107452,7.137579e-8,0.003970272,0.00019286748,0.003543752,0.0019072713,0.00009888102,0.00010338723],"about_ca_topic_score_codex":0.0037934422,"about_ca_topic_score_gemma":0.043953303,"teacher_disagreement_score":0.28664294,"about_ca_system_score_codex":0.00017303058,"about_ca_system_score_gemma":0.00054985343,"threshold_uncertainty_score":0.9734921},"labels":[],"label_agreement":null},{"id":"W2110804857","doi":"10.1287/trsc.1100.0349","title":"A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Integer programming; Pairwise comparison; Scheduling (production processes); Computer science; Linear programming relaxation; Mathematical optimization; Linear programming; Train; Schedule; Graph; Routing (electronic design automation); Mathematics; Theoretical computer science; Artificial intelligence; Geography; Computer network","score_opus":0.019277741198247468,"score_gpt":0.24031102186300446,"score_spread":0.221033280664757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110804857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48953912,0.000014035957,0.5095919,0.000052635183,0.00012858585,0.00012180947,0.00002533239,0.0001231252,0.00040349274],"genre_scores_gemma":[0.86740035,0.0000014917925,0.13242859,0.000020051171,0.00005276432,0.000012823262,0.0000074986415,0.000013406289,0.00006304396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894124,0.000003250264,0.00027146997,0.00025804024,0.00022584446,0.0003001243],"domain_scores_gemma":[0.999428,0.00005802832,0.000036698242,0.00023397908,0.000057291538,0.00018601198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005985675,0.00012427587,0.00013827125,0.000097769975,0.00022082387,0.000080571124,0.00028003595,0.00006537439,0.000006828253],"category_scores_gemma":[0.00008830952,0.00012274842,0.000039146074,0.00024602085,0.00016856342,0.00029117044,0.0000034600616,0.00013819878,8.665206e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048837005,0.0000053692524,0.00019123199,0.00002646977,0.0000028698594,5.023104e-7,0.0052758763,0.8955615,0.08377123,0.0055603017,0.00002554496,0.009574191],"study_design_scores_gemma":[0.0005818638,0.000009404783,0.0029298537,0.000016583044,0.000007424067,0.0000019332388,0.00019641247,0.9934136,0.0021674552,0.00021927535,0.00030217064,0.00015398246],"about_ca_topic_score_codex":0.000057706897,"about_ca_topic_score_gemma":0.0003472697,"teacher_disagreement_score":0.3778612,"about_ca_system_score_codex":0.000012259632,"about_ca_system_score_gemma":0.000095947384,"threshold_uncertainty_score":0.50055355},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029736884155051848,"score_gpt":0.3035717216101579,"score_spread":0.27383483745510606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111837930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9550395,0.000020444875,0.008194485,0.015909338,0.0001507307,0.00064050785,0.000052332496,0.000091239046,0.019901415],"genre_scores_gemma":[0.99579924,0.000019569585,0.0013135263,0.0005137892,0.000012974734,0.000032673168,0.000010420339,0.000004751571,0.0022930638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984139,0.000063298634,0.00024731935,0.00022289102,0.0007756781,0.0002769085],"domain_scores_gemma":[0.9992482,0.00017775572,0.000074833784,0.00022025079,0.00019622229,0.00008271756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013448679,0.0000722142,0.00007087863,0.00007483958,0.0009807644,0.000064251646,0.0005616496,0.000029046072,0.00054117164],"category_scores_gemma":[0.00006352465,0.00004585813,0.000040767925,0.0016406741,0.0007544695,0.0003315608,0.000001317215,0.00008269637,0.00007515631],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063327265,0.00009371269,0.0021611224,0.000009577541,0.000007200699,0.0000012958888,0.099541076,0.3373237,0.0014312452,0.5519986,0.0009463374,0.0064227744],"study_design_scores_gemma":[0.00072450103,0.00034052835,0.8752729,0.0002910999,0.00009623436,0.0000010706959,0.019847516,0.010195416,0.0015268497,0.015115853,0.07579744,0.00079053035],"about_ca_topic_score_codex":0.00051628967,"about_ca_topic_score_gemma":0.0028429157,"teacher_disagreement_score":0.87311184,"about_ca_system_score_codex":0.000033077118,"about_ca_system_score_gemma":0.0002787877,"threshold_uncertainty_score":0.7543346},"labels":[],"label_agreement":null},{"id":"W2111891958","doi":"10.1287/trsc.1110.0379","title":"Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew; Crew scheduling; Column generation; Set cover problem; Operations research; Computer science; Context (archaeology); Scheduling (production processes); Constraint (computer-aided design); Schedule; Set (abstract data type); Engineering; Mathematical optimization; Aeronautics; Operations management; Mathematics","score_opus":0.022086663682596548,"score_gpt":0.25354447872781116,"score_spread":0.23145781504521462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111891958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3977377,0.00006712984,0.6010334,0.000021295367,0.000090203066,0.00011491752,0.00001558935,0.00023025041,0.0006895247],"genre_scores_gemma":[0.8826872,0.00004744689,0.11715522,0.000028134411,0.0000034729674,0.000009509252,0.00002615451,0.000013364196,0.000029511173],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989925,0.00002281689,0.0002884466,0.00023813848,0.00025355603,0.00020456703],"domain_scores_gemma":[0.99958473,0.00003196447,0.000054177635,0.0001223201,0.00009631609,0.0001104617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064049696,0.000121089506,0.00011094707,0.00012021971,0.000110298315,0.000040191982,0.0001264502,0.00004429717,0.00010840378],"category_scores_gemma":[0.000037259324,0.00012185838,0.000018040566,0.0005417436,0.00026458816,0.00039933276,0.0000025714935,0.00010246933,0.000005482142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037483336,0.00012385167,0.023083936,0.00021450857,0.000051914765,0.000017762028,0.018835336,0.17130738,0.42249426,0.0041313926,0.00013166813,0.3595705],"study_design_scores_gemma":[0.0005356836,0.00005403106,0.08862447,0.00010171938,0.000028388456,0.0000053422928,0.000746094,0.8359214,0.07317291,0.00028133838,0.00016070942,0.0003679128],"about_ca_topic_score_codex":0.000029944003,"about_ca_topic_score_gemma":0.000024283192,"teacher_disagreement_score":0.664614,"about_ca_system_score_codex":0.000073873714,"about_ca_system_score_gemma":0.00004540226,"threshold_uncertainty_score":0.49692407},"labels":[],"label_agreement":null},{"id":"W2113430343","doi":"10.1287/trsc.36.3.349.7830","title":"A Note on the Single Leg, Multifare Seat Allocation Problem","year":2002,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Equivalence (formal languages); Mathematical optimization; Class (philosophy); Computer science; Operations research; Mathematics; Mathematical economics; Artificial intelligence; Discrete mathematics","score_opus":0.03694083480874411,"score_gpt":0.2434600770170304,"score_spread":0.2065192422082863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113430343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9469476,0.00003014828,0.034820314,0.0033731882,0.0003180254,0.0006701521,0.000058272293,0.0006779593,0.013104388],"genre_scores_gemma":[0.9977491,0.000010286687,0.0016255802,0.0003080794,0.000016450396,0.00006147441,0.000030243526,0.000012270717,0.00018654695],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99892503,0.000006968649,0.00026361624,0.00020585918,0.00039801383,0.00020053316],"domain_scores_gemma":[0.9994639,0.0000482663,0.000032941738,0.00023835272,0.00015971062,0.00005679535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021597408,0.000108477216,0.00006883839,0.00012670126,0.00024055055,0.000056899982,0.00021335176,0.0000345252,0.0003152709],"category_scores_gemma":[0.000016254307,0.000086811415,0.000033162596,0.0011538721,0.00018378564,0.0003803966,6.176274e-7,0.000118425574,0.00013355371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015957441,0.00047222298,0.002832205,0.00012367307,0.00002816717,0.000007041609,0.034527063,0.36632025,0.37502468,0.14470573,0.0024731976,0.073469825],"study_design_scores_gemma":[0.001542429,0.00023410769,0.535302,0.00017483965,0.00007555524,0.000004185919,0.0018306458,0.21805751,0.17808555,0.0012617941,0.062229574,0.0012018002],"about_ca_topic_score_codex":0.000011922419,"about_ca_topic_score_gemma":0.0002508715,"teacher_disagreement_score":0.5324698,"about_ca_system_score_codex":0.000059682483,"about_ca_system_score_gemma":0.000017937542,"threshold_uncertainty_score":0.35400668},"labels":[],"label_agreement":null},{"id":"W2113717470","doi":"10.1287/trsc.1090.0313","title":"Cross-National Differences in Aviation Safety Records","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Aviation Industry Analysis and Trends","field":"Economics, Econometrics and Finance","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"China; Developing country; Aviation; Developed country; Population; World population; Geography; Demography; Environmental health; Economic growth; Medicine; Engineering; Economics","score_opus":0.05015174552519636,"score_gpt":0.28760396676789896,"score_spread":0.2374522212427026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113717470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97493374,0.000010708345,0.0046418556,0.00039520962,0.00037191427,0.00005097041,0.00011048571,0.000019665373,0.019465469],"genre_scores_gemma":[0.9982831,0.000008308255,0.0005741049,0.00007091694,0.000047271275,0.000011332765,0.0000483304,0.0000037263985,0.00095289235],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987735,0.000004116666,0.00056703755,0.000346361,0.00014428445,0.00016469482],"domain_scores_gemma":[0.9994194,0.00003205771,0.00024516828,0.00012436716,0.00012000398,0.000059033],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011537482,0.00007434431,0.0001463349,0.00039771732,0.00017878345,0.00010171533,0.00022733788,0.00006928292,0.001754456],"category_scores_gemma":[0.00011551788,0.00008178131,0.00004505728,0.0012033484,0.00019629416,0.00086658244,0.0000027909696,0.0001819439,0.00014668025],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033184576,0.000024374878,0.7491297,0.0000011701027,0.0000015748159,2.7524453e-7,0.00021283612,0.0001277245,0.00007599069,0.249988,0.0000057374027,0.0004292871],"study_design_scores_gemma":[0.00022312705,0.0000073185015,0.9792358,0.0000020899429,0.0000010156069,2.388557e-7,0.000021174097,0.002572862,0.000100346,0.016636647,0.001099717,0.00009966406],"about_ca_topic_score_codex":0.00020878596,"about_ca_topic_score_gemma":0.0008400929,"teacher_disagreement_score":0.23335135,"about_ca_system_score_codex":0.000047993894,"about_ca_system_score_gemma":0.000071598755,"threshold_uncertainty_score":0.9991581},"labels":[],"label_agreement":null},{"id":"W2113900306","doi":"10.1287/trsc.2014.0576","title":"The Hub Line Location Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University; Université de Montréal","funders":"","keywords":"Mathematical optimization; Solver; Benders' decomposition; Benchmark (surveying); Routing (electronic design automation); Path (computing); Computer science; Line (geometry); Minification; Decomposition; Network planning and design; Scheme (mathematics); Set (abstract data type); Mathematics; Computer network","score_opus":0.03745478217311991,"score_gpt":0.3004402146947597,"score_spread":0.26298543252163975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113900306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0934992,0.00012249117,0.9015796,0.0003418726,0.0003528523,0.00017596262,0.0000019233207,0.0003868441,0.003539233],"genre_scores_gemma":[0.93868595,0.000014017157,0.061099596,0.000025220883,0.000025040488,0.00001245183,0.0000047945023,0.000008792877,0.00012413126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991965,0.000014121886,0.00018266811,0.00011222332,0.0003385622,0.00015590293],"domain_scores_gemma":[0.99939394,0.000039094364,0.000028651857,0.00014908075,0.0003021547,0.00008707291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012575994,0.00005636527,0.000044620687,0.00004967719,0.00015535853,0.00006843024,0.0002101895,0.000019689991,0.00000361182],"category_scores_gemma":[0.00007278987,0.000043823347,0.000010105149,0.0010409639,0.00014197291,0.00031910517,0.0000015244264,0.000060792987,0.000025087189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019273134,0.0000031291686,0.00071748183,0.000005793887,0.0000011663814,2.3831124e-7,0.0011034713,0.9849864,0.0013238102,0.0028345399,0.000091233196,0.008930758],"study_design_scores_gemma":[0.0003605176,0.00003182766,0.025685368,0.000018585826,0.000009824133,0.0000016768872,0.00047725465,0.9502971,0.015774854,0.0017173104,0.0054286323,0.00019701383],"about_ca_topic_score_codex":0.000006946537,"about_ca_topic_score_gemma":0.000026739217,"teacher_disagreement_score":0.84518677,"about_ca_system_score_codex":0.00004729875,"about_ca_system_score_gemma":0.000105486084,"threshold_uncertainty_score":0.17870642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023895904420274276,"score_gpt":0.2914730769878286,"score_spread":0.2675771725675543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114217004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14229122,0.000017844986,0.85670435,0.00007490492,0.00004131172,0.00046944528,0.00002747077,0.00023137953,0.00014204421],"genre_scores_gemma":[0.88691163,0.0000015891128,0.11294023,0.000048808688,0.000024667137,0.000029134919,0.000015260748,0.000018556597,0.000010127959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985729,0.000028862012,0.00024900105,0.0002830715,0.00041957543,0.0004465978],"domain_scores_gemma":[0.999125,0.00019997198,0.000050030245,0.00021447639,0.00029338605,0.000117155185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013048947,0.0001411256,0.0001279855,0.000117211806,0.00047315372,0.00009749724,0.0003097841,0.00003438324,0.000013512876],"category_scores_gemma":[0.000042120002,0.00010450398,0.000026223188,0.0010509252,0.00014584011,0.000446797,0.000001181684,0.00015502519,0.0000020563173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032062493,0.000020996613,0.00022888601,0.000010043705,0.000006554916,9.940894e-7,0.0045611276,0.9843597,0.0022915108,0.0053835018,0.000001513205,0.0031031119],"study_design_scores_gemma":[0.00049273035,0.00023499195,0.04416442,0.000032240143,0.0000290821,0.0000023177304,0.0009517677,0.9525621,0.0011053594,0.00026558994,0.000002207985,0.0001571774],"about_ca_topic_score_codex":0.000010451387,"about_ca_topic_score_gemma":0.00004127217,"teacher_disagreement_score":0.7446204,"about_ca_system_score_codex":0.00004915846,"about_ca_system_score_gemma":0.000103553895,"threshold_uncertainty_score":0.42615488},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03499057401878422,"score_gpt":0.29746752266634596,"score_spread":0.26247694864756177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114778474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055413693,0.000059898302,0.99240035,0.00021108547,0.0003969904,0.00068149006,0.000019574922,0.0002737637,0.0004154929],"genre_scores_gemma":[0.76569545,0.0000046554974,0.23403175,0.000036744677,0.000091794784,0.00008215562,0.000015190531,0.000021201267,0.000021068136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863297,0.000030981402,0.00025878276,0.00021170323,0.00039690424,0.00046863122],"domain_scores_gemma":[0.99910975,0.00022916106,0.0000536933,0.00020084312,0.00031655017,0.0000900303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024045557,0.00011636639,0.00009200938,0.00011657426,0.00051947916,0.00005840567,0.0002213267,0.0000396207,0.000033646615],"category_scores_gemma":[0.00010924184,0.00009618169,0.00004085985,0.0011888704,0.00011319648,0.0007353006,0.0000027116157,0.000112994916,0.000004459044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070288065,0.000020212967,0.005418184,0.000018935205,0.0000051377965,3.3194443e-8,0.0017372979,0.98708355,0.00079914776,0.0036720287,0.000013054364,0.0012253645],"study_design_scores_gemma":[0.00019530977,0.000014133483,0.009277255,0.0000184983,0.000020684825,3.698176e-7,0.0004156358,0.97929585,0.010561711,0.000012447507,0.00006210696,0.0001260088],"about_ca_topic_score_codex":0.000004827231,"about_ca_topic_score_gemma":0.0000047203725,"teacher_disagreement_score":0.76015407,"about_ca_system_score_codex":0.000079494195,"about_ca_system_score_gemma":0.00010510822,"threshold_uncertainty_score":0.39954662},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014021572184757499,"score_gpt":0.24713416884135248,"score_spread":0.23311259665659498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116675171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6929827,0.000047585945,0.29861128,0.00026616466,0.00010104465,0.00031925394,0.000018577268,0.0009288674,0.0067245187],"genre_scores_gemma":[0.7557557,0.00000676918,0.2438504,0.00005013641,0.00004741929,0.000009840936,0.000010188195,0.000021984559,0.0002475348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986026,0.000017905584,0.00031435338,0.00026117024,0.0004691232,0.00033482898],"domain_scores_gemma":[0.99942154,0.000042913685,0.000062647545,0.00020053446,0.00015331103,0.00011906027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079093274,0.00013731662,0.00014066212,0.00010848509,0.0002946833,0.00006350031,0.00023238914,0.000036755402,0.00011514639],"category_scores_gemma":[0.00002612254,0.00012782622,0.000024316283,0.0010131998,0.00016320999,0.00061530503,0.0000041092567,0.00012613957,0.00005783337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004458878,0.000016074777,0.0018288757,0.000010072606,0.000007027676,0.0000017499744,0.0012422916,0.9810138,0.008563874,0.0008517219,0.000060448732,0.006399646],"study_design_scores_gemma":[0.0005137626,0.000052208365,0.014826594,0.000047515525,0.00003268174,0.0000040894856,0.0000642402,0.9491122,0.029739162,0.000048370424,0.0052072774,0.00035193903],"about_ca_topic_score_codex":0.000004090481,"about_ca_topic_score_gemma":0.00001343158,"teacher_disagreement_score":0.06277303,"about_ca_system_score_codex":0.00006120914,"about_ca_system_score_gemma":0.000076331526,"threshold_uncertainty_score":0.5212602},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018662796349693887,"score_gpt":0.2654168289073473,"score_spread":0.2467540325576534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118493070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13911696,0.000004381867,0.85968906,0.000050836436,0.00011950742,0.00032727065,0.000005574514,0.00012512844,0.0005612897],"genre_scores_gemma":[0.5239498,0.0000030099998,0.4759408,0.00005418114,0.000011115352,0.000020952435,0.0000036009858,0.000007666361,0.000008867524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992946,0.000007706424,0.00012999124,0.00018333015,0.00017433289,0.0002100773],"domain_scores_gemma":[0.9995881,0.00008134823,0.000028605977,0.00011458173,0.00011231898,0.000075054355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008165037,0.0000796364,0.00007284887,0.00005250269,0.00012939525,0.000053398424,0.00012504788,0.000027131819,0.00001558327],"category_scores_gemma":[0.000008294082,0.000075270174,0.000007261023,0.00063836225,0.00013671734,0.0002444319,0.0000015122727,0.00007087333,0.0000014995917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010947616,0.0000052833043,0.002535826,0.00008036677,0.000008399174,0.0000010040443,0.0004683039,0.9769722,0.0068046274,0.004428421,0.000023660905,0.008660912],"study_design_scores_gemma":[0.0011872469,0.000048547387,0.28222385,0.000058215042,0.000052613796,0.00000942902,0.00012423056,0.7078208,0.0063144662,0.0010877997,0.00066787604,0.00040495876],"about_ca_topic_score_codex":0.0000012784587,"about_ca_topic_score_gemma":0.000018042914,"teacher_disagreement_score":0.38483286,"about_ca_system_score_codex":0.00000799063,"about_ca_system_score_gemma":0.000027934053,"threshold_uncertainty_score":0.30694285},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01091285829767171,"score_gpt":0.23968207380273326,"score_spread":0.22876921550506155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119097848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6775494,0.00018329013,0.3215188,0.00019905934,0.000011464541,0.00029670133,0.000004316721,0.000067289686,0.00016962356],"genre_scores_gemma":[0.92288107,0.00006746071,0.07691897,0.000072496485,0.0000075939774,0.000008389613,0.0000014809639,0.0000056628073,0.00003686295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9995002,0.0000055928076,0.000099096265,0.00015093856,0.00011998752,0.0001241826],"domain_scores_gemma":[0.9997118,0.000092391674,0.00002188296,0.00006679288,0.00005803681,0.000049087655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038839265,0.00006603267,0.000066138215,0.000041948857,0.00016096549,0.00006141806,0.00005842203,0.000018126068,0.0000027160302],"category_scores_gemma":[0.000009582536,0.0000475064,0.000005183922,0.00025534345,0.00013955141,0.00030565812,0.0000010716709,0.000040926127,2.8832815e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012152089,0.000032727625,0.0329287,0.00025145346,0.000033076623,0.0000027984256,0.017130813,0.632996,0.095473446,0.0038886087,0.000077862715,0.217063],"study_design_scores_gemma":[0.00073577155,0.0001108025,0.56044465,0.000037190523,0.00003384678,0.000009906421,0.00008122937,0.43415314,0.0035654097,0.00034561648,0.00029517693,0.0001872722],"about_ca_topic_score_codex":0.0000032495695,"about_ca_topic_score_gemma":0.000007943318,"teacher_disagreement_score":0.52751595,"about_ca_system_score_codex":0.0000065628715,"about_ca_system_score_gemma":0.000020665844,"threshold_uncertainty_score":0.19372548},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014639070204195309,"score_gpt":0.30146552957011996,"score_spread":0.28682645936592466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120324231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36586675,0.000020079997,0.63288754,0.0000987526,0.00026941433,0.0002473509,0.0000041051076,0.00024916575,0.00035686372],"genre_scores_gemma":[0.5633854,0.0000029210175,0.4364673,0.000047885453,0.000024532352,0.000027263211,0.0000041333246,0.000012889675,0.000027675158],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989399,0.00001906516,0.0002657166,0.00026819465,0.00022866816,0.0002785101],"domain_scores_gemma":[0.999392,0.00014496328,0.00005904526,0.00014281775,0.00015841732,0.00010279943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016751939,0.000114515205,0.00012608999,0.00013770735,0.00017942941,0.00006855739,0.00019044543,0.000056373963,0.0000119037],"category_scores_gemma":[0.00014940264,0.00011688228,0.000036529877,0.0005923208,0.00011122812,0.0004331852,0.0000035806236,0.00021943946,0.0000016799821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019438807,0.0000174094,0.0053212056,0.00019167538,0.000013511842,0.0000010359746,0.0076564006,0.08667129,0.8380628,0.02357883,0.000029847328,0.038436525],"study_design_scores_gemma":[0.0004533272,0.000016342643,0.020126792,0.000023085686,0.000016560307,0.000004569186,0.00006849939,0.9366684,0.040751226,0.0012614914,0.00037719344,0.0002325324],"about_ca_topic_score_codex":0.000016959291,"about_ca_topic_score_gemma":0.00007221307,"teacher_disagreement_score":0.8499971,"about_ca_system_score_codex":0.000022828188,"about_ca_system_score_gemma":0.00006859994,"threshold_uncertainty_score":0.47663212},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007078761078080346,"score_gpt":0.23236681254588554,"score_spread":0.2252880514678052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124521189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40895444,0.000037670863,0.59053016,0.000016579053,0.000027514903,0.00013348942,0.000004301456,0.00020329212,0.00009258614],"genre_scores_gemma":[0.7973598,0.0000020378131,0.20256226,0.000009747837,0.000010917098,0.000012442884,0.000008424914,0.000020221507,0.000014149276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987832,0.000015898751,0.00028051483,0.00029300878,0.0002819829,0.00034542108],"domain_scores_gemma":[0.99953115,0.00012025082,0.00006344202,0.00012970215,0.00007771167,0.00007775576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059059187,0.0001394972,0.00014088648,0.00015762886,0.0002982622,0.00012625512,0.00012497121,0.000029124554,0.0000076032625],"category_scores_gemma":[0.00004705997,0.0001356131,0.000015361551,0.00083518244,0.00019356307,0.000430091,0.000003961273,0.00011917619,0.0000025082163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039868323,0.0000072700113,0.007552402,0.000036991773,0.0000020097175,0.0000021027215,0.0010408034,0.97701234,0.011779529,0.000578828,0.0000011618315,0.001982579],"study_design_scores_gemma":[0.00028495194,0.000017752065,0.075048156,0.000077622295,0.000014937448,0.000004652425,0.00010634858,0.92357314,0.00039675162,0.00028596108,0.000006059617,0.00018367058],"about_ca_topic_score_codex":0.00015246787,"about_ca_topic_score_gemma":0.00027884822,"teacher_disagreement_score":0.38840535,"about_ca_system_score_codex":0.000077597106,"about_ca_system_score_gemma":0.00005781316,"threshold_uncertainty_score":0.55301416},"labels":[],"label_agreement":null},{"id":"W2125118005","doi":"10.1287/trsc.1120.0447","title":"Using Large Driving Record Samples and a Stochastic Approach for Real-World Driving Cycle Construction: Winnipeg Driving Cycle","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle emissions and performance","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba; Invenia (Canada)","funders":"AUTO21 Network of Centres of Excellence; Manitoba Hydro; University of Winnipeg","keywords":"Driving cycle; Powertrain; Automotive engineering; Engineering; Sample (material); Transport engineering; Computer science; Electric vehicle","score_opus":0.035241575952415644,"score_gpt":0.28371945900025664,"score_spread":0.248477883047841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125118005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60804135,0.000035177476,0.3911759,0.00000731812,0.00021986381,0.00015274137,0.000010481225,0.00011511793,0.00024203428],"genre_scores_gemma":[0.8950287,0.00002210793,0.10473152,0.000009660499,0.0001318748,0.000023446055,0.000011438474,0.000024031504,0.000017204442],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985629,0.000009479511,0.00032234882,0.00028326432,0.00025855226,0.0005634894],"domain_scores_gemma":[0.9993618,0.00008612625,0.000075996,0.00018044928,0.00007052057,0.00022510905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006179068,0.000167267,0.00018644497,0.00022251184,0.0006170953,0.0000869751,0.00015041197,0.000048033606,0.00002787031],"category_scores_gemma":[0.000027353104,0.0001721359,0.000041770953,0.00071293645,0.00017750794,0.0013178728,0.000008815603,0.00013095106,0.0000012873713],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010043133,0.00006114891,0.6793479,0.00023895565,0.00002228443,6.902634e-7,0.006803607,0.22393137,0.068338305,0.0037693682,0.000016534816,0.01745984],"study_design_scores_gemma":[0.0002573023,0.000009731104,0.3520058,0.000087542845,0.000024203617,0.00000686065,0.0005297606,0.6455722,0.0009774885,0.000088822824,0.00019148838,0.0002487672],"about_ca_topic_score_codex":0.000054476885,"about_ca_topic_score_gemma":0.00014883072,"teacher_disagreement_score":0.42164084,"about_ca_system_score_codex":0.00007380434,"about_ca_system_score_gemma":0.0000497447,"threshold_uncertainty_score":0.7019498},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012469214015357563,"score_gpt":0.2430320924813416,"score_spread":0.23056287846598406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126475333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06856596,0.0000465425,0.9293441,0.000048096008,0.000087511595,0.00027973903,0.00001835894,0.00017939965,0.0014302601],"genre_scores_gemma":[0.9046504,0.0000060516472,0.09512366,0.000018016963,0.000023764143,0.0000197302,0.000019483929,0.000010196524,0.0001286978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993468,0.0000028223349,0.00015268686,0.00014721563,0.0001529128,0.00019756629],"domain_scores_gemma":[0.9997751,0.000025379628,0.000017149094,0.0000494667,0.0000896984,0.00004318941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032017153,0.0000645819,0.00006629786,0.00009107279,0.00014106826,0.00007875682,0.000063595326,0.000021606176,0.000009703219],"category_scores_gemma":[0.0000029388684,0.00006443155,0.000014384014,0.0003647553,0.000077501485,0.0002720483,0.0000011026247,0.00004239432,0.0000017788133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006441535,0.000027960874,0.012576284,0.00018539546,0.00000967353,0.0000030820263,0.0047852346,0.8440365,0.043492574,0.030774545,0.00019536576,0.06390691],"study_design_scores_gemma":[0.00043746675,0.00001764206,0.011113876,0.00002971446,0.0000062723266,0.0000015709926,0.00011748228,0.9811672,0.005942456,0.00035144843,0.0006722938,0.00014256629],"about_ca_topic_score_codex":0.000050876828,"about_ca_topic_score_gemma":0.000042444768,"teacher_disagreement_score":0.8360844,"about_ca_system_score_codex":0.000019944904,"about_ca_system_score_gemma":0.000027420145,"threshold_uncertainty_score":0.26274425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019102653731363887,"score_gpt":0.26441347945848326,"score_spread":0.24531082572711937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127654349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91944027,0.000012249998,0.07885283,0.0000110752435,0.00012394694,0.000080624704,0.0000015690118,0.00012992207,0.001347537],"genre_scores_gemma":[0.95770264,0.000004924182,0.042229332,0.000015922624,0.000007898501,0.000004871434,0.0000018663037,0.000007554927,0.000024984376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993116,0.000009191207,0.00020256026,0.00010042658,0.00024380133,0.00013236857],"domain_scores_gemma":[0.99967223,0.000025744439,0.00003816839,0.000115865914,0.00009711171,0.000050896422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040521013,0.00004540052,0.00006905553,0.000096259275,0.000033037504,0.00001764358,0.00015527985,0.000021936192,0.000100748206],"category_scores_gemma":[0.00003985066,0.00005104213,0.00001980977,0.0005987892,0.00012305441,0.0003974046,0.0000017025374,0.00005226794,0.000024248948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010286594,0.000015468113,0.08948469,0.00005559321,0.000007088391,9.657416e-7,0.0060970644,0.70415306,0.16138959,0.0035866478,0.00007562576,0.035133183],"study_design_scores_gemma":[0.00011588189,0.0000071227423,0.6794265,0.000018758818,0.000004208225,2.2952216e-7,0.0001766183,0.29834086,0.021559132,0.00020642887,0.000046269484,0.00009797162],"about_ca_topic_score_codex":0.000030819632,"about_ca_topic_score_gemma":0.0000034662626,"teacher_disagreement_score":0.5899418,"about_ca_system_score_codex":0.000020089532,"about_ca_system_score_gemma":0.000030734933,"threshold_uncertainty_score":0.20814376},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05179541063175576,"score_gpt":0.33514159422305084,"score_spread":0.2833461835912951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128178859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8031417,0.000010760484,0.195667,0.00019773493,0.00006448223,0.0003992957,0.000001783005,0.00004171166,0.00047555167],"genre_scores_gemma":[0.994297,0.0000054235848,0.0055301557,0.00011902378,0.00001742048,0.0000069367466,0.0000041751023,0.0000023784148,0.000017468848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9985497,0.00008300924,0.0003153571,0.00021951065,0.0005990903,0.00023333562],"domain_scores_gemma":[0.9993821,0.000082138955,0.0001203037,0.000092523944,0.00024642455,0.00007651907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609157,0.00006627137,0.00012197592,0.00015092111,0.00029520752,0.000027194852,0.00022870097,0.000034679335,0.000019579684],"category_scores_gemma":[0.00004536607,0.00006946458,0.000013178951,0.0025919867,0.00012334352,0.00045967425,5.042502e-7,0.00006386236,0.0000019313775],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003644548,0.00015726889,0.039187733,0.0000019938598,0.0000010343565,0.0000034089755,0.08418991,0.8732043,0.00011096131,0.0027224922,0.000006225799,0.00037824965],"study_design_scores_gemma":[0.0005537747,0.0001546344,0.98501515,0.000027040345,0.0000124652715,6.980427e-8,0.0097691165,0.0037348163,0.000065149135,0.0005556326,0.000014591668,0.00009755629],"about_ca_topic_score_codex":0.0010249342,"about_ca_topic_score_gemma":0.010299218,"teacher_disagreement_score":0.9458274,"about_ca_system_score_codex":0.00002773038,"about_ca_system_score_gemma":0.0002653966,"threshold_uncertainty_score":0.5747205},"labels":[],"label_agreement":null},{"id":"W2129462568","doi":"10.1287/trsc.1090.0307","title":"The Stochastic Multiperiod Location Transportation Problem","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Mathematical optimization; Scheduling (production processes); Computer science; Heuristic; Operations research; Neighbourhood (mathematics); Mathematics","score_opus":0.01011121697135362,"score_gpt":0.26157433246239836,"score_spread":0.2514631154910447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129462568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41430566,0.000020478154,0.58418065,0.00011431305,0.00052424526,0.00025892092,0.000008172687,0.0003410164,0.00024654958],"genre_scores_gemma":[0.94834,0.0000067708497,0.05146822,0.000019012141,0.000034134307,0.0000485366,0.00002149733,0.000019899335,0.00004193913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987192,0.000012679545,0.0003377644,0.00022330196,0.00043333272,0.0002737265],"domain_scores_gemma":[0.99919724,0.00010076785,0.000060709222,0.00024594725,0.00029793294,0.00009737596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087493367,0.000120162564,0.00008234103,0.000097013275,0.00048191345,0.00011777611,0.0003166667,0.000054355518,0.00002336593],"category_scores_gemma":[0.00006598295,0.000100186735,0.00002827079,0.0011412054,0.00033386963,0.0005153612,7.771945e-7,0.00022535665,0.00002083828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053419326,0.000009731813,0.00093443884,0.000018544068,0.000003576552,4.494641e-7,0.0024212764,0.901996,0.07387009,0.0054391203,0.000015378519,0.015286016],"study_design_scores_gemma":[0.00045583217,0.000021458793,0.27222058,0.00002220787,0.000025102847,0.0000020080747,0.00037176546,0.708971,0.015992623,0.0006103389,0.00097011734,0.00033694712],"about_ca_topic_score_codex":0.000016599271,"about_ca_topic_score_gemma":0.0005270091,"teacher_disagreement_score":0.5340344,"about_ca_system_score_codex":0.0000275802,"about_ca_system_score_gemma":0.000103123755,"threshold_uncertainty_score":0.40854964},"labels":[],"label_agreement":null},{"id":"W2129828643","doi":"10.1287/trsc.1120.0417","title":"Long-Haul Vehicle Routing and Scheduling with Working Hour Rules","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Scheduling (production processes); TRIPS architecture; Operations research; Computer science; Transport engineering; Truck; Job shop scheduling; Engineering; Routing (electronic design automation); Operations management; Computer network; Automotive engineering; Algorithm","score_opus":0.0235828219791595,"score_gpt":0.26791987820707636,"score_spread":0.24433705622791685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129828643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6899412,0.00012017161,0.30918935,0.000018217012,0.0000829246,0.00005851181,9.990566e-7,0.00019724327,0.00039135345],"genre_scores_gemma":[0.8253438,0.000012142338,0.17454833,0.000020998672,0.000041925876,0.000004104854,0.0000027002777,0.000017710532,0.000008308773],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989747,0.0000149550715,0.0001836661,0.00017110918,0.0002951757,0.0003603892],"domain_scores_gemma":[0.99958456,0.000055947257,0.00004388988,0.00011739348,0.000056751505,0.00014147094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089667644,0.0001077986,0.00010044103,0.0001103675,0.00021421906,0.00008305161,0.000116837226,0.000033103308,0.0000120346485],"category_scores_gemma":[0.000028607627,0.00010155593,0.000013000352,0.0006348916,0.00013983774,0.00076395064,0.0000035182277,0.000115671886,0.0000062699937],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049240284,0.000009346999,0.5980089,0.000027217353,0.0000061926535,0.0000018259557,0.0036671348,0.37500623,0.0078504095,0.0012752044,5.988562e-7,0.0141420495],"study_design_scores_gemma":[0.0002553549,0.000010087572,0.7591613,0.00007985004,0.000017009936,0.0000054033144,0.00037143653,0.23053318,0.009301357,0.000019951854,0.000028640787,0.00021641227],"about_ca_topic_score_codex":0.0000069128764,"about_ca_topic_score_gemma":0.000009508964,"teacher_disagreement_score":0.16115245,"about_ca_system_score_codex":0.000032081414,"about_ca_system_score_gemma":0.000025761648,"threshold_uncertainty_score":0.41413307},"labels":[],"label_agreement":null},{"id":"W2129849731","doi":"10.1287/trsc.35.3.304.10148","title":"Modeling Bus Stops in Transit Networks: A Survey and New Formulations","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Transit (satellite); Computer science; Transport engineering; Public transport; Mathematical optimization; Line (geometry); Order (exchange); Rail transit; Operations research; Engineering; Mathematics; Economics","score_opus":0.07238598915321463,"score_gpt":0.33272747396402164,"score_spread":0.260341484810807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129849731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59507895,0.00006281614,0.403781,0.000283101,0.000075583135,0.00013696679,0.000005694569,0.000055816832,0.00052007096],"genre_scores_gemma":[0.9965292,0.00027746477,0.002811002,0.00007913005,0.000028646327,0.0000051279703,0.0000636626,0.0000062840263,0.00019948736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99864435,0.000048666985,0.0002953881,0.00028614563,0.000423601,0.00030182875],"domain_scores_gemma":[0.99944866,0.000076266144,0.000045979712,0.000085394335,0.00015626456,0.00018742158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012885922,0.00008513691,0.0001086642,0.00023273824,0.0005064189,0.00009653329,0.00015305608,0.00006196032,0.000044747358],"category_scores_gemma":[0.000062146195,0.00009398394,0.000019757721,0.0019060571,0.00019931923,0.0010383826,7.175165e-7,0.00009313397,0.000002154762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021501477,0.000013167815,0.19850303,0.0000013860929,9.646944e-7,0.0000025319164,0.015865825,0.77837086,0.000017296969,0.0049785622,0.000004741612,0.0022201387],"study_design_scores_gemma":[0.00035374152,0.000009758946,0.74044,0.000016905306,0.000005398419,3.3317377e-7,0.00094945007,0.25740933,0.0000024477647,0.0005045973,0.00018405892,0.0001239696],"about_ca_topic_score_codex":0.01513835,"about_ca_topic_score_gemma":0.15200046,"teacher_disagreement_score":0.54193693,"about_ca_system_score_codex":0.000041509087,"about_ca_system_score_gemma":0.00037141665,"threshold_uncertainty_score":0.9914199},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1103022939366786,"score_gpt":0.39185021679285514,"score_spread":0.2815479228561765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130310388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8025708,0.000058848276,0.19505784,0.0005795625,0.00016317777,0.00019824876,0.000290322,0.000045865952,0.0010353101],"genre_scores_gemma":[0.98791754,0.000035880814,0.009767971,0.00017776221,0.00004673338,0.000030452407,0.000037118123,0.000007645377,0.0019789038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654025,0.000043348788,0.0007558392,0.0006952674,0.0015776188,0.00038766567],"domain_scores_gemma":[0.9985337,0.00025010627,0.00019024867,0.0004968713,0.00037924075,0.00014982077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031272122,0.00013652547,0.00028659817,0.00023867063,0.0006087777,0.00036906562,0.0010605066,0.000042839456,0.0008273362],"category_scores_gemma":[0.00013658647,0.000105564344,0.00011223888,0.0015775963,0.00034517655,0.0016636965,0.000003997304,0.000056545225,0.00017586909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003007706,0.000054395045,0.0022533322,0.0000076093406,0.000013830523,0.000013084253,0.0068039587,0.8255594,0.026629686,0.008128066,0.0008270954,0.1294088],"study_design_scores_gemma":[0.002778602,0.0003300425,0.27568993,0.00010949736,0.00019203396,0.00001404715,0.0035517658,0.23209229,0.101338,0.34814224,0.03419705,0.0015644856],"about_ca_topic_score_codex":0.00011927891,"about_ca_topic_score_gemma":0.00007695856,"teacher_disagreement_score":0.59346706,"about_ca_system_score_codex":0.000030467352,"about_ca_system_score_gemma":0.00018198437,"threshold_uncertainty_score":0.90587515},"labels":[],"label_agreement":null},{"id":"W2130662252","doi":"10.1287/trsc.1090.0266","title":"Optimal Baggage-Limit Policy: Airline Passenger and Cargo Allocation","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Newsvendor model; Revenue; Air cargo; Transport engineering; Air travel; Limit (mathematics); Business; Low-cost carrier; Aviation; Operations research; Supply chain; Engineering; Marketing; Finance; Aerospace engineering","score_opus":0.015515754297855039,"score_gpt":0.22994891660188468,"score_spread":0.21443316230402965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130662252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87120086,0.00021591851,0.12376903,0.0006346067,0.00016375253,0.00016484066,0.000032308155,0.00038866032,0.0034300268],"genre_scores_gemma":[0.99393165,0.00013248566,0.0056001423,0.00015663503,0.00006472161,0.0000033560993,0.0000343805,0.0000091657375,0.00006748538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99906915,0.0000035003095,0.00021094788,0.00020707268,0.0002666654,0.00024263599],"domain_scores_gemma":[0.99961567,0.00001414812,0.000020925976,0.00014345009,0.00007435196,0.00013148371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016559353,0.00011831864,0.0001069163,0.00016696275,0.00010275759,0.000039626706,0.00013397279,0.000045843335,0.000019325127],"category_scores_gemma":[0.000010115755,0.00011702465,0.000022821265,0.0005903799,0.00019324836,0.00034668477,6.277463e-7,0.00009853737,0.000009351153],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061712395,0.0002009174,0.018398762,0.0001733491,0.000039457012,0.00009287896,0.012079479,0.51677585,0.242238,0.15642,0.0009565131,0.052563094],"study_design_scores_gemma":[0.00044843205,0.0000856119,0.92748046,0.000019473591,0.000032795782,0.00000460631,0.000105270155,0.054054625,0.013766557,0.0005702285,0.003074014,0.0003579052],"about_ca_topic_score_codex":0.000022638675,"about_ca_topic_score_gemma":0.00005422442,"teacher_disagreement_score":0.9090817,"about_ca_system_score_codex":0.00003649383,"about_ca_system_score_gemma":0.000063547224,"threshold_uncertainty_score":0.47721264},"labels":[],"label_agreement":null},{"id":"W2130923090","doi":"10.1287/trsc.1110.0394","title":"Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Pickup; Set (abstract data type); Computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.053287495377932294,"score_gpt":0.29179182450612057,"score_spread":0.23850432912818828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130923090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8319748,0.00001932479,0.1676893,0.00001664682,0.000026022444,0.00012214939,0.000011124974,0.000043328153,0.00009733588],"genre_scores_gemma":[0.92406,0.000002175224,0.075907245,0.000009792231,0.000005266518,0.0000043593986,0.00000277024,0.0000039670795,0.0000044231215],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99922097,0.000032756827,0.00019016997,0.00012505277,0.0002722996,0.00015876757],"domain_scores_gemma":[0.9995595,0.000038294696,0.000056853438,0.00018172183,0.000098145996,0.000065445754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000631314,0.00006593266,0.0001169786,0.00006960559,0.000098452045,0.000015864354,0.00012787501,0.000018710783,0.000017214192],"category_scores_gemma":[0.00001659664,0.000046186276,0.000031278178,0.0015233769,0.0003892793,0.00034739313,0.00000352442,0.000054028194,3.568663e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005614508,0.000013201642,0.84544516,0.000019798777,0.000016471398,3.657161e-8,0.0018239307,0.14979218,0.0022385744,0.0003700576,7.5780395e-7,0.00027423067],"study_design_scores_gemma":[0.00013068454,0.0000065075014,0.93309367,0.0000065077365,0.00009287671,2.818067e-7,0.000098787976,0.062150143,0.004333537,0.000023375256,0.0000044416156,0.0000591917],"about_ca_topic_score_codex":0.000049688657,"about_ca_topic_score_gemma":0.00014863822,"teacher_disagreement_score":0.09208522,"about_ca_system_score_codex":0.000024052282,"about_ca_system_score_gemma":0.00003343391,"threshold_uncertainty_score":0.18834217},"labels":[],"label_agreement":null},{"id":"W2133808551","doi":"10.1287/trsc.2016.0672","title":"On the Existence and Uniqueness of Equilibrium in the Bottleneck Model with Atomic Users","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Social Sciences and Humanities Research Council of Canada; Northwestern University","keywords":"Bottleneck; Uniqueness; Nash equilibrium; Queueing theory; Queue; Strategy; Computer science; Mathematical optimization; Traffic congestion; Operations research; Mathematical economics; Game theory; Economics; Transport engineering; Engineering; Mathematics; Computer network","score_opus":0.03381374117409109,"score_gpt":0.2930704907206937,"score_spread":0.2592567495466026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133808551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866689,0.0000068459026,0.008799889,0.0030883707,0.00001939291,0.00017763783,0.000011168564,0.000016773985,0.0012110122],"genre_scores_gemma":[0.9990087,0.000030032157,0.0006687816,0.00018571934,0.000003425711,0.000013037653,0.0000015421308,0.0000030940696,0.00008564395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99894375,0.000056525718,0.00015454383,0.00017495456,0.0005185385,0.00015166933],"domain_scores_gemma":[0.9993544,0.0002920719,0.000085408064,0.00013101695,0.00010287588,0.000034228156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011984585,0.00005802461,0.00006397268,0.00007343413,0.0002084054,0.000029804212,0.00029928295,0.000024111994,0.000009596523],"category_scores_gemma":[0.00004874091,0.000026705198,0.000012241196,0.00067203096,0.0011232942,0.00040420442,7.7651345e-7,0.000042666004,8.652159e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009519496,0.000035578338,0.060530193,0.000009766954,0.0000023014263,0.0000023594537,0.06521125,0.022463763,0.0031509253,0.847829,0.00001724362,0.00065242185],"study_design_scores_gemma":[0.0010076844,0.00014535556,0.9475983,0.00032682763,0.00002595556,7.816599e-7,0.0152184,0.0072321324,0.004702999,0.023294054,0.00013930003,0.0003082477],"about_ca_topic_score_codex":0.00025172535,"about_ca_topic_score_gemma":0.0015789774,"teacher_disagreement_score":0.8870681,"about_ca_system_score_codex":0.000018693232,"about_ca_system_score_gemma":0.00025663117,"threshold_uncertainty_score":0.41388243},"labels":[],"label_agreement":null},{"id":"W2134381195","doi":"10.1287/trsc.2013.0489","title":"A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Column generation; Vehicle routing problem; Mathematical optimization; Integer programming; Routing (electronic design automation); Branch and price; Shortest path problem; Computer science; Linear programming relaxation; Set (abstract data type); Relaxation (psychology); Branch and cut; Extension (predicate logic); Linear programming; Path (computing); Integer (computer science); Mathematics; Graph; Theoretical computer science","score_opus":0.012188179354596644,"score_gpt":0.25526921868208735,"score_spread":0.2430810393274907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134381195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12418705,0.00002894073,0.87489146,0.00012572615,0.000071595576,0.0002921944,0.000005372718,0.0002117293,0.00018591904],"genre_scores_gemma":[0.6823589,0.000005652295,0.31747827,0.00005025115,0.000024129573,0.000042211886,0.0000023189652,0.000016425483,0.00002181575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989917,0.000019121471,0.00023191681,0.00024318125,0.00025174126,0.00026229882],"domain_scores_gemma":[0.99921376,0.00035331363,0.000059688147,0.00016182868,0.00014272265,0.00006869759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011213502,0.00011786002,0.00011363518,0.0000645823,0.000300699,0.00010539933,0.00021858038,0.000028057428,0.000004228717],"category_scores_gemma":[0.00006129283,0.00008437414,0.000023504603,0.00052684464,0.0001828128,0.0003618419,0.0000043406644,0.000096065836,0.0000017717242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010510787,0.000013730102,0.009961514,0.00006839611,0.000019139892,4.5536459e-7,0.004938202,0.61266494,0.012840873,0.0019165216,0.000008522016,0.35755718],"study_design_scores_gemma":[0.00040406606,0.000033190332,0.05149225,0.000032373922,0.000017598408,0.0000022363586,0.00013418256,0.9403871,0.0071235257,0.00009106728,0.00015209557,0.000130304],"about_ca_topic_score_codex":0.000026891375,"about_ca_topic_score_gemma":0.00004009479,"teacher_disagreement_score":0.55817187,"about_ca_system_score_codex":0.000023710558,"about_ca_system_score_gemma":0.000026979227,"threshold_uncertainty_score":0.34406775},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07623691227594778,"score_gpt":0.3678143486371205,"score_spread":0.2915774363611727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134422508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51156545,0.00003867806,0.486737,0.0007925775,0.00032807648,0.00029747197,0.00008637884,0.000055526667,0.00009883272],"genre_scores_gemma":[0.94181496,0.00003057265,0.057565384,0.00020789646,0.000099560864,0.00005534854,0.000066090724,0.000011523452,0.00014867334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9957741,0.000045449164,0.0010717267,0.0007721836,0.0018319881,0.00050456],"domain_scores_gemma":[0.9980405,0.00024445466,0.0003887134,0.0004193083,0.00072363735,0.00018336128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005236181,0.00017556586,0.0003598093,0.0003332138,0.00077933015,0.00035232853,0.0008494262,0.00007244736,0.00017505325],"category_scores_gemma":[0.00031643346,0.00014241366,0.00018355783,0.0029786031,0.00036156471,0.0012900243,0.0000019414183,0.00006595206,0.000091912974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042736097,0.00013204972,0.008947384,0.000020954054,0.000039095332,0.000025213354,0.01242618,0.6759949,0.18497312,0.04820199,0.00046612674,0.06834565],"study_design_scores_gemma":[0.0019783287,0.00021366433,0.59965813,0.000058274796,0.00014525618,0.0000026178886,0.0018818065,0.00083239994,0.12309018,0.26914847,0.0023763257,0.00061453367],"about_ca_topic_score_codex":0.0002635524,"about_ca_topic_score_gemma":0.0011847671,"teacher_disagreement_score":0.6751625,"about_ca_system_score_codex":0.000058660436,"about_ca_system_score_gemma":0.0003878456,"threshold_uncertainty_score":0.5994056},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035265094387614375,"score_gpt":0.27635904149410156,"score_spread":0.24109394710648718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135680984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7052914,0.00003385648,0.29387394,0.00012733764,0.00003135904,0.00039774695,0.000022747217,0.00013812748,0.00008350238],"genre_scores_gemma":[0.8933262,0.000027347969,0.10638027,0.0000748908,0.000033005173,0.000055132296,0.00001515961,0.000017985873,0.00006997936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988167,0.000031159874,0.00025372868,0.00021620409,0.00037786816,0.0003043029],"domain_scores_gemma":[0.99947345,0.00014466983,0.00004422565,0.00013892558,0.00012531702,0.000073438205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010770439,0.0001123808,0.0001224617,0.000056020024,0.0005357256,0.00006436481,0.00017310673,0.000024295381,0.000021270162],"category_scores_gemma":[0.000018158347,0.000084227875,0.000021621847,0.00044645963,0.00032762208,0.00039358763,0.0000053487247,0.00008619832,0.0000018924928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048959377,0.000018020919,0.035057258,0.000059231326,0.0000224835,0.0000028084407,0.013141322,0.91693735,0.029960055,0.00263386,0.00005571728,0.00206296],"study_design_scores_gemma":[0.0011222685,0.000067668574,0.037175324,0.000023714703,0.000027341286,0.0000061397905,0.0003774705,0.9379273,0.022675969,0.000060401228,0.0003166034,0.00021980543],"about_ca_topic_score_codex":0.00009405001,"about_ca_topic_score_gemma":0.00003777423,"teacher_disagreement_score":0.18803486,"about_ca_system_score_codex":0.000029621688,"about_ca_system_score_gemma":0.00009005233,"threshold_uncertainty_score":0.41204226},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01782215380448123,"score_gpt":0.27707571884409293,"score_spread":0.2592535650396117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136611127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27067736,0.00011271647,0.7273492,0.00013425565,0.000121933874,0.00036067955,0.000013436386,0.0002935267,0.0009368859],"genre_scores_gemma":[0.965493,0.000019601219,0.03420775,0.00007271863,0.000028476874,0.000017685097,0.000051135874,0.000029500328,0.00008010636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979303,0.0000678931,0.000510613,0.00032685182,0.0006841929,0.00048016495],"domain_scores_gemma":[0.9985245,0.00034655872,0.000090113965,0.00024713678,0.00066399673,0.00012772101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003811379,0.00017007234,0.00013860394,0.00017415879,0.0007193388,0.00014780836,0.00036846558,0.000060086113,0.00003418447],"category_scores_gemma":[0.0002262158,0.00014526793,0.00003070006,0.0029861731,0.00039972845,0.000560518,0.0000043332284,0.00028366264,0.000021957774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009718014,0.000023777182,0.00622691,0.00005305617,0.000012693053,0.0000037067184,0.021036599,0.895071,0.0698673,0.0036281215,0.00013668,0.003930387],"study_design_scores_gemma":[0.0007075767,0.000048625854,0.07594886,0.00015178282,0.000045298253,0.0000064588994,0.004665728,0.8582441,0.059132237,0.00017408632,0.00030823462,0.0005670081],"about_ca_topic_score_codex":0.00011164277,"about_ca_topic_score_gemma":0.00014261085,"teacher_disagreement_score":0.69481564,"about_ca_system_score_codex":0.00012985792,"about_ca_system_score_gemma":0.00012533377,"threshold_uncertainty_score":0.5923854},"labels":[],"label_agreement":null},{"id":"W2136642745","doi":"10.1287/trsc.1050.0139","title":"Dispatching Buses in a Depot Using Block Patterns","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Depot; Transport engineering; Block (permutation group theory); Computer science; Operations research; Engineering; Geography; Mathematics","score_opus":0.02247243372626171,"score_gpt":0.28256554367405795,"score_spread":0.2600931099477962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136642745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52523524,0.0000066849557,0.47429767,0.00012377655,0.000054426204,0.0000735903,0.0000016037588,0.000047139427,0.00015984692],"genre_scores_gemma":[0.9544916,0.0000043039845,0.04536253,0.000093883085,0.000010946396,0.0000049371206,0.000002798496,0.0000037263967,0.000025233547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9985966,0.000020955984,0.00025587852,0.0003407227,0.00050037703,0.00028547665],"domain_scores_gemma":[0.99955624,0.000026806767,0.000061523504,0.00019885741,0.000094199604,0.0000623552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004187557,0.000077021185,0.00007885916,0.00026947065,0.00016548361,0.00019565076,0.00055536005,0.00002038697,0.000008741716],"category_scores_gemma":[0.0000107136475,0.000074290976,0.0000219918,0.0014137529,0.000085935586,0.001352298,0.000011444412,0.0000761077,0.0000052662476],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002707428,0.00011138941,0.46004224,0.000020393452,9.688058e-7,0.0000316341,0.002223807,0.47944507,0.017700478,0.038293198,0.0000058218197,0.0021222816],"study_design_scores_gemma":[0.00025140113,0.000011884171,0.5641766,0.000034113058,0.0000011132427,0.0000026741775,0.000047860533,0.43120584,0.0029538753,0.0011371318,0.000036753176,0.00014074762],"about_ca_topic_score_codex":0.0011940618,"about_ca_topic_score_gemma":0.0014180429,"teacher_disagreement_score":0.42925638,"about_ca_system_score_codex":0.000043264077,"about_ca_system_score_gemma":0.0001553077,"threshold_uncertainty_score":0.30294982},"labels":[],"label_agreement":null},{"id":"W2136708107","doi":"10.1287/trsc.1100.0316","title":"The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Vehicle routing problem; Heuristic; Routing (electronic design automation); Mathematical optimization; Computer science; Pickup; Integer programming; Operations research; Linear programming; Material handling; Fixed cost; Integer (computer science); Engineering; Industrial engineering; Mathematics; Economics; Artificial intelligence","score_opus":0.006388144429665132,"score_gpt":0.22850926522083284,"score_spread":0.22212112079116772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136708107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80792886,0.000036399102,0.19107515,0.00006583512,0.00010606487,0.00012156676,0.0000033279402,0.00014410602,0.0005187213],"genre_scores_gemma":[0.8785355,0.000038601098,0.12135842,0.000013183247,0.000013938814,0.000008087142,0.0000026951245,0.000011269769,0.000018302513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992536,0.0000080822765,0.0001554273,0.00015984332,0.00023192546,0.0001911282],"domain_scores_gemma":[0.99957645,0.000079924954,0.000030879193,0.0001256055,0.000112703885,0.000074447715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006985872,0.00008050599,0.00006260693,0.000038748432,0.0004332977,0.00012656926,0.00015036222,0.000027178154,0.0000046955265],"category_scores_gemma":[0.000022854263,0.000058278285,0.0000082134065,0.00042169748,0.00033975445,0.00029426237,0.0000018568431,0.0001580404,0.0000010875966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004225662,0.000018332004,0.07070307,0.00009176637,0.00002431935,0.000008577731,0.0113753285,0.47925156,0.26558477,0.024649732,0.000017032258,0.14823326],"study_design_scores_gemma":[0.0010177599,0.00007407361,0.3636788,0.00009876088,0.000044262117,0.000025835598,0.0010509612,0.5809733,0.04952127,0.00037595967,0.0025334351,0.0006055435],"about_ca_topic_score_codex":0.000019407627,"about_ca_topic_score_gemma":0.00066896726,"teacher_disagreement_score":0.29297575,"about_ca_system_score_codex":0.000015256587,"about_ca_system_score_gemma":0.000055610035,"threshold_uncertainty_score":0.33326194},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02032142200990912,"score_gpt":0.2890078836574357,"score_spread":0.2686864616475266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136871443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13245787,0.00003404282,0.8662319,0.000025804871,0.00013936665,0.00028732332,0.000007614211,0.0002675178,0.00054856803],"genre_scores_gemma":[0.6410026,0.000005742243,0.35885453,0.000034691922,0.000028188866,0.000015501573,0.0000065644676,0.000015712407,0.000036473924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886274,0.000009434393,0.0002996196,0.00023845668,0.00025873358,0.00033102487],"domain_scores_gemma":[0.9995298,0.000089885856,0.000052295603,0.000112864094,0.000105339815,0.00010984676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002009491,0.00010413502,0.00011384508,0.00017872415,0.00019622494,0.000051173098,0.00014871267,0.00003984186,0.000006410761],"category_scores_gemma":[0.00004412441,0.00011428561,0.000032021508,0.00072327396,0.00012980665,0.00035446754,0.0000027346564,0.00008608729,0.0000024254775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019901574,0.0000399215,0.0100230165,0.00027908955,0.000030803534,0.000008822553,0.012903701,0.15053801,0.04697737,0.0088030305,0.0000505317,0.7703258],"study_design_scores_gemma":[0.00089059985,0.000036951908,0.03891905,0.000059053997,0.000027221886,0.0000038578337,0.00030341928,0.93320256,0.024643095,0.0008615832,0.0007227837,0.00032983697],"about_ca_topic_score_codex":0.000008994615,"about_ca_topic_score_gemma":0.000030002977,"teacher_disagreement_score":0.78266454,"about_ca_system_score_codex":0.0000484565,"about_ca_system_score_gemma":0.000033120472,"threshold_uncertainty_score":0.4660432},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009295564871308826,"score_gpt":0.23761108514239387,"score_spread":0.22831552027108504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138596841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597995,0.0000023636683,0.03370975,0.000027421449,0.00008078614,0.00009248776,0.0000037184482,0.00024227798,0.006041655],"genre_scores_gemma":[0.9263962,0.0000010026769,0.07348745,0.000022602866,0.000018777131,0.0000025599038,0.000005736511,0.000020110556,0.00004558618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9990824,0.000023383109,0.00019903615,0.00020219952,0.00026316242,0.00022986019],"domain_scores_gemma":[0.99963045,0.000036007572,0.000032883334,0.00016381724,0.00006389544,0.00007295631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285805,0.00009150301,0.00008542114,0.0001428222,0.00008874455,0.000053412874,0.0002229821,0.000023575345,0.00007691323],"category_scores_gemma":[0.00002926317,0.00008656265,0.000013565064,0.0007338507,0.00016171458,0.00046444562,0.0000027047488,0.00019297747,0.00008686992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056871777,0.000015795704,0.08090855,0.000010524855,0.0000025705401,0.00001614465,0.0031524468,0.540055,0.3672904,0.00081982766,0.0000058813025,0.007717158],"study_design_scores_gemma":[0.0003194282,0.000009748991,0.69835097,0.000018807894,0.0000037166612,0.0000017700894,0.0000467257,0.28961924,0.011367307,0.00002099158,0.00009025998,0.00015103645],"about_ca_topic_score_codex":0.00001082504,"about_ca_topic_score_gemma":0.00006684564,"teacher_disagreement_score":0.6174424,"about_ca_system_score_codex":0.000019048464,"about_ca_system_score_gemma":0.00003521822,"threshold_uncertainty_score":0.35299224},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012417331304845007,"score_gpt":0.2614500720696989,"score_spread":0.24903274076485388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138868522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95081735,0.000005863686,0.046784718,0.00024941933,0.00014304668,0.00015899436,0.000028784705,0.00006695169,0.0017448762],"genre_scores_gemma":[0.98064035,0.00000793353,0.019103449,0.000062454936,0.000011541763,0.000029863384,0.0001255257,0.000008951457,0.000009922995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904203,0.0000060086454,0.0003122061,0.00015477132,0.0003435281,0.00014147816],"domain_scores_gemma":[0.9994853,0.000011825129,0.00004535838,0.00016147064,0.00021308391,0.00008292986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018113609,0.000081936254,0.00008859259,0.00024040478,0.000055433233,0.000020380421,0.00025982203,0.00003523692,0.00060215115],"category_scores_gemma":[0.000002184774,0.000081603845,0.000019861282,0.00091699173,0.000063429834,0.0010244455,8.634771e-7,0.00007436775,0.0000039230463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015146093,0.00003126692,0.056478914,0.000012721578,0.0000014576816,3.4821576e-7,0.00050756574,0.93631154,0.0053751636,0.00014601421,0.0000036488193,0.0011298254],"study_design_scores_gemma":[0.00014827483,0.000006125201,0.46627066,0.000018046823,0.0000017376451,9.220955e-8,0.000070509,0.5321886,0.0012170894,0.000014551917,0.000010317926,0.00005399471],"about_ca_topic_score_codex":0.00031258076,"about_ca_topic_score_gemma":0.00031361033,"teacher_disagreement_score":0.40979174,"about_ca_system_score_codex":0.000044716337,"about_ca_system_score_gemma":0.00011835323,"threshold_uncertainty_score":0.6593133},"labels":[],"label_agreement":null},{"id":"W2138909646","doi":"10.1287/trsc.2015.0595","title":"Maximal Accessibility Network Design in the Public Sector","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban Transport and Accessibility","field":"Social Sciences","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Network planning and design; Public sector; Computer science; Operations research; Proxy (statistics); Service (business); Mathematical optimization; Flow network; Transport engineering; Business; Engineering; Economics; Computer network; Marketing; Mathematics","score_opus":0.14361108653116775,"score_gpt":0.3590568582727662,"score_spread":0.21544577174159843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138909646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975459,0.00008568934,0.015806695,0.0022110327,0.0004083088,0.0005200681,0.000004998914,0.00008128379,0.005422967],"genre_scores_gemma":[0.9974603,0.0000049165756,0.0019808884,0.00031636667,0.00013796998,0.00003233588,0.0000067367914,0.0000042674883,0.00005619946],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99706,0.00029284877,0.00035085535,0.0004294047,0.0012938562,0.0005730184],"domain_scores_gemma":[0.99892086,0.0001608131,0.00010276531,0.0003078061,0.00027878355,0.00022898935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011034911,0.00010383617,0.00012969978,0.00009062098,0.0006225307,0.00031389238,0.0012753957,0.000060737268,0.00015155107],"category_scores_gemma":[0.00023609339,0.00007551986,0.000045032823,0.0031615384,0.0013458595,0.0020703005,0.0000038339144,0.00016962375,0.000018892695],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034022163,0.000098349265,0.959247,0.0000041968824,0.0000012244636,0.000010168803,0.025498755,0.00037175283,0.00003212051,0.013008776,0.00026947944,0.001424149],"study_design_scores_gemma":[0.00024615056,0.000022590833,0.97920763,0.0000054566835,0.000005540655,1.1616871e-7,0.0035351624,0.00014481609,0.00003865768,0.013945243,0.0027249434,0.0001237144],"about_ca_topic_score_codex":0.001124673,"about_ca_topic_score_gemma":0.017823467,"teacher_disagreement_score":0.022001363,"about_ca_system_score_codex":0.00012642903,"about_ca_system_score_gemma":0.0015586287,"threshold_uncertainty_score":0.9945913},"labels":[],"label_agreement":null},{"id":"W2139434864","doi":"10.1287/trsc.1060.0172","title":"An Exact Solution Approach for the Preferential Bidding System Problem in the Airline Industry","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Bidding; Schedule; Crew; Column generation; Operations research; Order (exchange); Computer science; Aircrew; Seniority; Quality (philosophy); Work (physics); Mathematical optimization; Engineering; Business; Mathematics; Finance; Marketing; Aeronautics","score_opus":0.041561768691632965,"score_gpt":0.31415356704378317,"score_spread":0.2725917983521502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139434864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19355036,0.00001354513,0.8053521,0.000024054258,0.00009672836,0.00044634254,0.000005184499,0.00012240792,0.00038929438],"genre_scores_gemma":[0.88235986,0.0000013314282,0.117490575,0.0000142939125,0.000055903907,0.00004499298,0.000018448796,0.000010144616,0.00000446133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989038,0.00003396454,0.0002905249,0.000183864,0.00032881816,0.0002589903],"domain_scores_gemma":[0.9995188,0.00012265133,0.00005101452,0.0001931747,0.00007547254,0.000038879352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045379493,0.000084648214,0.000073382755,0.00012112244,0.00024125686,0.00007244895,0.00037916284,0.00008126331,0.0000026893763],"category_scores_gemma":[0.000019643965,0.000056294546,0.000023362847,0.0009839255,0.00008718408,0.00038370016,0.000001426194,0.00021567143,4.7418652e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007703509,0.000015980055,0.0020209448,0.000049837618,0.0000020752536,2.2683874e-7,0.0024865249,0.98362,0.0052536214,0.0018695928,0.000003947781,0.0046695424],"study_design_scores_gemma":[0.00020293368,0.000014954351,0.08280534,0.000016587708,0.000011755445,0.0000015209213,0.0020127867,0.91229755,0.0025166364,0.00001165967,0.000028456334,0.00007981616],"about_ca_topic_score_codex":0.000023741299,"about_ca_topic_score_gemma":0.00004301032,"teacher_disagreement_score":0.68880945,"about_ca_system_score_codex":0.00006994383,"about_ca_system_score_gemma":0.00003817307,"threshold_uncertainty_score":0.2295625},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021099234204862673,"score_gpt":0.2463486574531667,"score_spread":0.22524942324830402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142169698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04155078,0.0000064071046,0.95540446,0.00006724775,0.0000588303,0.00010549353,0.0000013573793,0.0003235554,0.0024818368],"genre_scores_gemma":[0.63295984,9.921453e-7,0.36681828,0.00016922732,0.000022518774,0.0000048796132,0.0000032347402,0.000011540245,0.000009492124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990802,0.00003781524,0.00015879907,0.00018234095,0.00029455134,0.00024630246],"domain_scores_gemma":[0.9994856,0.0001077049,0.000032610747,0.00016903848,0.00011137087,0.00009367211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146005,0.000089129986,0.00008882144,0.00005725257,0.0001361982,0.000043680062,0.000201533,0.000027949582,0.000042516785],"category_scores_gemma":[0.0000217092,0.000082549675,0.0000097574375,0.001210272,0.00019626938,0.00021892553,0.0000012458408,0.00007757734,0.000016337168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004251299,0.0000020214013,0.0007648841,0.00000951937,0.0000019426575,5.756354e-7,0.00045758218,0.9915117,0.001043911,0.00085599755,0.000043896805,0.005303719],"study_design_scores_gemma":[0.0003341243,0.000030671312,0.026317636,0.000042972017,0.00001309605,0.0000036156362,0.00010971234,0.9675389,0.004051827,0.00016056889,0.0011844,0.00021245716],"about_ca_topic_score_codex":0.0000036487097,"about_ca_topic_score_gemma":0.000016256365,"teacher_disagreement_score":0.591409,"about_ca_system_score_codex":0.000019305227,"about_ca_system_score_gemma":0.000044122313,"threshold_uncertainty_score":0.3366278},"labels":[],"label_agreement":null},{"id":"W2143155132","doi":"10.1287/trsc.36.4.435.548","title":"A Note on the Entropy Solutions of the Hydrodynamic Model of Traffic Flow","year":2002,"lang":"en","type":"article","venue":"Transportation Science","topic":"Traffic control and management","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Classification of discontinuities; Entropy (arrow of time); Microscopic traffic flow model; Partial differential equation; Applied mathematics; Mathematics; Flow (mathematics); Statistical physics; Mathematical optimization; Mechanics; Mathematical analysis; Physics; Thermodynamics; Geometry; Statistics","score_opus":0.0173497663955663,"score_gpt":0.19657561642428456,"score_spread":0.17922585002871827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143155132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96259475,0.000027705644,0.03541626,0.0006856595,0.00012636062,0.00019748618,0.00002613047,0.000046569192,0.0008791079],"genre_scores_gemma":[0.9996196,0.000015624868,0.0002513182,0.000026409978,0.000003709226,0.000008948478,5.2007897e-7,0.0000036913002,0.000070165275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935,0.0000051385036,0.00015679475,0.00008529786,0.00027886342,0.00012392305],"domain_scores_gemma":[0.9997055,0.000024840083,0.00003073337,0.00019376223,0.000027326621,0.000017850865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014323302,0.000053494336,0.00006226142,0.000047193837,0.00008979765,0.0000052625664,0.00025438154,0.000011568102,0.000033029548],"category_scores_gemma":[0.0000065320623,0.00003240488,0.00005216505,0.00036169897,0.00016857129,0.00006853048,0.0000019363322,0.000051108007,0.000005124635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012435344,0.0000176868,0.000002482175,0.0000080666605,0.0000029162816,5.7470398e-8,0.0011974911,0.97872764,0.010208253,0.006283725,0.000036292826,0.0035141206],"study_design_scores_gemma":[0.00012091374,0.0000084334915,0.0042509283,0.00001106601,0.000013185312,4.9462706e-8,0.00003532003,0.9949518,0.00045742694,0.00008257736,0.00003321305,0.00003509259],"about_ca_topic_score_codex":0.0000028875818,"about_ca_topic_score_gemma":0.00009324665,"teacher_disagreement_score":0.037024893,"about_ca_system_score_codex":0.000017480479,"about_ca_system_score_gemma":0.000011720089,"threshold_uncertainty_score":0.13214327},"labels":[],"label_agreement":null},{"id":"W2144439980","doi":"10.1287/trsc.1100.0321","title":"Estimating Nonparametric Random Utility Models with an Application to the Value of Time in Heterogeneous Populations","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Economic and Environmental Valuation","field":"Economics, Econometrics and Finance","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Région de Bruxelles-Capitale","keywords":"Nonparametric statistics; Mixed logit; Randomness; Parametric statistics; Logit; Mathematical optimization; Population; Econometrics; A priori and a posteriori; Discrete choice; Computer science; Parametric model; Mathematics; Statistics; Logistic regression","score_opus":0.06947254412119379,"score_gpt":0.2583609363375154,"score_spread":0.1888883922163216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144439980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7410234,0.0000064568453,0.25825343,0.00007815283,0.000044129727,0.0002837071,0.000029939943,0.000007461326,0.0002733203],"genre_scores_gemma":[0.970179,9.609437e-7,0.029679468,0.000044659442,0.000009701589,0.000044882632,0.000025455893,0.000005608113,0.000010245753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999096,0.000007001204,0.00041171134,0.00029554468,0.000067643676,0.00012210211],"domain_scores_gemma":[0.9994367,0.000025063293,0.00019130352,0.00027458326,0.000019654764,0.000052705327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090057,0.000064473556,0.00013346534,0.0001901583,0.0001147831,0.000023175802,0.00022205246,0.000027077673,0.000057811874],"category_scores_gemma":[0.00002543734,0.0000579506,0.000021496258,0.0006267191,0.00012591406,0.0005093179,0.00000368356,0.00006871695,0.000050771265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016474723,0.000046966292,0.1779488,0.000002846555,0.000001225118,6.377912e-8,0.00085146574,0.80039763,0.00048810957,0.01891417,4.960747e-7,0.0013317635],"study_design_scores_gemma":[0.00018481044,0.000020937992,0.4467186,0.000001471269,0.0000017155654,3.3563344e-7,0.000014412774,0.54597646,0.00017323327,0.006855757,0.000005228009,0.000047011927],"about_ca_topic_score_codex":0.00065631926,"about_ca_topic_score_gemma":0.0009237775,"teacher_disagreement_score":0.2687698,"about_ca_system_score_codex":0.00003178835,"about_ca_system_score_gemma":0.000020634969,"threshold_uncertainty_score":0.2363157},"labels":[],"label_agreement":null},{"id":"W2148767145","doi":"10.1287/trsc.2014.0535","title":"Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"FIFO and LIFO accounting; Pickup; Vehicle routing problem; Mathematical optimization; Computation; Column generation; Computer science; Algorithm; Path (computing); Dynamic programming; Shortest path problem; Mathematics; Routing (electronic design automation); FIFO (computing and electronics); Theoretical computer science","score_opus":0.014906122694752602,"score_gpt":0.24406077677824442,"score_spread":0.2291546540834918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148767145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39116237,0.00008640556,0.60808665,0.00010996664,0.00003371012,0.00029841275,0.000003860494,0.000065946675,0.00015268051],"genre_scores_gemma":[0.88758844,0.0000499623,0.11224098,0.00003736855,0.000015248302,0.00002597643,0.0000018081948,0.0000131122815,0.000027101612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992594,0.000012009368,0.00016014637,0.00022042631,0.00015876097,0.00018924334],"domain_scores_gemma":[0.99948776,0.00026959903,0.000034815912,0.0000902089,0.000055682525,0.00006194815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083268556,0.0000961113,0.000109791676,0.00008680921,0.00018508526,0.00007559529,0.00009030478,0.000028157696,0.0000035814028],"category_scores_gemma":[0.00002441888,0.00007311183,0.000008662669,0.00028831765,0.00019091745,0.0003434523,0.0000033949366,0.000066925335,0.0000010415864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041039915,0.00001540123,0.054431483,0.00026063726,0.000020544894,0.0000013904003,0.014407692,0.85287744,0.01271941,0.0013311676,0.000015666188,0.06387813],"study_design_scores_gemma":[0.0007036667,0.00004452709,0.115545966,0.000055509376,0.000018887207,0.0000034779455,0.00008499829,0.88123393,0.0017354599,0.00015717928,0.00026661763,0.00014977554],"about_ca_topic_score_codex":0.0000144471605,"about_ca_topic_score_gemma":0.00014821022,"teacher_disagreement_score":0.49642608,"about_ca_system_score_codex":0.000014818438,"about_ca_system_score_gemma":0.00001964832,"threshold_uncertainty_score":0.29814136},"labels":[],"label_agreement":null},{"id":"W2149985337","doi":"10.1287/trsc.1080.0232","title":"The Stochastic Eulerian Tour Problem","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Eulerian path; Mathematics; A priori and a posteriori; Combinatorics; Graph; Expected value; Probability distribution; Mathematical optimization; Discrete mathematics; Applied mathematics; Statistics","score_opus":0.02164490420805822,"score_gpt":0.2595778368169822,"score_spread":0.23793293260892398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149985337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29145688,0.00004176568,0.7058149,0.00009549861,0.00023862047,0.0001474674,0.0000031454779,0.00032037278,0.0018813425],"genre_scores_gemma":[0.9588357,0.000014741702,0.04094047,0.000020906557,0.000020247357,0.0000130507005,0.0000018787202,0.000010581882,0.00014242901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991689,0.000010797176,0.00018014704,0.00012809805,0.00030251386,0.00020959409],"domain_scores_gemma":[0.9996101,0.0000604466,0.000025442787,0.00014962211,0.000088739216,0.000065622065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046646583,0.000067386725,0.00005573788,0.000052966305,0.0004908136,0.000036141955,0.00023829371,0.00001861444,0.00002199236],"category_scores_gemma":[0.00003316418,0.00005320202,0.00001890314,0.0007071448,0.00026222097,0.0002481109,0.0000015943771,0.00007246647,0.00002155732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017711486,0.0000032727587,0.00048542887,0.000004271012,0.0000019300132,0.0000016672158,0.0015705043,0.9890005,0.0047011385,0.0014160131,0.000083730185,0.0027297996],"study_design_scores_gemma":[0.00044598675,0.00003139717,0.26474264,0.000024535153,0.000012435181,0.000018808636,0.00029494773,0.7245219,0.006952918,0.00064492866,0.0019288979,0.000380626],"about_ca_topic_score_codex":0.000004898153,"about_ca_topic_score_gemma":0.000018455547,"teacher_disagreement_score":0.6673788,"about_ca_system_score_codex":0.000027509313,"about_ca_system_score_gemma":0.00006583306,"threshold_uncertainty_score":0.3774991},"labels":[],"label_agreement":null},{"id":"W2150318828","doi":"10.1287/trsc.37.1.23.12818","title":"Outsourcing Logistics: Designing Transportation Contracts Between a Manufacturer and a Transporter","year":2003,"lang":"en","type":"article","venue":"Transportation Science","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bidding; Consignment; Outsourcing; Order (exchange); Process (computing); Operations research; Computer science; Production (economics); Supply chain; Exploit; Business; Engineering; Microeconomics; Economics; Marketing","score_opus":0.015266877190926304,"score_gpt":0.22988874417974015,"score_spread":0.21462186698881383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150318828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17779142,0.000070067996,0.82095987,0.000012045861,0.00012048084,0.00017628957,0.00003598153,0.00023957067,0.00059428514],"genre_scores_gemma":[0.96473104,0.000051645085,0.035029236,0.00003758862,0.000021208505,0.000013963223,0.0000670459,0.000026770611,0.000021481399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9986139,0.000012525287,0.00036804943,0.00033678388,0.00031205968,0.00035669736],"domain_scores_gemma":[0.999465,0.00008107946,0.00006524527,0.00014552526,0.00007637691,0.0001667772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033203978,0.00020602914,0.00020529437,0.00017597439,0.00020308497,0.00006521037,0.0001104719,0.00006772308,0.000028283412],"category_scores_gemma":[0.000030775052,0.00020828343,0.000034079287,0.0002813819,0.00023920301,0.0005180074,3.70396e-7,0.00017150822,0.000004571993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074355803,0.000010477805,0.008309392,0.000063138774,0.000013836603,0.000014842311,0.002925905,0.980173,0.0038023687,0.0023848275,0.000005904752,0.0022888891],"study_design_scores_gemma":[0.002340818,0.00012536295,0.72566855,0.00014593729,0.00032975862,0.00001014571,0.0013315373,0.017196434,0.23875041,0.010185877,0.0023323416,0.0015828544],"about_ca_topic_score_codex":0.000011889932,"about_ca_topic_score_gemma":0.000044861896,"teacher_disagreement_score":0.9629766,"about_ca_system_score_codex":0.000041786676,"about_ca_system_score_gemma":0.000036861733,"threshold_uncertainty_score":0.84935516},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014225003015723055,"score_gpt":0.24005521850299194,"score_spread":0.2258302154872689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150889816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054731917,0.00009498162,0.9348927,0.000098982106,0.000044942008,0.00062925793,0.000036367604,0.00008403837,0.009386802],"genre_scores_gemma":[0.98829204,0.000037484544,0.0114971055,0.00002951468,0.000010474384,0.00005376846,0.000018856914,0.000004539932,0.00005620497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995436,0.000002258969,0.000096646116,0.00011309978,0.00012909091,0.0001152902],"domain_scores_gemma":[0.9998427,0.000025584006,0.000010498236,0.000060374634,0.000024555227,0.000036283873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017665549,0.000052265346,0.000045175082,0.000021258471,0.00014687226,0.00003604461,0.00006943565,0.0000145746935,0.00005146542],"category_scores_gemma":[0.0000011405601,0.000038492337,0.0000132318555,0.000114011506,0.00014159718,0.00010951825,4.994172e-7,0.00003367827,7.121093e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013324987,0.000033745982,0.0007816778,0.00008896599,0.000015003799,0.000001078409,0.0038988125,0.8999333,0.0013374316,0.011348586,0.00018604741,0.08236202],"study_design_scores_gemma":[0.00057340105,0.00008029753,0.10623855,0.000016848937,0.000071116505,0.000004318789,0.00076682295,0.8824071,0.0025472676,0.0015028934,0.005503691,0.00028767923],"about_ca_topic_score_codex":0.000019778532,"about_ca_topic_score_gemma":0.000013364446,"teacher_disagreement_score":0.93356013,"about_ca_system_score_codex":0.000016565431,"about_ca_system_score_gemma":0.00001295646,"threshold_uncertainty_score":0.1569672},"labels":[],"label_agreement":null},{"id":"W2152873544","doi":"10.1287/trsc.1060.0154","title":"Are Returns to Scale with Variable Network Size Adequate for Transport Industry Structure Analysis?","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Aviation Industry Analysis and Trends","field":"Economics, Econometrics and Finance","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia","keywords":"Variable (mathematics); Scale (ratio); Transport engineering; Network analysis; Returns to scale; Econometrics; Engineering; Computer science; Economics; Geography; Mathematics; Microeconomics; Production (economics)","score_opus":0.019311654372514635,"score_gpt":0.23210904445484598,"score_spread":0.21279739008233134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152873544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85389113,0.000041601335,0.14233874,0.0005153682,0.000120778685,0.00022261922,0.0009876994,0.000041680665,0.0018404053],"genre_scores_gemma":[0.9885475,6.699673e-7,0.008721976,0.00027395503,0.00012866737,0.000042458876,0.00014950322,0.0000130797125,0.0021222099],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9981518,0.0000049778428,0.0006301058,0.0006552244,0.00014807832,0.0004098169],"domain_scores_gemma":[0.99877435,0.000040817806,0.0005543437,0.00031498945,0.00016457704,0.00015092174],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005197407,0.00017007424,0.0004137024,0.00031797227,0.00033145546,0.00008251815,0.00028916044,0.00016979307,0.00093773124],"category_scores_gemma":[0.000015916308,0.00016252884,0.00012544107,0.0053865737,0.000113853406,0.00045517483,0.000002088076,0.0001968651,0.000011604007],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002173115,0.000025249283,0.7115355,0.000005135095,0.000063301224,0.0000015065693,0.00018229088,0.25295877,0.000018173952,0.035036284,0.00013381381,0.00001822667],"study_design_scores_gemma":[0.00033052015,0.00003234612,0.99013317,0.000009778148,0.00015182393,3.570113e-7,0.0001229091,0.0015298319,0.00009147076,0.005124155,0.0022285853,0.0002450831],"about_ca_topic_score_codex":0.00039717348,"about_ca_topic_score_gemma":0.003061837,"teacher_disagreement_score":0.27859762,"about_ca_system_score_codex":0.000054986762,"about_ca_system_score_gemma":0.000055763452,"threshold_uncertainty_score":0.99997556},"labels":[],"label_agreement":null},{"id":"W2155694204","doi":"10.1287/trsc.1120.0449","title":"Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Branch and cut; Bottleneck traveling salesman problem; Bounding overwatch; Mathematics; 2-opt; Traveling purchaser problem; Integer programming; Tree traversal; Branch and bound; Graph; Combinatorics; Hamiltonian path; Time complexity; Combinatorial optimization; Mathematical optimization; Algorithm; Computer science","score_opus":0.015636451574653952,"score_gpt":0.270342152026532,"score_spread":0.25470570045187807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155694204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08173584,0.00016525511,0.91764283,0.00004282299,0.000051465056,0.00018684712,0.000013527213,0.0000842287,0.00007720567],"genre_scores_gemma":[0.8025653,0.000051933966,0.19724669,0.000019994799,0.000024647567,0.00001918296,0.000006534246,0.000009810644,0.00005594159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992562,0.000012158537,0.00017593341,0.00014715585,0.0001965027,0.00021208452],"domain_scores_gemma":[0.9995829,0.00014672353,0.000033283748,0.00009974021,0.000054974043,0.00008237464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225205,0.00007946468,0.00010400049,0.00012915599,0.00020721523,0.00005461346,0.00010075255,0.000026876596,0.000013755739],"category_scores_gemma":[0.000010216773,0.000063938474,0.000030011235,0.00069871807,0.00012114494,0.000327493,0.0000019386919,0.000054211345,0.0000020274708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037669406,0.000016799462,0.027648011,0.000051593477,0.00012653838,2.2523635e-7,0.008188063,0.663785,0.011630257,0.000569939,0.0000047197477,0.28797513],"study_design_scores_gemma":[0.00014277226,0.0000057943234,0.09547616,0.000004343101,0.00018207879,9.848304e-7,0.00007302087,0.89834815,0.005552477,0.000054015614,0.000059049264,0.000101143894],"about_ca_topic_score_codex":0.000008738562,"about_ca_topic_score_gemma":0.000013460728,"teacher_disagreement_score":0.7208294,"about_ca_system_score_codex":0.00001406492,"about_ca_system_score_gemma":0.000011871233,"threshold_uncertainty_score":0.26073354},"labels":[],"label_agreement":null},{"id":"W2157589720","doi":"10.1287/trsc.2013.0503","title":"A New Formulation Based on Customer Delivery Patterns for a Maritime Inventory Routing Problem","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Solver; Integer programming; Revenue; Operations research; Mathematical optimization; Liquefied natural gas; Scheduling (production processes); Benchmark (surveying); Computer science; Routing (electronic design automation); Lagrangian relaxation; Branch and price; Term (time); Engineering; Mathematics; Economics; Natural gas; Computer network","score_opus":0.01901026960619377,"score_gpt":0.2648938226044016,"score_spread":0.24588355299820783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157589720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08982789,0.0000021112037,0.90868056,0.0000557096,0.00011853426,0.0002825572,0.0000090283675,0.0002572012,0.0007663994],"genre_scores_gemma":[0.80480236,8.0852635e-7,0.19490977,0.0001355196,0.0000380339,0.000023313292,0.000030237043,0.000020008461,0.00003994046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988839,0.000019208932,0.00026999688,0.0002354972,0.00033762198,0.00025377882],"domain_scores_gemma":[0.9994488,0.00010774103,0.000059692484,0.0001554191,0.00011856869,0.00010981735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008750979,0.00011365355,0.000105641964,0.00020719453,0.00013993714,0.000056658206,0.0001614809,0.00006339344,0.000036837784],"category_scores_gemma":[0.00004956092,0.00012306633,0.00004663052,0.00046678912,0.00002366332,0.00039399977,0.0000015439722,0.00009735434,0.000010681987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009956921,0.000007626268,0.010058846,0.000051424235,0.0000019318607,1.4278272e-7,0.00038118352,0.9604078,0.0024838445,0.0021132496,0.000038947288,0.024445074],"study_design_scores_gemma":[0.00040636284,0.00003338331,0.02986656,0.00005562657,0.000010581897,1.4105247e-7,0.000013868804,0.9650747,0.0038804833,0.00014494066,0.00036498054,0.00014838108],"about_ca_topic_score_codex":0.00002706092,"about_ca_topic_score_gemma":0.00003166112,"teacher_disagreement_score":0.71497446,"about_ca_system_score_codex":0.00007817391,"about_ca_system_score_gemma":0.00007638751,"threshold_uncertainty_score":0.50184995},"labels":[],"label_agreement":null},{"id":"W2158121860","doi":"10.1287/trsc.1110.0357","title":"Risk Aversion, the Value of Information, and Traffic Equilibrium","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Economic and Environmental Valuation","field":"Economics, Econometrics and Finance","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Agence Nationale de la Recherche","keywords":"Private information retrieval; Value of information; Risk aversion (psychology); The Internet; Population; Business; Microeconomics; Actuarial science; Expected utility hypothesis; Economics; Risk analysis (engineering); Computer science; Computer security","score_opus":0.05149043970239357,"score_gpt":0.1950721062556506,"score_spread":0.14358166655325705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158121860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99361986,0.00006995407,0.003148704,0.000054862878,0.00008417546,0.00009279843,0.00004963574,0.0000075304747,0.0028724761],"genre_scores_gemma":[0.9988493,0.00009336449,0.0009505764,0.00006572963,0.000003864249,0.0000037069951,0.0000065623535,0.0000020116306,0.00002493742],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999412,0.0000042294496,0.0003451727,0.000113511895,0.00003913672,0.000085944725],"domain_scores_gemma":[0.99955064,0.000014569329,0.00026912027,0.00011947389,0.00001404826,0.00003215141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007695132,0.000044366472,0.00007662446,0.000085015265,0.00009534336,0.000014086387,0.00014390453,0.000018960043,0.00020327466],"category_scores_gemma":[0.000021562426,0.000039525363,0.00002236972,0.0001707739,0.00032595935,0.0009524442,0.0000045490947,0.000035788624,0.00009754986],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001044916,0.000024039959,0.8075548,0.000011376943,0.0000072342,6.4647104e-8,0.016530342,0.002863609,0.00007269476,0.17072998,0.000038354297,0.0021570765],"study_design_scores_gemma":[0.00015734948,0.00002348804,0.98940986,0.0000017983899,0.000004093324,2.6152162e-7,0.00045013844,0.0040415972,0.00046795237,0.005075121,0.00031649458,0.000051864597],"about_ca_topic_score_codex":0.0001776539,"about_ca_topic_score_gemma":0.00000952517,"teacher_disagreement_score":0.18185505,"about_ca_system_score_codex":0.000017764703,"about_ca_system_score_gemma":0.000014467574,"threshold_uncertainty_score":0.22257149},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017258190346143072,"score_gpt":0.24024294705219787,"score_spread":0.2229847567060548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158354221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6949833,0.000028775385,0.30441654,0.000008064416,0.00001335981,0.00015001094,0.0000048332677,0.00007325473,0.00032189486],"genre_scores_gemma":[0.8911614,0.000020724403,0.108743496,0.0000176435,0.00000583305,0.000011674804,0.0000018511968,0.0000110977,0.000026298863],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993567,0.0000075701914,0.0001379247,0.00021370627,0.00011561459,0.00016849973],"domain_scores_gemma":[0.9996779,0.000057818124,0.000034860586,0.00007240798,0.00008214737,0.000074891934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037096624,0.000087327564,0.0001000916,0.000057228703,0.00015590871,0.000043928925,0.000056287518,0.000026129073,0.00000938379],"category_scores_gemma":[0.000022806817,0.00008215477,0.0000062739223,0.00024855442,0.00022254315,0.00048671305,0.0000029325954,0.0000417478,6.2320134e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029481534,0.000044996228,0.089127675,0.0006108946,0.000054799162,0.0000046107134,0.0909577,0.041643977,0.6807545,0.010076473,0.0000067453425,0.08642286],"study_design_scores_gemma":[0.00094984093,0.0001413683,0.61757255,0.000063468244,0.00003356256,0.000005591824,0.00033055607,0.27349317,0.106818415,0.00025938166,0.000022025142,0.00031006045],"about_ca_topic_score_codex":0.000011011995,"about_ca_topic_score_gemma":0.000012835928,"teacher_disagreement_score":0.57393605,"about_ca_system_score_codex":0.000008601941,"about_ca_system_score_gemma":0.000019480363,"threshold_uncertainty_score":0.33501744},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008700321292497787,"score_gpt":0.26349886339977696,"score_spread":0.25479854210727915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160968569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59682196,0.000019504969,0.4001324,0.00020654868,0.0005509635,0.00019176818,0.000003559404,0.00043031195,0.0016429841],"genre_scores_gemma":[0.9357206,0.0000111641575,0.06412217,0.00001575577,0.000009718112,0.000016238195,0.000007858237,0.000011899042,0.00008460102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913996,0.000011840973,0.00020827077,0.00014770248,0.00029061738,0.00020157734],"domain_scores_gemma":[0.99939525,0.000070261514,0.00003690429,0.00020509967,0.00023229871,0.000060164268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096110936,0.00007433932,0.0000504626,0.00007298324,0.00033022088,0.000091892194,0.00027259003,0.000034664405,0.000016513906],"category_scores_gemma":[0.000063896434,0.00005941708,0.000015017975,0.001236921,0.00028916862,0.0003469442,0.0000013297503,0.00017003989,0.000023901193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032961204,0.000008824373,0.0014910145,0.000022163269,0.000004444311,5.663792e-7,0.0018058268,0.66945934,0.2897162,0.010108516,0.000034441684,0.027345354],"study_design_scores_gemma":[0.0001682628,0.000009783476,0.111231945,0.0000099923345,0.000007847961,0.0000018273598,0.00015676218,0.8708845,0.015104164,0.0011578506,0.0010991818,0.00016790093],"about_ca_topic_score_codex":0.0000064575934,"about_ca_topic_score_gemma":0.00020760918,"teacher_disagreement_score":0.33889863,"about_ca_system_score_codex":0.000026263711,"about_ca_system_score_gemma":0.00006965539,"threshold_uncertainty_score":0.25398254},"labels":[],"label_agreement":null},{"id":"W2161733364","doi":"10.1287/trsc.1050.0130","title":"Inbound Logistic Planning: Minimizing Transportation and Inventory Cost","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lagrangian relaxation; Mathematical optimization; Heuristic; Supply chain; Operations research; Supply chain management; Computer science; Nonlinear programming; Set (abstract data type); Integer programming; Relaxation (psychology); Pipeline (software); Linear programming; Inventory theory; Nonlinear system; Inventory control; Mathematics","score_opus":0.04512122447174366,"score_gpt":0.305077298297317,"score_spread":0.25995607382557334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161733364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69433707,0.00012699571,0.30403093,0.000024482357,0.00016681432,0.00014153242,0.000014977735,0.0002582293,0.00089900085],"genre_scores_gemma":[0.9702873,0.000011159611,0.029515244,0.000028965977,0.000030740342,0.0000152381845,0.000053963904,0.000017996537,0.000039359056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9988522,0.000014441676,0.0003266877,0.00024806178,0.0003123978,0.00024624527],"domain_scores_gemma":[0.9996099,0.000053791093,0.00005611049,0.00011547365,0.0000804278,0.000084332845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045610053,0.00012476403,0.00012053743,0.00019619214,0.0001755363,0.00007760276,0.0001267225,0.000050366794,0.000018283805],"category_scores_gemma":[0.00002084489,0.00014010741,0.000021143851,0.0006603437,0.00029170094,0.00047866435,8.2515896e-7,0.00009775046,0.0000037399886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062262006,0.000012533846,0.07210508,0.000058547263,0.0000034037193,0.000008929653,0.0016449525,0.90789205,0.013330882,0.0033561438,0.00006744932,0.0015138148],"study_design_scores_gemma":[0.00047020562,0.000017107956,0.7916463,0.000048270915,0.00002745824,0.0000022752129,0.00025413866,0.19999889,0.0057665757,0.000690802,0.00077976537,0.00029821816],"about_ca_topic_score_codex":0.00004665028,"about_ca_topic_score_gemma":0.00006860267,"teacher_disagreement_score":0.7195412,"about_ca_system_score_codex":0.00005115958,"about_ca_system_score_gemma":0.000047053498,"threshold_uncertainty_score":0.57134145},"labels":[],"label_agreement":null},{"id":"W2161827144","doi":"10.1287/trsc.1030.0039","title":"A New Look at the Multiclass Network Equilibrium Problem","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Variational inequality; Solver; Convergence (economics); Mathematical optimization; Class (philosophy); Operator (biology); Property (philosophy); Computer science; Flow network; Mathematical economics; Mathematics; Economics; Artificial intelligence","score_opus":0.012934888887719436,"score_gpt":0.24490170712119966,"score_spread":0.23196681823348023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161827144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101610245,0.000033392622,0.9797601,0.008475451,0.000193752,0.0001543797,0.0000018623099,0.000106690335,0.001113358],"genre_scores_gemma":[0.6681787,0.00000673422,0.32793117,0.0012018363,0.00006761957,0.0000111665895,0.0000102751055,0.000005286811,0.0025872088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984169,0.000015815505,0.00024703817,0.00037868356,0.0006698693,0.00027168915],"domain_scores_gemma":[0.9991842,0.000042187163,0.000108915854,0.0003443669,0.00017822544,0.00014213723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048817016,0.00009232674,0.000083881,0.000071895985,0.00039700302,0.00020563122,0.0009003798,0.000023268536,0.00010863749],"category_scores_gemma":[0.000014475894,0.00006493592,0.000059109203,0.0022949765,0.00014296423,0.0010270478,0.00002669944,0.000059580143,0.00012017462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036423312,0.000017277716,0.0014930608,0.0000020533812,0.000005970418,0.0000017938636,0.0015091536,0.7769707,0.0014510525,0.21695544,0.00039283585,0.0011970601],"study_design_scores_gemma":[0.0029968766,0.00014525378,0.22011074,0.000060859413,0.00008786916,0.000016472197,0.00014484065,0.65666336,0.012124121,0.09334252,0.0133383935,0.00096866494],"about_ca_topic_score_codex":0.00013228618,"about_ca_topic_score_gemma":0.0003650838,"teacher_disagreement_score":0.6580177,"about_ca_system_score_codex":0.00008766103,"about_ca_system_score_gemma":0.0004974808,"threshold_uncertainty_score":0.30534664},"labels":[],"label_agreement":null},{"id":"W2162598493","doi":"10.1287/trsc.1030.0022","title":"Coffee, Tea, or …?: A Markov Decision Process Model for Airline Meal Provisioning","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Mitacs","keywords":"Markov decision process; Provisioning; Operations research; Markov process; Process (computing); Computer science; Decision process; Liberian dollar; Upload; Service (business); Decision model; Business; Engineering; Marketing; Mathematics; Telecommunications; Process management; Statistics; Finance","score_opus":0.03722817832996832,"score_gpt":0.3009554420369594,"score_spread":0.26372726370699107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162598493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5079147,0.000011360008,0.48805532,0.00077066204,0.00030630938,0.0009738929,0.000007091944,0.00016652865,0.001794125],"genre_scores_gemma":[0.9872036,0.0000028814175,0.010557712,0.0014921629,0.00015074795,0.00011731092,0.000035764304,0.000017964303,0.00042186896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815595,0.0000012126904,0.00034891002,0.00046444518,0.0006904778,0.00033898198],"domain_scores_gemma":[0.9992358,0.000024113599,0.00016092305,0.00018748787,0.000363004,0.000028674107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073039794,0.00015243585,0.00014206133,0.00035157058,0.00045951255,0.0002509632,0.00043142948,0.000032826207,0.00009867804],"category_scores_gemma":[0.000111434776,0.00011969142,0.00005798638,0.0010819023,0.00014922615,0.0023395703,0.000013330767,0.000060015624,0.000030790547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00175613,0.00073436054,0.008316513,0.0012658916,0.000026161244,0.000028264207,0.004100045,0.7790788,0.0028164824,0.12116212,0.0025151898,0.07820005],"study_design_scores_gemma":[0.0035962758,0.000063094005,0.012779019,0.00025572657,0.00007150038,5.710771e-7,0.0013743063,0.9457665,0.0006620458,0.029605277,0.005307579,0.0005181198],"about_ca_topic_score_codex":0.00007428034,"about_ca_topic_score_gemma":0.00045847407,"teacher_disagreement_score":0.47928888,"about_ca_system_score_codex":0.000056376288,"about_ca_system_score_gemma":0.00016961752,"threshold_uncertainty_score":0.48808748},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04486344256649982,"score_gpt":0.279911263394904,"score_spread":0.2350478208284042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163826616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9723072,0.000042428215,0.026091982,0.000541849,0.00004154843,0.0004057174,0.000010462842,0.00004015632,0.000518647],"genre_scores_gemma":[0.9962356,0.000045225708,0.003439462,0.00011656102,0.000008938375,0.00003819591,0.000012605524,0.000005837011,0.00009756936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9986544,0.000040471423,0.00025055514,0.00024049656,0.00061193446,0.00020212732],"domain_scores_gemma":[0.9994355,0.000041024283,0.000115397044,0.0001146682,0.00024037388,0.000053063424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077071856,0.00008934803,0.00010905834,0.00014048583,0.00028420016,0.0000730204,0.000204702,0.000048309925,0.0000035333574],"category_scores_gemma":[0.000041651663,0.000061858766,0.000017740143,0.001087671,0.00092323124,0.0011544012,0.0000011187831,0.000078102064,6.510496e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029438964,0.00013473303,0.23398371,0.00005647484,0.000005151544,0.0000033156255,0.07243483,0.58743846,0.0073008053,0.09806564,0.000007707754,0.00027476708],"study_design_scores_gemma":[0.0016564069,0.00012843264,0.9659437,0.00021504171,0.000042769214,8.7165057e-7,0.019865032,0.005312808,0.004644889,0.001454402,0.00045739004,0.00027826763],"about_ca_topic_score_codex":0.0014613019,"about_ca_topic_score_gemma":0.011189344,"teacher_disagreement_score":0.73196,"about_ca_system_score_codex":0.000034333232,"about_ca_system_score_gemma":0.00059529993,"threshold_uncertainty_score":0.6243917},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01505666634643012,"score_gpt":0.26844187007922954,"score_spread":0.25338520373279944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167917756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6718024,0.000028956078,0.32718495,0.000021297723,0.00004046094,0.00067684695,0.000017486283,0.00018449427,0.000043071144],"genre_scores_gemma":[0.8566129,0.00000620084,0.14318779,0.000028376719,0.000023918812,0.000093355135,0.00000594104,0.000026199235,0.000015302487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878746,0.000045758734,0.00025861865,0.00032204314,0.00028700178,0.00029911642],"domain_scores_gemma":[0.9983896,0.0010675914,0.00007190104,0.00019848422,0.00016438839,0.00010804001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009996586,0.00015784585,0.0001704112,0.00006543877,0.00062334986,0.0000684314,0.00020337768,0.000035398625,0.000005235608],"category_scores_gemma":[0.00016501769,0.000119159165,0.000025385414,0.00051601516,0.0003880107,0.0004192572,0.0000025873096,0.00010314896,0.0000020707423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042501964,0.000013940632,0.006539883,0.00005787425,0.000016773378,0.000007572212,0.005356669,0.95089537,0.030629007,0.000077424666,0.000002142544,0.0063608345],"study_design_scores_gemma":[0.0005045591,0.00010266433,0.15967754,0.000029747689,0.000051188646,0.000010754833,0.00010209217,0.8351968,0.004120089,0.0000249035,0.000015418043,0.00016426669],"about_ca_topic_score_codex":0.000017271148,"about_ca_topic_score_gemma":0.000018065739,"teacher_disagreement_score":0.18481049,"about_ca_system_score_codex":0.000031375974,"about_ca_system_score_gemma":0.000053181087,"threshold_uncertainty_score":0.48591697},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016207461148893893,"score_gpt":0.27872062482300336,"score_spread":0.2625131636741095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168210873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88151133,0.000015433645,0.11699202,0.000025738147,0.000073864976,0.000047559468,0.0000030356498,0.0001526196,0.0011783801],"genre_scores_gemma":[0.9524834,0.000005465827,0.047455937,0.000027649323,0.000008816617,6.5603524e-7,0.0000020138223,0.000004855401,0.000011202145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99929297,0.000007545733,0.0002013117,0.000109639564,0.0002467599,0.0001417658],"domain_scores_gemma":[0.99970984,0.00002640215,0.000034427307,0.00011848963,0.00006531381,0.000045542954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045770145,0.000047393834,0.00007605713,0.00008807798,0.00003951664,0.000013899265,0.0001518233,0.000021686143,0.000020099036],"category_scores_gemma":[0.000037628,0.00005626586,0.000021547581,0.0007880446,0.00007153179,0.00025946775,7.8256073e-7,0.000052035866,0.0000048116285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027864803,0.000012932862,0.0052817157,0.000009848149,0.0000019441482,0.0000016844091,0.0024108433,0.7427246,0.18118358,0.0031060602,0.000011438612,0.06525254],"study_design_scores_gemma":[0.00015659064,0.000018550732,0.7357615,0.000015455333,0.0000046969853,3.6527558e-7,0.00006670622,0.20956393,0.05406232,0.00020571904,0.00005112025,0.0000930516],"about_ca_topic_score_codex":0.000004308285,"about_ca_topic_score_gemma":0.0000016944937,"teacher_disagreement_score":0.7304798,"about_ca_system_score_codex":0.000018225212,"about_ca_system_score_gemma":0.000026891968,"threshold_uncertainty_score":0.22944552},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015211003904855951,"score_gpt":0.26064639540075274,"score_spread":0.2454353914958968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170216278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69623727,0.00018796243,0.3028174,0.000024318397,0.000103304985,0.000108910834,0.000002688703,0.00015416907,0.000363964],"genre_scores_gemma":[0.9745452,0.0000728049,0.025294768,0.000016488988,0.000017342538,0.0000067208703,0.0000028647557,0.000015237459,0.000028598939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989633,0.000022322505,0.00027527616,0.00022532578,0.00026275692,0.00025103844],"domain_scores_gemma":[0.9996052,0.00009425612,0.000025456782,0.00011726491,0.00006246607,0.00009535802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063269865,0.000099431316,0.0001262238,0.00018056248,0.000084974316,0.00007321506,0.00013175701,0.000046341287,0.000010251705],"category_scores_gemma":[0.00004052563,0.000109867025,0.00001400907,0.0010295223,0.00010302744,0.00037371385,9.638601e-7,0.000107385815,0.000004765418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039914667,0.000004379386,0.016766535,0.000027746939,0.0000012989735,0.00001830896,0.0013230279,0.95778126,0.02233081,0.00024128308,4.2559356e-7,0.0015009108],"study_design_scores_gemma":[0.00027244462,0.000009525897,0.02700888,0.000037955248,0.000004767232,0.000003824136,0.0002437881,0.97091496,0.001261985,0.000021274307,0.00008975247,0.00013086619],"about_ca_topic_score_codex":0.00003630184,"about_ca_topic_score_gemma":0.000029150899,"teacher_disagreement_score":0.2783079,"about_ca_system_score_codex":0.000046732617,"about_ca_system_score_gemma":0.000030573017,"threshold_uncertainty_score":0.44802472},"labels":[],"label_agreement":null},{"id":"W2170951393","doi":"10.1287/trsc.1120.0454","title":"Designing Production-Inventory-Transportation Systems with Capacitated Cross-Docks","year":2013,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Column generation; Truck; Mathematical optimization; Integer programming; Cutting stock problem; Safety stock; Supply chain; Transportation theory; Facility location problem; Computer science; Operations research; Fixed charge; Nonlinear programming; Linear programming; Set (abstract data type); Optimization problem; Nonlinear system; Mathematics; Engineering","score_opus":0.01946998476016498,"score_gpt":0.2618670104765673,"score_spread":0.24239702571640231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170951393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68844163,0.00003216568,0.3098031,0.000022149809,0.0004083073,0.000427837,0.00000643671,0.00052305526,0.0003353215],"genre_scores_gemma":[0.9527215,0.0000078839,0.046870016,0.000012688756,0.00004047423,0.00012224026,0.000038740054,0.00003652732,0.0001499562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9981532,0.000029680019,0.00043625795,0.00039399404,0.0006106324,0.00037621372],"domain_scores_gemma":[0.99884397,0.000031936197,0.00010231748,0.00025139528,0.00061298657,0.00015740612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063966814,0.00018753888,0.00016379493,0.00024030097,0.00028849216,0.00023735302,0.00022331254,0.00005873009,0.00007097229],"category_scores_gemma":[0.00003588372,0.00017548013,0.000027975428,0.0015075067,0.0003280803,0.0017668172,6.1929745e-7,0.000150803,0.000048707927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041726857,0.000009187992,0.043866348,0.000064100794,0.000008698199,0.0000018725643,0.001683892,0.9161183,0.03780263,0.00018402781,0.00003868727,0.00021807659],"study_design_scores_gemma":[0.00066201494,0.00007154513,0.55605555,0.0001771051,0.00004620243,0.000008719174,0.0011264943,0.35840404,0.082514,0.0001052496,0.00012511395,0.00070399925],"about_ca_topic_score_codex":0.00014306004,"about_ca_topic_score_gemma":0.000033239594,"teacher_disagreement_score":0.5577143,"about_ca_system_score_codex":0.00009517271,"about_ca_system_score_gemma":0.00009256057,"threshold_uncertainty_score":0.7155872},"labels":[],"label_agreement":null},{"id":"W2172237755","doi":"10.1287/trsc.34.3.312.12298","title":"The Shortest Path Problem with Time Windows and Linear Waiting Costs","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Shortest path problem; Constrained Shortest Path First; K shortest path routing; Mathematical optimization; Path (computing); Longest path problem; Node (physics); Yen's algorithm; Computer science; Shortest Path Faster Algorithm; Integer programming; Fast path; Euclidean shortest path; Linear programming; Mathematics; Dijkstra's algorithm; Graph; Engineering; Theoretical computer science; Computer network","score_opus":0.010198130635898821,"score_gpt":0.2597355747385383,"score_spread":0.24953744410263948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172237755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97637564,0.000050970968,0.0013665481,0.0012512798,0.000034770055,0.0003874331,0.000016628515,0.00016071925,0.020356039],"genre_scores_gemma":[0.99513286,0.00011898996,0.002962534,0.000088074434,0.00003098887,0.000014548655,0.000024304642,0.000006793123,0.0016209054],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99865264,0.00003357656,0.00019488923,0.00025183734,0.0005898997,0.00027718232],"domain_scores_gemma":[0.9994322,0.00011111277,0.0000673,0.00009281905,0.00017020563,0.00012634973],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00092704006,0.00008140291,0.00007316843,0.000042952783,0.001872868,0.00016257247,0.00018462306,0.000032463737,0.00012923776],"category_scores_gemma":[0.000018728728,0.000057784375,0.000014126676,0.00074349897,0.000917353,0.00059733813,5.552263e-7,0.0000800946,0.000023785162],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039478275,0.00017576868,0.32075214,0.00002615678,0.000036069134,0.00004881515,0.17161576,0.137561,0.0016389,0.08650883,0.00035474784,0.28088704],"study_design_scores_gemma":[0.0015273466,0.00027549715,0.8844213,0.0002470575,0.00009131431,0.0000056909216,0.010636066,0.040374238,0.00046866012,0.00057919556,0.060522303,0.0008513372],"about_ca_topic_score_codex":0.00042720244,"about_ca_topic_score_gemma":0.0016521978,"teacher_disagreement_score":0.56366915,"about_ca_system_score_codex":0.000027718614,"about_ca_system_score_gemma":0.00025704963,"threshold_uncertainty_score":0.99942654},"labels":[],"label_agreement":null},{"id":"W2195088785","doi":"10.1287/trsc.2015.0606","title":"Modeling Demand Uncertainty in Two-Tier City Logistics Tactical Planning","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Plan (archaeology); Operations research; Computer science; Time horizon; A priori and a posteriori; Service (business); Stochastic programming; Process (computing); Service level; Routing (electronic design automation); Point (geometry); Mathematical optimization; Engineering; Business","score_opus":0.12161014908628681,"score_gpt":0.3150124877331621,"score_spread":0.19340233864687528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195088785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44438028,0.00008459685,0.5529852,0.000012774437,0.00023006335,0.000067363566,0.000012863615,0.00011560891,0.0021112578],"genre_scores_gemma":[0.9958531,0.000008491496,0.0040117824,0.000035554836,0.000036462035,0.0000054048905,0.000024565401,0.000011881306,0.000012743285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986527,0.000007696098,0.00032667222,0.00023742404,0.00043164473,0.00034383757],"domain_scores_gemma":[0.99947447,0.000029547722,0.000017413584,0.00015231884,0.00011369445,0.00021253823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005478525,0.00013142712,0.00015590574,0.00016029138,0.000059305934,0.000038969618,0.00020816912,0.000044920016,0.000014508038],"category_scores_gemma":[0.000046842342,0.0001291144,0.000024319866,0.0006178475,0.00024032191,0.0003243916,0.0000018924633,0.00020731344,0.000008816739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000121693765,0.000013855938,0.02742401,0.000010784837,0.000002036636,0.00003632415,0.0014459436,0.96737367,0.00021516508,0.0033597213,0.000014346389,0.00009194907],"study_design_scores_gemma":[0.00046119987,0.000013762834,0.013395162,0.000020405441,0.000011754239,0.0000014279544,0.00021056551,0.98362696,0.00017964467,0.0017946913,0.00010365878,0.00018073733],"about_ca_topic_score_codex":0.00013587686,"about_ca_topic_score_gemma":0.0004056369,"teacher_disagreement_score":0.55147284,"about_ca_system_score_codex":0.00011380151,"about_ca_system_score_gemma":0.00012038375,"threshold_uncertainty_score":0.5265133},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012090626693916258,"score_gpt":0.2664546609831448,"score_spread":0.25436403428922855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255469947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889144,0.005194201,0.004343276,0.0010399478,0.000009994376,0.00019739576,0.000020589945,0.00010466721,0.00017556701],"genre_scores_gemma":[0.99609345,0.0036050929,0.0001842412,0.000060506114,0.00001258971,0.000008227719,0.0000044473672,0.000007780704,0.000023653021],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9989389,0.000019855668,0.0001248234,0.00023699006,0.00037525804,0.00030417132],"domain_scores_gemma":[0.9994995,0.000043576256,0.000020340905,0.00012523393,0.00020924081,0.000102101505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042763655,0.000084298306,0.000101432954,0.00011142931,0.00016316134,0.000028802078,0.00012806137,0.000029641684,0.000024417272],"category_scores_gemma":[0.000029371246,0.000054557444,0.0000131448105,0.0018683414,0.00028005283,0.00047487917,0.0000022464008,0.00013106561,0.000004673408],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007318446,0.00006368026,0.034506552,0.0006327429,0.000049055714,0.00002590622,0.0044213245,0.00031341924,0.83410347,0.00985157,0.0064690365,0.10949009],"study_design_scores_gemma":[0.00067179085,0.00028699587,0.9320712,0.00044131576,0.000053159823,0.000015614987,0.0004922168,0.0011962355,0.061592355,0.00082234124,0.0020318248,0.00032494296],"about_ca_topic_score_codex":0.000009772243,"about_ca_topic_score_gemma":0.000008517997,"teacher_disagreement_score":0.89756465,"about_ca_system_score_codex":0.000108812914,"about_ca_system_score_gemma":0.00004852249,"threshold_uncertainty_score":0.22247879},"labels":[],"label_agreement":null},{"id":"W2281133739","doi":"10.1287/trsc.2015.0637","title":"An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"Mathematical optimization; Routing (electronic design automation); Computer science; Column generation; Branch and cut; Integer programming; Cluster analysis; Economic shortage; Time horizon; Linear programming; Branch and price; Operations research; Integer (computer science); Mathematics; Artificial intelligence","score_opus":0.013733779326738225,"score_gpt":0.2711333527092343,"score_spread":0.257399573382496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281133739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91607726,0.000014208762,0.08343986,0.00008726912,0.000013827692,0.00011768699,0.0000030935187,0.00014862379,0.00009818796],"genre_scores_gemma":[0.9436176,0.000008876662,0.056340117,0.000013319911,0.0000032324244,0.0000062674376,0.0000013975729,0.000007110539,0.0000020948721],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99924594,0.00003766046,0.00021645549,0.00014965402,0.0002245412,0.00012572078],"domain_scores_gemma":[0.9996712,0.000051354647,0.000054222393,0.00013115282,0.00006357799,0.000028483431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093560613,0.000068226516,0.000078981466,0.00009216312,0.00008185882,0.000029229384,0.00013622949,0.00001769005,0.0000039632673],"category_scores_gemma":[0.000019109133,0.00004017155,0.0000070013766,0.0004876103,0.00021347654,0.0004626468,0.0000016617456,0.00003749122,1.8461594e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026964202,0.000045706893,0.42627692,0.00009293105,0.000008430901,0.0000046234804,0.043512125,0.34970465,0.16013433,0.0028891177,0.000004438472,0.017299755],"study_design_scores_gemma":[0.00055135466,0.00006527652,0.5392987,0.0001622882,0.0000095470305,0.000004167174,0.0011635527,0.4413053,0.017117698,0.00014594998,0.00001817291,0.00015794073],"about_ca_topic_score_codex":0.00006751685,"about_ca_topic_score_gemma":0.00011816711,"teacher_disagreement_score":0.14301664,"about_ca_system_score_codex":0.000016931075,"about_ca_system_score_gemma":0.000042497948,"threshold_uncertainty_score":0.16381483},"labels":[],"label_agreement":null},{"id":"W2370292695","doi":"10.1287/trsc.2016.0681","title":"<i>Transportation Science</i> Special Issue on Freight Transportation and Logistics, Part I","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Transport engineering; Traffic management; Engineering; Operations research; Business","score_opus":0.021610849827043362,"score_gpt":0.21998940799492084,"score_spread":0.19837855816787747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2370292695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8350197,0.00020368073,0.13113484,0.00068768254,0.005879221,0.0011250209,0.0022079234,0.0012857119,0.02245622],"genre_scores_gemma":[0.99694616,0.00037888973,0.0012569798,0.00013663057,0.00086913083,0.000023067436,0.00011196126,0.000038796796,0.00023840317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9967209,0.00000933522,0.00067301316,0.00075678685,0.0011571686,0.0006828061],"domain_scores_gemma":[0.99877167,0.00008306662,0.000101068756,0.0003689396,0.00028832708,0.00038690068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005542146,0.0003513214,0.00029384063,0.0004137235,0.00041072795,0.0000987504,0.00045779004,0.00011560703,0.00049124955],"category_scores_gemma":[0.000030343379,0.00027881825,0.000068439105,0.0013092959,0.0025214546,0.001147106,9.0834595e-7,0.00017456905,0.00009961995],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005548359,0.0006183486,0.120826736,0.0006424071,0.00011411269,0.00040302053,0.015093097,0.02759592,0.27422863,0.4176859,0.013472033,0.12876496],"study_design_scores_gemma":[0.0021133036,0.0003297286,0.8001083,0.00025325504,0.00015408057,0.0000030306962,0.00025214843,0.00097210665,0.0834844,0.0038617176,0.10715523,0.0013126766],"about_ca_topic_score_codex":0.000027735046,"about_ca_topic_score_gemma":0.00055067637,"teacher_disagreement_score":0.6792816,"about_ca_system_score_codex":0.0001298905,"about_ca_system_score_gemma":0.00018218429,"threshold_uncertainty_score":0.9999664},"labels":[],"label_agreement":null},{"id":"W2413161265","doi":"10.1287/trsc.2016.0692","title":"A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Lagrangian relaxation; Mathematical optimization; Facility location problem; Branch and bound; Heuristic; Linear programming relaxation; Integer programming; Lagrangian; Computer science; Branch and price; Relaxation (psychology); Mathematics; Applied mathematics","score_opus":0.04783518975537899,"score_gpt":0.24734914022650195,"score_spread":0.19951395047112297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2413161265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06505918,0.000014229561,0.9292028,0.0040031224,0.00013463105,0.0010486782,0.00007465803,0.00009189079,0.0003708033],"genre_scores_gemma":[0.9949798,0.000002180675,0.0039382163,0.0006808532,0.000030073552,0.0001621702,0.000044628596,0.000006598715,0.00015550223],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984693,0.0000076231986,0.00030082348,0.00042059922,0.0005205289,0.00028112662],"domain_scores_gemma":[0.99900323,0.00007019156,0.000105795785,0.00021964945,0.00057492655,0.000026223865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097545644,0.00015366416,0.000111096015,0.00014604765,0.00046723217,0.000181454,0.00023153366,0.000022516946,0.00015414973],"category_scores_gemma":[0.000042886168,0.000088463974,0.000033849494,0.0008494001,0.0009396567,0.0010063758,0.000005245055,0.000037074024,0.00003930511],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014727873,0.00027663575,0.0067676036,0.0003312741,0.000048724425,0.0000011502578,0.0006277395,0.006531793,0.013571047,0.02707976,0.00016151862,0.9444555],"study_design_scores_gemma":[0.017973254,0.00035344952,0.66924214,0.0006609716,0.0006740236,0.000002233851,0.0038652404,0.24867137,0.011275392,0.0105064185,0.034411848,0.0023636492],"about_ca_topic_score_codex":0.00043080127,"about_ca_topic_score_gemma":0.0015849752,"teacher_disagreement_score":0.9420918,"about_ca_system_score_codex":0.000058557955,"about_ca_system_score_gemma":0.00009766258,"threshold_uncertainty_score":0.36074564},"labels":[],"label_agreement":null},{"id":"W2421926607","doi":"10.1287/trsc.2015.0636","title":"A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Université de Montréal; Université du Québec à Montréal","keywords":"Travelling salesman problem; Solver; Mathematical optimization; Latency (audio); Routing (electronic design automation); Computer science; Class (philosophy); Mathematics","score_opus":0.048006483369849966,"score_gpt":0.29373111238555594,"score_spread":0.24572462901570596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2421926607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05245016,0.00012678142,0.9464952,0.000076254044,0.000047892954,0.0006480571,0.000007456624,0.000049987993,0.00009824438],"genre_scores_gemma":[0.83189243,0.00003926966,0.16795643,0.000011963711,0.0000075424578,0.00007419817,0.0000033185393,0.000010233293,0.0000045977285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896365,0.000071014,0.00027710834,0.00016695246,0.00033327533,0.00018799707],"domain_scores_gemma":[0.9992219,0.00041464146,0.000066758636,0.00016840559,0.00010418551,0.000024079767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001997099,0.000089953224,0.00011898812,0.00020329007,0.00012396448,0.00003902539,0.0002648916,0.00003171607,0.0000016852247],"category_scores_gemma":[0.000018392135,0.000044613254,0.00002698693,0.0016414681,0.00012413123,0.00027701608,6.4141153e-7,0.00004951341,2.016384e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021318008,0.000010892756,0.0005295347,0.000039734477,0.0000061602937,2.1816238e-7,0.0015973472,0.9777717,0.01714078,0.001782497,0.0000031164404,0.0010966858],"study_design_scores_gemma":[0.00068387715,0.000039872677,0.009847703,0.000050807837,0.000032264506,0.000002880182,0.000506177,0.98207563,0.0065841,0.0000718394,0.0000058442683,0.0000989958],"about_ca_topic_score_codex":0.000037433376,"about_ca_topic_score_gemma":0.0000046666682,"teacher_disagreement_score":0.7794423,"about_ca_system_score_codex":0.000040580046,"about_ca_system_score_gemma":0.00005276928,"threshold_uncertainty_score":0.18192758},"labels":[],"label_agreement":null},{"id":"W2468155677","doi":"10.1287/trsc.2015.0634","title":"Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Discretization; Mathematical optimization; Integer programming; Flow network; Lagrangian relaxation; Multi-commodity flow problem; Piecewise linear function; Mathematics; Flow (mathematics); Linear programming relaxation; Relaxation (psychology); Integer (computer science); Linear programming; Constraint (computer-aided design); Set (abstract data type); Branch and cut; Computer science","score_opus":0.020525424923256673,"score_gpt":0.2780080266119627,"score_spread":0.25748260168870607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468155677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027281538,0.000020686004,0.97122544,0.00023200373,0.00025908335,0.00039374587,0.00011881399,0.00033613152,0.00013255188],"genre_scores_gemma":[0.75558764,0.000018999366,0.2440423,0.000025784839,0.000053717995,0.00006332139,0.00008827475,0.00002279418,0.00009713558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988308,0.000017890909,0.00034241992,0.00025076384,0.00025933172,0.0002987849],"domain_scores_gemma":[0.99927056,0.0001307093,0.000062503575,0.00020714299,0.00022760453,0.00010149564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073118694,0.00012102401,0.0001170314,0.00007867015,0.00022888512,0.000034908346,0.00019994243,0.000056049113,0.000031387568],"category_scores_gemma":[0.00011191493,0.000091781905,0.00004044587,0.0006797738,0.00014238602,0.0007145714,0.0000030075646,0.00005440154,0.0000070240785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000501754,0.000010652355,0.0028396817,0.000019880106,0.000003738498,5.2624113e-8,0.0003504036,0.9718738,0.015192687,0.0008850663,0.00020216887,0.008616858],"study_design_scores_gemma":[0.00044533057,0.000017151538,0.006346729,0.000051018807,0.000012038199,2.1212578e-7,0.000015512833,0.984517,0.0056365156,0.0005231739,0.0022599983,0.0001753385],"about_ca_topic_score_codex":0.0000039255306,"about_ca_topic_score_gemma":0.000023867251,"teacher_disagreement_score":0.7283061,"about_ca_system_score_codex":0.00008545324,"about_ca_system_score_gemma":0.00003881785,"threshold_uncertainty_score":0.37427574},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06016170162792984,"score_gpt":0.3409432967948951,"score_spread":0.28078159516696527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468943938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84172213,0.00000970287,0.15216152,0.0031097576,0.00038399763,0.0002558618,0.000023340079,0.000050133156,0.0022835732],"genre_scores_gemma":[0.99617016,0.0000030468614,0.0008589402,0.00035036652,0.000081608254,0.00002429655,0.0000010115859,0.000005488066,0.0025050663],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9971193,0.000037333357,0.0005684942,0.00041312442,0.0015521575,0.00030956834],"domain_scores_gemma":[0.9974781,0.0009398472,0.0002716627,0.0002900439,0.0009542084,0.000066104294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061806566,0.00008396616,0.00009914644,0.00030727583,0.00081322336,0.00020946638,0.00084997324,0.000030634354,0.000398852],"category_scores_gemma":[0.002269422,0.00003842899,0.00007146455,0.0025421556,0.0003179993,0.0007037886,0.000008936928,0.000051400766,0.000040845287],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010949974,0.000034074128,0.04428736,0.000003459878,0.0000042348634,0.0000017029927,0.0011147929,0.00010095586,0.4263496,0.030174641,0.004378828,0.49344084],"study_design_scores_gemma":[0.0008633179,0.0000788925,0.89346135,0.000022705673,0.000011645211,0.0000056063004,0.00088238786,0.03967404,0.022592437,0.032664444,0.009544387,0.00019881962],"about_ca_topic_score_codex":0.000005865892,"about_ca_topic_score_gemma":0.000015536427,"teacher_disagreement_score":0.84917396,"about_ca_system_score_codex":0.000024254983,"about_ca_system_score_gemma":0.00017997745,"threshold_uncertainty_score":0.62547386},"labels":[],"label_agreement":null},{"id":"W2474007778","doi":"10.1287/trsc.2015.0628","title":"Network Pricing of Congestion-Free Networks: The Elastic and Linear Demand Case","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toll; Price elasticity of demand; Mathematical optimization; Flow network; Quadratic equation; Path (computing); Elasticity (physics); Revenue; Computer science; Mathematics; Economics; Microeconomics; Computer network","score_opus":0.018577951861976468,"score_gpt":0.28004958604830726,"score_spread":0.2614716341863308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474007778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6819051,0.00016346821,0.3153844,0.0015183804,0.00026292796,0.0002325441,0.000014814648,0.00006337828,0.00045503976],"genre_scores_gemma":[0.9973269,0.00012836167,0.00227536,0.0000717808,0.00007693812,0.000006469374,0.000002788494,0.0000045203547,0.00010689235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99889547,0.000056803005,0.00025718854,0.00019554177,0.00037102134,0.00022398664],"domain_scores_gemma":[0.9989019,0.0004763595,0.0001484844,0.00014709344,0.00023596747,0.00009016931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390299,0.00006829388,0.00009100423,0.000055820106,0.00080942886,0.00003053359,0.00020015947,0.00004209626,0.000028272001],"category_scores_gemma":[0.00021914236,0.00004251239,0.000019206132,0.00075600104,0.0011731494,0.00042338634,0.0000024534602,0.000048754482,0.0000012289732],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008277018,0.00003921296,0.28853315,0.000027022837,0.000017373686,0.00006888779,0.037620798,0.5071193,0.00045326987,0.15582304,0.00028036808,0.009934818],"study_design_scores_gemma":[0.0014592039,0.00011455324,0.9728269,0.00032647976,0.00014164421,0.000026824147,0.0051414366,0.013036925,0.00019274655,0.0046423078,0.0016861544,0.00040483454],"about_ca_topic_score_codex":0.0003309042,"about_ca_topic_score_gemma":0.0023435436,"teacher_disagreement_score":0.68429375,"about_ca_system_score_codex":0.000016203241,"about_ca_system_score_gemma":0.00014908519,"threshold_uncertainty_score":0.62255543},"labels":[],"label_agreement":null},{"id":"W2486472546","doi":"10.1287/trsc.2015.0665","title":"Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Université de Montréal","keywords":"Cardinality (data modeling); Fixed charge; Mathematics; Set (abstract data type); Cover (algebra); Flow network; Cutting-plane method; Representation (politics); Multi-commodity flow problem; Integer programming; Integer (computer science); Mathematical optimization; Network planning and design; Flow (mathematics); Linear programming; Class (philosophy); Computer science; Engineering; Artificial intelligence; Data mining","score_opus":0.07968868857637491,"score_gpt":0.2886115431773257,"score_spread":0.20892285460095078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486472546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07835821,0.00002398666,0.9201989,0.00016210203,0.0002012644,0.00031137024,0.00043499033,0.00016914331,0.0001400138],"genre_scores_gemma":[0.9787825,0.000014159496,0.020925863,0.000054456203,0.00003460203,0.00006383113,0.000060529044,0.0000110199535,0.00005305316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990349,0.000023106959,0.00026141707,0.00019831644,0.00019063654,0.0002916532],"domain_scores_gemma":[0.9990301,0.00050059415,0.00004664849,0.00017482568,0.00014469434,0.00010311128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007247712,0.00010634348,0.00012605713,0.00006241091,0.00026430684,0.00004511706,0.0001205531,0.00003785641,0.000072368784],"category_scores_gemma":[0.0001067336,0.00008429271,0.000027900473,0.00021295462,0.00036641344,0.00028900066,0.0000022432666,0.000046492874,0.0000034533812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023763331,0.00018951963,0.07910625,0.00067974045,0.000077389726,0.000021007309,0.007130839,0.7201855,0.02851851,0.120687686,0.019992186,0.023173718],"study_design_scores_gemma":[0.0028145458,0.00015205033,0.20437874,0.00016192283,0.000098512246,0.0000022877864,0.00030108637,0.73853105,0.035346236,0.01239131,0.0048639653,0.00095828075],"about_ca_topic_score_codex":0.00006910157,"about_ca_topic_score_gemma":0.00016055776,"teacher_disagreement_score":0.9004243,"about_ca_system_score_codex":0.00002686095,"about_ca_system_score_gemma":0.000051458002,"threshold_uncertainty_score":0.3437357},"labels":[],"label_agreement":null},{"id":"W2520439611","doi":"10.1287/trsc.2017.0805","title":"Network Learning via Multiagent Inverse Transportation Problems","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transport engineering; Computer science; Flow network; Operations research; Engineering; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.03091271684936079,"score_gpt":0.29899894925623943,"score_spread":0.2680862324068786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520439611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6956579,0.000050076298,0.29102287,0.0008055477,0.0012492862,0.00075570197,0.00002070936,0.0007604771,0.009677393],"genre_scores_gemma":[0.98935825,0.000045189972,0.009162202,0.00027294434,0.00028185744,0.000028421391,0.00016139293,0.000016900487,0.00067283906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9973689,0.00008531345,0.0004564796,0.00049467897,0.0010171706,0.00057750667],"domain_scores_gemma":[0.9986389,0.00006188192,0.00023100279,0.0001503583,0.00065875176,0.00025907453],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00154088,0.00015745682,0.00015120194,0.00019366002,0.0020985317,0.00011765335,0.0003282758,0.00010239716,0.00043321602],"category_scores_gemma":[0.000059496917,0.00017031409,0.000059428516,0.0021576204,0.0013491416,0.0011910695,9.1865815e-7,0.00017572683,0.00011804608],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011218167,0.000140968,0.2853862,0.000044440258,0.000021524447,0.000014516381,0.23284373,0.43219903,0.0042763487,0.033956014,0.0009373015,0.01006774],"study_design_scores_gemma":[0.0012805137,0.0002820286,0.8936302,0.00014047204,0.000102425845,6.4223127e-7,0.0077764033,0.016075583,0.0013021235,0.002284357,0.07626421,0.0008610248],"about_ca_topic_score_codex":0.001460703,"about_ca_topic_score_gemma":0.016515171,"teacher_disagreement_score":0.608244,"about_ca_system_score_codex":0.00008199005,"about_ca_system_score_gemma":0.00038753793,"threshold_uncertainty_score":0.9992006},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03834316816566709,"score_gpt":0.3306429495440477,"score_spread":0.29229978137838064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524034199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87607706,0.000048083202,0.12224631,0.0006763124,0.00021998241,0.00015246839,0.000009086029,0.00026968252,0.00030100573],"genre_scores_gemma":[0.99312305,0.000028210776,0.006694063,0.000028590148,0.000050706847,0.000013412392,0.0000018364155,0.000016525099,0.00004358294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9984684,0.00007316053,0.0002578185,0.00027895067,0.0004978495,0.00042384115],"domain_scores_gemma":[0.99925274,0.00021566435,0.000026156464,0.00019367595,0.00019686551,0.00011490469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017294153,0.00008924102,0.00009765093,0.00049188366,0.00021959005,0.00004159773,0.00022131606,0.000053688447,0.000040666822],"category_scores_gemma":[0.00018018715,0.0000771401,0.000021728187,0.0032232532,0.0002526042,0.00071404385,0.0000056223184,0.00018539795,0.000027604736],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024478833,0.000058069963,0.044918317,0.000020060805,0.000007631355,0.000014554839,0.007994147,0.4583557,0.4312591,0.002255878,0.00008969058,0.055002373],"study_design_scores_gemma":[0.00086517073,0.00003024958,0.72141916,0.00013016732,0.0000067010255,0.0000020111775,0.0012503251,0.25501683,0.020267114,0.00040853344,0.00031684368,0.00028691615],"about_ca_topic_score_codex":0.00003292911,"about_ca_topic_score_gemma":0.00010469848,"teacher_disagreement_score":0.6765008,"about_ca_system_score_codex":0.00019095377,"about_ca_system_score_gemma":0.00006089016,"threshold_uncertainty_score":0.3145682},"labels":[],"label_agreement":null},{"id":"W2594920293","doi":"10.1287/trsc.2016.0714","title":"Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche; Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Mathematical optimization; Integer programming; Monte Carlo method; Computer science; Integer (computer science); Pareto principle; Set (abstract data type); Resolution (logic); Graph; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.04253927127099312,"score_gpt":0.28112337228189704,"score_spread":0.23858410101090394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594920293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18462248,0.000018675591,0.8126928,0.000060934417,0.00015956862,0.0004995928,0.00000403292,0.00018802652,0.0017538952],"genre_scores_gemma":[0.97326374,0.0000065543445,0.026551113,0.000023460268,0.000037694273,0.000033674572,0.00003475878,0.000013727961,0.000035247092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988826,0.00002286309,0.0002098623,0.00029361257,0.00032288322,0.00026818758],"domain_scores_gemma":[0.99934304,0.000015965526,0.0001118773,0.00030482793,0.00016815185,0.0000561338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062718627,0.00013785224,0.00010128017,0.00010861908,0.0011917657,0.0003316665,0.00040359327,0.000042226915,0.000006578258],"category_scores_gemma":[0.000015347283,0.000106752625,0.000033304703,0.00032127812,0.00045403847,0.0016197975,0.000008153927,0.00012441126,0.0000016292731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006505541,0.000019068053,0.00026519597,0.000019564088,0.000009193232,4.449101e-7,0.0059820428,0.98707044,0.0005587733,0.0038160267,0.0000061968053,0.0022465424],"study_design_scores_gemma":[0.00018957026,0.00002134249,0.017705848,0.000028552158,0.000023137005,5.2331103e-7,0.002669877,0.9785955,0.00036846288,0.00008725846,0.00015559772,0.00015434968],"about_ca_topic_score_codex":0.00011492442,"about_ca_topic_score_gemma":0.0002450506,"teacher_disagreement_score":0.7886413,"about_ca_system_score_codex":0.00010158106,"about_ca_system_score_gemma":0.000050099272,"threshold_uncertainty_score":0.91662186},"labels":[],"label_agreement":null},{"id":"W2600608404","doi":"10.1287/trsc.2018.0857","title":"Integrated Shift Scheduling and Load Assignment Optimization for Attended Home Delivery","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scheduling (production processes); Operations research; Plan (archaeology); Operational planning; Computer science; Operations management; Job shop scheduling; Work (physics); Engineering; Business; Schedule","score_opus":0.07066389539547975,"score_gpt":0.34579274561103635,"score_spread":0.2751288502155566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600608404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6215019,0.000058067668,0.37721518,0.00040156962,0.00033509854,0.00025965855,0.000027307296,0.000049320322,0.00015184825],"genre_scores_gemma":[0.9116194,0.000010839135,0.087927416,0.00012714083,0.000018645736,0.000019582983,0.000019358384,0.000007801208,0.00024979195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969315,0.000036195055,0.00053093425,0.00070229464,0.0014632455,0.00033581382],"domain_scores_gemma":[0.99785495,0.000533067,0.00020096911,0.00033706284,0.0009114992,0.00016244127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039878082,0.00013349038,0.0002123036,0.00036948547,0.00039478004,0.00037724414,0.0004647998,0.000060915245,0.0002459434],"category_scores_gemma":[0.0006804277,0.00010679189,0.00007026202,0.001764732,0.00028232782,0.0010294646,0.00000960759,0.000099061865,0.00008840985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001362411,0.00009930668,0.054110963,0.000017319077,0.000018780505,0.000001477825,0.0028510902,0.90369713,0.011927984,0.014406025,0.00007015198,0.0126635395],"study_design_scores_gemma":[0.0014534973,0.00014614644,0.12718454,0.000052631178,0.000042536372,0.0000018965069,0.001796292,0.8571542,0.002390213,0.00851646,0.0008817773,0.00037982207],"about_ca_topic_score_codex":0.000050031605,"about_ca_topic_score_gemma":0.000041467247,"teacher_disagreement_score":0.29011747,"about_ca_system_score_codex":0.00008132043,"about_ca_system_score_gemma":0.00054530863,"threshold_uncertainty_score":0.4354847},"labels":[],"label_agreement":null},{"id":"W2623014745","doi":"10.1287/trsc.2016.0728","title":"The Value of Flexibility in Robust Location–Transportation Problems","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Flexibility (engineering); Mathematical optimization; Exploit; Set (abstract data type); Computer science; Facility location problem; Robust optimization; Linear programming; Mathematics; Statistics","score_opus":0.0347453042944062,"score_gpt":0.2828744584522935,"score_spread":0.24812915415788728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623014745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.704364,0.00008054214,0.29223877,0.00023591834,0.0002577976,0.0005161948,0.000008428079,0.00012315794,0.0021752145],"genre_scores_gemma":[0.99408686,0.000029688788,0.0058172173,0.0000049619402,0.000004818553,0.00002095292,0.0000058358005,0.0000062105014,0.000023478806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9990822,0.00000589819,0.00034346074,0.0001346713,0.00027916706,0.00015459499],"domain_scores_gemma":[0.9993642,0.00004133758,0.00008949654,0.00031382596,0.00014786448,0.00004326178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069797464,0.000065916094,0.00008595457,0.000052395684,0.00028494454,0.00008027878,0.00034470105,0.00002664466,0.000008975892],"category_scores_gemma":[0.00008559106,0.00005228261,0.00002166842,0.00031254673,0.00042734283,0.0005329338,0.0000012299538,0.00006620407,0.0000033853025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034703055,0.000024460282,0.007839345,0.00012635611,0.0000022028446,3.194314e-7,0.0014729789,0.94310606,0.0010482023,0.041738458,0.0000037762018,0.0046343636],"study_design_scores_gemma":[0.00028351668,0.000014460816,0.63626444,0.000078906385,0.000008550235,1.3561619e-7,0.0002098914,0.35364136,0.004610988,0.004590878,0.00017039583,0.00012646345],"about_ca_topic_score_codex":0.00006664783,"about_ca_topic_score_gemma":0.0009166611,"teacher_disagreement_score":0.6284251,"about_ca_system_score_codex":0.000025491172,"about_ca_system_score_gemma":0.000050183113,"threshold_uncertainty_score":0.21915919},"labels":[],"label_agreement":null},{"id":"W2658246728","doi":"10.1287/trsc.2019.0892","title":"Combining Benders’ Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Pairing; Crew scheduling; Column generation; Computer science; Decomposition; Scheduling (production processes); Benders' decomposition; Engineering; Aeronautics; Mathematical optimization; Mathematics; Operations management; Physics; Chemistry","score_opus":0.03136646166042128,"score_gpt":0.28734515278973816,"score_spread":0.25597869112931687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2658246728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55004954,0.0000576277,0.4492807,0.000035082885,0.00008534401,0.00032461042,0.000006737865,0.00008619168,0.000074157426],"genre_scores_gemma":[0.906843,0.000028605662,0.09294572,0.000035277983,0.000010098232,0.00003637517,0.00005469119,0.000014072687,0.00003216331],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911875,0.000022338038,0.00022376141,0.00026075015,0.00020400791,0.00017040473],"domain_scores_gemma":[0.9996317,0.00006325403,0.000050816023,0.00007623551,0.00010513604,0.00007286782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007288536,0.000102171325,0.00012371155,0.00010586855,0.00017276591,0.00012021969,0.000059873837,0.00004109287,0.000020914113],"category_scores_gemma":[0.000017457616,0.000110092114,0.000017193937,0.00028511832,0.0000912831,0.00044385323,0.000002361255,0.000062751424,0.0000011006277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014625915,0.000016094213,0.014245855,0.00018813025,0.000015523896,3.8574322e-7,0.006246792,0.42093357,0.54784393,0.002785891,0.000018478328,0.0076907366],"study_design_scores_gemma":[0.00080143474,0.000058227022,0.02043011,0.00005968303,0.000017412929,0.0000017298938,0.000396088,0.9675314,0.010375807,0.000091140304,0.00008019927,0.00015676672],"about_ca_topic_score_codex":0.00001222502,"about_ca_topic_score_gemma":0.000020019117,"teacher_disagreement_score":0.54659784,"about_ca_system_score_codex":0.00005909113,"about_ca_system_score_gemma":0.00003469919,"threshold_uncertainty_score":0.44894263},"labels":[],"label_agreement":null},{"id":"W2727820456","doi":"10.1287/trsc.2018.0836","title":"Vehicle Routing and Location Routing with Intermediate Stops: A Review","year":2019,"lang":"en","type":"review","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Static routing; Computer network; Routing protocol","score_opus":0.04510220757424801,"score_gpt":0.33656426991639016,"score_spread":0.29146206234214217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727820456","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000080632155,0.94028056,0.05816003,0.000011163112,0.00016888289,0.0007907747,0.000012794121,0.00026918013,0.00022600434],"genre_scores_gemma":[0.0021288507,0.9886017,0.008970744,0.000056017787,0.00003106109,0.000051224517,0.00006165914,0.00006319757,0.00003555556],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9979126,0.000071307,0.00071025535,0.0005081946,0.00045384906,0.00034383702],"domain_scores_gemma":[0.99883735,0.00014757055,0.0002994271,0.0003472232,0.0002536886,0.000114749855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001492717,0.0003272751,0.0008441648,0.00021657234,0.00013055121,0.000098214645,0.00033587543,0.00009882636,0.000014153302],"category_scores_gemma":[0.00013281709,0.00027534727,0.00007655384,0.0023923914,0.00017696974,0.0005273517,0.000009089801,0.00032158144,0.000027041377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.559442e-7,0.000005382449,0.000080559636,0.04529547,0.000026427198,0.0000030837477,0.00048408998,0.0073926984,0.0000042403053,0.00018010051,0.00001122321,0.94651574],"study_design_scores_gemma":[0.0012501952,0.00020567735,0.003274256,0.5384749,0.0044178143,0.00009885432,0.00034186724,0.21792848,0.00004645163,0.00001811028,0.23005234,0.003891055],"about_ca_topic_score_codex":0.000006548698,"about_ca_topic_score_gemma":0.000006965089,"teacher_disagreement_score":0.9426247,"about_ca_system_score_codex":0.00013130836,"about_ca_system_score_gemma":0.00033476105,"threshold_uncertainty_score":0.9999699},"labels":[],"label_agreement":null},{"id":"W2741021238","doi":"10.1287/trsc.2017.0798","title":"Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"TKI DINALOG","keywords":"Pickup; Vehicle routing problem; Mathematical optimization; Computer science; Scheduling (production processes); Set (abstract data type); Path (computing); Shortest path problem; Longest path problem; Public transport; Job shop scheduling; Column generation; Routing (electronic design automation); Mathematics; Theoretical computer science; Engineering; Transport engineering; Computer network","score_opus":0.014703248623537248,"score_gpt":0.25421395296247146,"score_spread":0.2395107043389342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741021238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65038896,0.00011154554,0.3489808,0.00012049026,0.000023117609,0.0002235597,0.0000041150874,0.00006579029,0.00008161203],"genre_scores_gemma":[0.84604,0.000040106646,0.15378088,0.00004806746,0.000024927764,0.000015965012,0.0000013983234,0.00000896169,0.000039706323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946237,0.00000713045,0.00011269916,0.00016561104,0.00012132247,0.00013086505],"domain_scores_gemma":[0.9995832,0.00012733358,0.000026608417,0.000080146354,0.0001321582,0.00005056697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048513524,0.00007209401,0.00007264516,0.00004834322,0.0002196587,0.000062656516,0.00007309503,0.000021485224,0.0000067821697],"category_scores_gemma":[0.000022145116,0.000050420836,0.0000061426535,0.00029806653,0.00038356325,0.00029079107,0.0000025877143,0.000038929542,0.000001124004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003316809,0.000049697475,0.111451544,0.000717337,0.00012318366,0.0000026328655,0.0319073,0.40157714,0.30046105,0.006830064,0.000115312396,0.14643306],"study_design_scores_gemma":[0.0007773939,0.00009687788,0.21510148,0.000044492524,0.00004086028,0.000005971677,0.000107107364,0.77363485,0.009464159,0.00018011131,0.00036418307,0.0001825001],"about_ca_topic_score_codex":0.0000067923893,"about_ca_topic_score_gemma":0.000023250512,"teacher_disagreement_score":0.37205774,"about_ca_system_score_codex":0.000005830149,"about_ca_system_score_gemma":0.000027068516,"threshold_uncertainty_score":0.2056102},"labels":[],"label_agreement":null},{"id":"W2747540564","doi":"10.1287/trsc.2017.0774","title":"The Chinese Postman Problem with Load-Dependent Costs","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"European Regional Development Fund; Generalitat Valenciana; Ministerio de Economía y Competitividad","keywords":"Traverse; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Metaheuristic; Constant (computer programming); Moment (physics); Computational complexity theory; Computer science; Vehicle routing problem; Mathematics; Algorithm; Routing (electronic design automation); Artificial intelligence","score_opus":0.005575537869462892,"score_gpt":0.24059947576609805,"score_spread":0.23502393789663517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747540564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748175,0.000019758465,0.014431447,0.0002904857,0.00021266393,0.00028952234,0.000021500524,0.00029643034,0.009620688],"genre_scores_gemma":[0.998454,0.000010539217,0.0012132613,0.00007374304,0.000029296014,0.00003728095,0.000013776151,0.000011379836,0.00015675121],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998797,0.0000039984943,0.00023344801,0.00018711624,0.00054597424,0.00023245272],"domain_scores_gemma":[0.9991562,0.000025491778,0.000032738455,0.00023048527,0.00048047898,0.00007461451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035424685,0.00010533804,0.00006579596,0.00006587779,0.00043846262,0.00008081074,0.00025748412,0.000022229013,0.00004573509],"category_scores_gemma":[0.000007854427,0.00006719837,0.000017201206,0.0013012132,0.0005848478,0.00039708734,8.941301e-7,0.00008737587,0.00004894779],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000396754,0.00043021314,0.2968324,0.00018621779,0.00018190427,0.000035787598,0.049949795,0.045239266,0.25795114,0.27091768,0.0013224225,0.0765564],"study_design_scores_gemma":[0.00047485202,0.00011500962,0.9847813,0.00001840172,0.000013921837,0.0000033680597,0.00038652803,0.0016164072,0.007694873,0.00042161572,0.004252888,0.00022078246],"about_ca_topic_score_codex":0.000044527304,"about_ca_topic_score_gemma":0.0067333505,"teacher_disagreement_score":0.68794894,"about_ca_system_score_codex":0.00007959598,"about_ca_system_score_gemma":0.00015434298,"threshold_uncertainty_score":0.37573677},"labels":[],"label_agreement":null},{"id":"W2754261999","doi":"10.1287/trsc.2017.0771","title":"Exact Solutions for the Carrier–Vehicle Traveling Salesman Problem","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Travelling salesman problem; Range (aeronautics); Computer science; Mathematical optimization; A priori and a posteriori; Integer programming; Vehicle routing problem; Traveling purchaser problem; Integer (computer science); Conic section; 2-opt; Algorithm; Engineering; Mathematics; Routing (electronic design automation); Computer network; Aerospace engineering","score_opus":0.0518667728935645,"score_gpt":0.31759714648962245,"score_spread":0.26573037359605794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754261999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1008867,0.0000523836,0.89664483,0.0005443223,0.00032001297,0.00038500654,0.000041564053,0.00021224745,0.00091290555],"genre_scores_gemma":[0.9490167,0.00002166771,0.050721493,0.000023280245,0.000045374352,0.000055548975,0.000005180091,0.000016812326,0.00009396807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990084,0.0000088744355,0.00021124764,0.00019250107,0.00024252808,0.0003364204],"domain_scores_gemma":[0.99919957,0.00011242567,0.00007099321,0.000399649,0.0001451226,0.00007221122],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013177264,0.00009031039,0.00008453239,0.00004348825,0.002060464,0.0002145895,0.0005576064,0.000033808014,0.000014427246],"category_scores_gemma":[0.00009850334,0.00007529458,0.00004755843,0.0001942368,0.00026838755,0.0005496269,0.000004840905,0.00008950695,0.0000038742915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004127277,0.000006949548,0.0024118805,0.000032906784,0.000009682079,4.675829e-7,0.0021096966,0.9484696,0.024106588,0.00613197,0.000060735307,0.016655395],"study_design_scores_gemma":[0.00031130412,0.000011801428,0.1395579,0.000020592537,0.00002803884,7.644161e-7,0.00018476456,0.8511314,0.007106533,0.00056149805,0.0009275441,0.00015790487],"about_ca_topic_score_codex":0.000036464768,"about_ca_topic_score_gemma":0.00013430945,"teacher_disagreement_score":0.84813,"about_ca_system_score_codex":0.00004776917,"about_ca_system_score_gemma":0.00007423032,"threshold_uncertainty_score":0.9992387},"labels":[],"label_agreement":null},{"id":"W2759685288","doi":"10.1287/trsc.2017.0783","title":"A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Integer programming; Traverse; Mathematical optimization; Linear programming; Extension (predicate logic); Branch and cut; Mathematics; Column generation; Heuristic; Binary number; Minimum weight; Algorithm; Set (abstract data type); Computer science; Combinatorics","score_opus":0.021466535352644686,"score_gpt":0.3028421713022516,"score_spread":0.2813756359496069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759685288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1297144,0.000044079137,0.86901754,0.00030415668,0.0002025652,0.0003395044,0.000019787452,0.00012916072,0.00022883652],"genre_scores_gemma":[0.7676462,0.000022889262,0.23216385,0.000029492276,0.000027331967,0.000035898818,0.000003160641,0.000011166095,0.000060021765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930996,0.000005929517,0.00016101026,0.00014075646,0.00019161319,0.00019073003],"domain_scores_gemma":[0.9994447,0.00008904167,0.000057274632,0.00025145497,0.000101466714,0.000056033623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006549378,0.000080387625,0.00007765194,0.000042003117,0.00076938735,0.00018717896,0.00034207254,0.000025489588,0.000006093089],"category_scores_gemma":[0.00005054866,0.000062545165,0.000027313694,0.00011158255,0.00027732018,0.00049135846,0.0000040424443,0.0000632455,0.0000024585052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007957753,0.000013332653,0.0098653175,0.00006642644,0.00001971923,0.0000012378737,0.0045955614,0.16378881,0.02042035,0.0024611948,0.00004364119,0.7987164],"study_design_scores_gemma":[0.0003204215,0.000011362211,0.23098433,0.000014730321,0.0000138751375,0.000001640598,0.00008378242,0.76246786,0.00554046,0.0002385834,0.00021826442,0.00010466073],"about_ca_topic_score_codex":0.000040849925,"about_ca_topic_score_gemma":0.000051184867,"teacher_disagreement_score":0.79861176,"about_ca_system_score_codex":0.000014013274,"about_ca_system_score_gemma":0.00002664728,"threshold_uncertainty_score":0.5917583},"labels":[],"label_agreement":null},{"id":"W2778388802","doi":"10.1287/trsc.2018.0888","title":"Integrated Liner Shipping Network Design and Scheduling","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Container (type theory); Flow network; Scheduling (production processes); Containerization; Transport engineering; Business; Computer science; Operations research; Engineering; Operations management; Mathematics","score_opus":0.043388496189052675,"score_gpt":0.23403026339906857,"score_spread":0.1906417672100159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778388802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063774884,0.00011255514,0.93529403,0.00012431436,0.00008664389,0.00007219928,0.0000022118293,0.00016601429,0.00036712436],"genre_scores_gemma":[0.8917663,0.000028747249,0.10797475,0.00016569668,0.00004452609,0.0000023725456,0.0000055123533,0.000006390492,0.000005688019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944943,0.0000044275325,0.0001383471,0.00013304604,0.00012350865,0.00015126707],"domain_scores_gemma":[0.9997648,0.000026340978,0.000014233685,0.000044711313,0.000043346252,0.000106565516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002176572,0.00006397915,0.00007039199,0.000023642524,0.00007791374,0.000049935337,0.000078894045,0.000021488686,0.000050314964],"category_scores_gemma":[0.000027464901,0.000059494836,0.000009110159,0.00044475368,0.00009888203,0.0001590686,0.0000014545845,0.00008409853,0.000004330181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003066628,0.0000012553406,0.0012758981,0.000019307963,0.0000020363302,0.00000513454,0.00062553637,0.9898465,0.0024039687,0.0013798303,0.000049070546,0.0043883957],"study_design_scores_gemma":[0.0000808904,0.00001346083,0.009139,0.00001783662,0.000007846155,5.225557e-7,0.00006897466,0.9884868,0.0009287388,0.0001807611,0.0009683825,0.00010675584],"about_ca_topic_score_codex":0.000006305045,"about_ca_topic_score_gemma":0.0000043350997,"teacher_disagreement_score":0.8279914,"about_ca_system_score_codex":0.0000066983393,"about_ca_system_score_gemma":0.000029815106,"threshold_uncertainty_score":0.2426129},"labels":[],"label_agreement":null},{"id":"W2792362373","doi":"10.1287/trsc.2019.0941","title":"A Primal Adjacency-Based Algorithm for the Shortest Path Problem with Resource Constraints","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Shortest path problem; K shortest path routing; Mathematical optimization; Column generation; Yen's algorithm; Constrained Shortest Path First; Path (computing); Adjacency list; Computer science; Shortest Path Faster Algorithm; Longest path problem; Algorithm; Mathematics; Dijkstra's algorithm; Theoretical computer science; Graph","score_opus":0.017771996696405667,"score_gpt":0.21916256803372688,"score_spread":0.20139057133732122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792362373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011219337,0.000035921465,0.9963282,0.00072827726,0.000034440276,0.00051897473,0.000078203535,0.0002350586,0.00091901765],"genre_scores_gemma":[0.83336365,0.0000054458324,0.16602685,0.00045553833,0.0000214856,0.00006112445,0.000036179805,0.000016937714,0.000012813725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991696,0.0000046436876,0.00016086201,0.00019469805,0.00027712638,0.00019310658],"domain_scores_gemma":[0.99961,0.000059058424,0.000032847198,0.00009872534,0.00009926345,0.00010009496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002050106,0.000096584714,0.000079686484,0.0000331424,0.00016353627,0.00006423297,0.00020320358,0.000022450507,0.000052248604],"category_scores_gemma":[0.0000070570877,0.00006804636,0.000025015299,0.0006011441,0.00030895267,0.000152335,9.562903e-7,0.00007768799,0.0000039936967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014850654,0.000013658221,0.000751611,0.000045632787,0.0000087028275,0.000002281852,0.0027774998,0.9316031,0.00097377755,0.0009505199,0.00020184215,0.06265657],"study_design_scores_gemma":[0.0005379705,0.00009179331,0.0023844738,0.000030534287,0.000019860425,8.742121e-7,0.00021015678,0.9890202,0.0020269137,0.000014883549,0.0055105095,0.00015180629],"about_ca_topic_score_codex":0.000002053271,"about_ca_topic_score_gemma":0.000007779096,"teacher_disagreement_score":0.8322417,"about_ca_system_score_codex":0.000013555915,"about_ca_system_score_gemma":0.00013717753,"threshold_uncertainty_score":0.277485},"labels":[],"label_agreement":null},{"id":"W2801088686","doi":"10.1287/trsc.2018.0820","title":"A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"TKI DINALOG","keywords":"Shortest path problem; K shortest path routing; Schedule; Mathematical optimization; Constrained Shortest Path First; Path (computing); Computer science; Yen's algorithm; Optimization problem; Sequence (biology); Function (biology); Traffic congestion; Dijkstra's algorithm; Algorithm; Mathematics; Engineering; Transport engineering; Computer network","score_opus":0.016527466800714506,"score_gpt":0.29505118612984405,"score_spread":0.27852371932912956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801088686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015596169,0.00006644137,0.97900367,0.0017658033,0.00024937416,0.0009952036,0.000093490424,0.00019078077,0.002039089],"genre_scores_gemma":[0.7344754,0.0001082286,0.26301742,0.00042594696,0.0002920106,0.000047007892,0.00016353674,0.000018289185,0.0014521653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987364,0.000024243263,0.00021074637,0.00029902929,0.0004678958,0.0002616906],"domain_scores_gemma":[0.9989933,0.00014834023,0.000101635815,0.00010788044,0.00053987943,0.00010900053],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010620963,0.00009122255,0.000086668544,0.00008565141,0.0016334429,0.0001645049,0.00022072163,0.0000580091,0.00011788391],"category_scores_gemma":[0.000059837486,0.00007236336,0.000028200491,0.0008342237,0.001120276,0.0006306189,0.0000014013975,0.000052537947,0.0000068474583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019450701,0.0002380454,0.019359322,0.00003633545,0.0000703081,0.000006545637,0.2230566,0.5251244,0.002201041,0.04559277,0.0031360602,0.18098408],"study_design_scores_gemma":[0.00068320043,0.0001527522,0.04310632,0.000038875714,0.00009768064,0.0000011836187,0.0024930593,0.9372225,0.00037180563,0.00058746134,0.014915928,0.00032925542],"about_ca_topic_score_codex":0.00023177713,"about_ca_topic_score_gemma":0.0006948399,"teacher_disagreement_score":0.7188792,"about_ca_system_score_codex":0.00002478287,"about_ca_system_score_gemma":0.0002651311,"threshold_uncertainty_score":0.9996663},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026734218217929068,"score_gpt":0.2523975719556721,"score_spread":0.22566335373774302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806571857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054026365,0.000064207416,0.9438466,0.0003695483,0.0002974491,0.0005860602,0.00004007377,0.00008935328,0.00068034325],"genre_scores_gemma":[0.99286354,0.000043899334,0.006499097,0.00009203957,0.00008132715,0.000097090066,0.000058620277,0.0000091300435,0.00025527904],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918747,0.000006452066,0.00021909678,0.00018723843,0.00023467458,0.00016507077],"domain_scores_gemma":[0.9995296,0.0000440589,0.000040345003,0.00012663424,0.00020210675,0.00005726002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004989147,0.00008694082,0.000072433875,0.00004244653,0.00029960688,0.00010305322,0.00011666519,0.000029409788,0.00008789295],"category_scores_gemma":[0.000019565181,0.00006475827,0.000014510317,0.0002435656,0.00030651476,0.0001876611,0.00000165776,0.000045036588,0.0000034651262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007523011,0.0001975233,0.014762077,0.00030722594,0.00013171545,0.0000039496094,0.015531269,0.14803296,0.5783652,0.057056054,0.023617458,0.16191933],"study_design_scores_gemma":[0.00069506094,0.00023204168,0.06806067,0.000033434957,0.00008747508,0.000002340831,0.00041458927,0.84105873,0.04748355,0.0007285972,0.040815137,0.0003883792],"about_ca_topic_score_codex":0.00006132211,"about_ca_topic_score_gemma":0.0007205617,"teacher_disagreement_score":0.9388372,"about_ca_system_score_codex":0.000039042032,"about_ca_system_score_gemma":0.00005927046,"threshold_uncertainty_score":0.26407656},"labels":[],"label_agreement":null},{"id":"W2808994316","doi":"10.1287/trsc.2017.0810","title":"Performance Approximation of Emergency Service Systems with Priorities and Partial Backups","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University; Polytechnique Montréal","funders":"","keywords":"Queue; Queueing theory; Service (business); Computer science; Operations research; Downtown; Service system; Response time; Computer network; Engineering; Operating system; Business; Geography","score_opus":0.031824376266839476,"score_gpt":0.2410435268289963,"score_spread":0.2092191505621568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808994316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925455,0.0000129443915,0.0037307355,0.00020463097,0.0003559367,0.00022199962,0.000002054926,0.000042976935,0.0028832362],"genre_scores_gemma":[0.9994951,0.000015657475,0.00019482247,0.00007822603,0.00010086547,0.000015974554,0.000010935194,0.0000042132,0.000084224666],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989972,0.0000026446594,0.0002640364,0.00020777107,0.00038866518,0.00013969927],"domain_scores_gemma":[0.99917066,0.0000022673125,0.00009332572,0.00013752245,0.00058449706,0.000011746132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003970855,0.00007921305,0.00008488664,0.00014805395,0.00020862791,0.00005156916,0.00014467987,0.000014690157,0.000115780545],"category_scores_gemma":[0.000008528047,0.000067257846,0.000009451974,0.0010176597,0.00018616748,0.0017602586,0.000007561067,0.00002408015,0.000040854466],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038154208,0.0002532966,0.7442788,0.007581787,0.000049314134,0.000001239531,0.008991937,0.01720885,0.014084659,0.19427182,0.00045499083,0.012441784],"study_design_scores_gemma":[0.00036173026,0.000045369696,0.7613735,0.00007257236,0.000041125168,2.2393255e-7,0.0016553033,0.23144576,0.0011601293,0.000070748385,0.0035572269,0.00021626797],"about_ca_topic_score_codex":0.0007501644,"about_ca_topic_score_gemma":0.0005621533,"teacher_disagreement_score":0.2142369,"about_ca_system_score_codex":0.0000075634753,"about_ca_system_score_gemma":0.000026197771,"threshold_uncertainty_score":0.27426955},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02525336733336839,"score_gpt":0.23778147202558067,"score_spread":0.21252810469221228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886343885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14653377,0.000059374757,0.8510736,0.00012380368,0.00010695383,0.0004928925,0.00003931077,0.00024004323,0.0013302438],"genre_scores_gemma":[0.9814378,0.0000035348346,0.018258775,0.00009410491,0.00006978404,0.000035023113,0.000013198074,0.000018852772,0.00006893539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990247,0.0000037171717,0.00018928213,0.00022689003,0.0002658844,0.0002895512],"domain_scores_gemma":[0.99950135,0.000089186986,0.000035032772,0.00016113443,0.00013708435,0.0000762023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003893833,0.00012250649,0.00010601876,0.000056316923,0.00030716145,0.00005624993,0.00020468251,0.000029204282,0.000029001034],"category_scores_gemma":[0.0000060196926,0.000084183805,0.000025151901,0.00049202546,0.0005449151,0.0002258668,0.0000010349906,0.00008169464,0.000012506926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005311004,0.00024732968,0.08158546,0.00066122605,0.00021210335,0.000030309113,0.02185524,0.3997963,0.3597118,0.033774808,0.00053316174,0.101061165],"study_design_scores_gemma":[0.001235356,0.00015661046,0.093907066,0.00004562699,0.00006541225,0.0000015882307,0.000053066997,0.8757302,0.026914017,0.00028542426,0.0013190553,0.00028658047],"about_ca_topic_score_codex":0.000024215793,"about_ca_topic_score_gemma":0.000101100704,"teacher_disagreement_score":0.834904,"about_ca_system_score_codex":0.000023179146,"about_ca_system_score_gemma":0.00006316632,"threshold_uncertainty_score":0.34329158},"labels":[],"label_agreement":null},{"id":"W2889549077","doi":"10.1287/trsc.2018.0878","title":"Exact Branch-Price-and-Cut Algorithms for Vehicle Routing","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Algorithm; Branch and cut; Routing (electronic design automation); Integer programming; Computer network","score_opus":0.021958453004788953,"score_gpt":0.29102438433255134,"score_spread":0.2690659313277624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889549077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56138843,0.0000242705,0.43727723,0.000037750688,0.00021605706,0.00021095037,0.000008652578,0.00019362618,0.0006430741],"genre_scores_gemma":[0.9079348,0.000010681769,0.091849394,0.00004596908,0.000025045143,0.000013103817,0.000007002567,0.000018963538,0.00009502947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899924,0.000009507057,0.00022579826,0.00025345443,0.00024189649,0.00027013104],"domain_scores_gemma":[0.9995153,0.00011177485,0.0000411796,0.000150334,0.0000979399,0.00008347368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079315586,0.00009871759,0.000120530785,0.00010181972,0.00012100001,0.00006256688,0.00015682979,0.000039199287,0.000039641134],"category_scores_gemma":[0.000040136012,0.0001040732,0.000030342391,0.00054250227,0.000072077244,0.0004892006,0.0000027479064,0.00007218026,0.000017966377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000135941245,0.000017790531,0.034945615,0.00017992796,0.000014374301,9.000586e-7,0.0041712387,0.71048164,0.18506522,0.005010577,0.00002795046,0.060071137],"study_design_scores_gemma":[0.0004877829,0.000024023471,0.10193949,0.000023254692,0.000008820417,9.835547e-7,0.000101539874,0.8708438,0.025797123,0.0002436206,0.00033719366,0.00019236014],"about_ca_topic_score_codex":0.0000072790885,"about_ca_topic_score_gemma":0.0000036286096,"teacher_disagreement_score":0.3465464,"about_ca_system_score_codex":0.000034920286,"about_ca_system_score_gemma":0.000036221976,"threshold_uncertainty_score":0.4243982},"labels":[],"label_agreement":null},{"id":"W2904680133","doi":"10.1287/trsc.2018.0838","title":"Anticipatory Dynamic Traffic Sensor Location Problems with Connected Vehicle Technologies","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transport engineering; Computer science; Automatic vehicle location; Engineering; Telecommunications; Global Positioning System","score_opus":0.013453210726846345,"score_gpt":0.24518019003698044,"score_spread":0.23172697931013408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904680133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587416,0.000024001602,0.038977034,0.00014712944,0.00011793651,0.0002836508,0.000018860726,0.0015090918,0.00018067338],"genre_scores_gemma":[0.99758077,0.00000945532,0.002250285,0.000028478522,0.0000068068584,0.000045626348,0.00004065363,0.000015442738,0.000022457703],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9989241,0.000004312759,0.0002678807,0.0002581607,0.00030025502,0.00024531395],"domain_scores_gemma":[0.999179,0.000016593,0.00004343195,0.00022849799,0.0004892697,0.00004323106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017374186,0.0001206788,0.000100689314,0.0002612372,0.00019651622,0.000036608897,0.00018133847,0.000053406893,0.000029405128],"category_scores_gemma":[0.000013205528,0.00011076399,0.0000145798085,0.0023776318,0.00083357753,0.00046162336,7.524173e-7,0.000099459605,0.000035615303],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055664812,0.00020426369,0.017871656,0.00033308283,0.000057344307,0.000009518462,0.018258296,0.44270742,0.48094767,0.009876113,0.0000686828,0.029610287],"study_design_scores_gemma":[0.00077734014,0.00018686175,0.81282353,0.00008805675,0.000039734477,0.0000033443519,0.0022963078,0.13685848,0.04545139,0.00011863001,0.0009137026,0.000442591],"about_ca_topic_score_codex":0.000009259676,"about_ca_topic_score_gemma":0.00099641,"teacher_disagreement_score":0.7949519,"about_ca_system_score_codex":0.00004999548,"about_ca_system_score_gemma":0.00010559655,"threshold_uncertainty_score":0.45168245},"labels":[],"label_agreement":null},{"id":"W2941926664","doi":"10.1287/trsc.2019.0969","title":"The Commute Trip-Sharing Problem","year":2020,"lang":"en","type":"preprint","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"TRIPS architecture; Pooling; Vehicle routing problem; Computer science; Routing (electronic design automation); Duration (music); Locality; Generalization; Operations research; Set (abstract data type); Transport engineering; Mathematical optimization; Engineering; Computer network; Mathematics; Artificial intelligence","score_opus":0.039509205333722625,"score_gpt":0.280293889707339,"score_spread":0.24078468437361636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941926664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7163856,0.00072368374,0.23774052,0.008951013,0.0047782417,0.0035450486,0.0008432349,0.0045822035,0.022450447],"genre_scores_gemma":[0.99636585,0.00014760888,0.0028339727,0.00012847836,0.00004377412,0.00015910882,0.00021537932,0.000026647926,0.000079197474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9981136,0.00000705733,0.0006088696,0.00041242057,0.000551823,0.0003062863],"domain_scores_gemma":[0.998972,0.000046494937,0.00009720193,0.00051848934,0.00023885605,0.00012697327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005155371,0.0002140442,0.00018216959,0.00012284362,0.0004573146,0.000257066,0.001003824,0.00009396342,0.000028654855],"category_scores_gemma":[0.00001637,0.00018470686,0.0000886889,0.0010227355,0.0003747124,0.0002512669,0.000014099261,0.0006163709,0.0000317833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041228242,0.00008196749,0.009122075,0.001070053,0.00017739384,0.000018931965,0.022502882,0.6378622,0.023559632,0.2798022,0.0025513005,0.023210166],"study_design_scores_gemma":[0.0013134242,0.00006500458,0.6924321,0.0003888247,0.00025135695,0.0000026748635,0.0016152456,0.14240544,0.014419336,0.05809368,0.087020084,0.0019928294],"about_ca_topic_score_codex":0.000037985188,"about_ca_topic_score_gemma":0.0004915633,"teacher_disagreement_score":0.68331003,"about_ca_system_score_codex":0.000076227036,"about_ca_system_score_gemma":0.00021919484,"threshold_uncertainty_score":0.7532127},"labels":[],"label_agreement":null},{"id":"W2945474548","doi":"10.1287/trsc.2018.0868","title":"An Exact Algorithm for Multilevel Uncapacitated Facility Location","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"","keywords":"Benchmark (surveying); Facility location problem; Exploit; Mathematical optimization; Pareto principle; Selection (genetic algorithm); Computer science; Class (philosophy); Flow network; Process (computing); Benders' decomposition; Algorithm; Scale (ratio); Mathematics; Artificial intelligence","score_opus":0.03316461722284382,"score_gpt":0.275007149271349,"score_spread":0.2418425320485052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945474548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6372638,0.0000044953795,0.35998735,0.00021329457,0.00059241016,0.0008457998,0.000041636085,0.00017480577,0.0008764438],"genre_scores_gemma":[0.995474,0.0000012063031,0.0031855572,0.0005305618,0.000050470073,0.000056512014,0.0004047653,0.0000062534864,0.0002907223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998506,0.0000043847317,0.0003085215,0.00047357238,0.00044950435,0.00025803398],"domain_scores_gemma":[0.99887335,0.000011089293,0.0000743815,0.0003180023,0.0006986285,0.000024551962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088942406,0.00012476844,0.00011143245,0.0002459527,0.0002276217,0.00015642688,0.0003367069,0.000031525396,0.00055983395],"category_scores_gemma":[0.000037478698,0.00012295955,0.000041353334,0.0009769003,0.00012003017,0.0030859315,0.000004425794,0.000046047295,0.0006230617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001550888,0.00096354994,0.050003506,0.0011496131,0.000038483475,0.0000013534819,0.00271227,0.098787,0.02730608,0.087591864,0.00095821987,0.730333],"study_design_scores_gemma":[0.00061416556,0.00002177118,0.30669266,0.000010721245,0.000018202489,4.109799e-8,0.000719685,0.6799809,0.0004898982,0.0008202971,0.010384357,0.00024734775],"about_ca_topic_score_codex":0.000738224,"about_ca_topic_score_gemma":0.0002975697,"teacher_disagreement_score":0.7300856,"about_ca_system_score_codex":0.000039366736,"about_ca_system_score_gemma":0.000054700413,"threshold_uncertainty_score":0.8008405},"labels":[],"label_agreement":null},{"id":"W2952378113","doi":"10.1287/trsc.2018.0869","title":"A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Range (aeronautics); Alternative fuel vehicle; Bounded function; Vehicle routing problem; Routing (electronic design automation); Mathematical optimization; Flow network; Driving range; Engineering; Computer science; Algorithm; Mathematics; Computer network; Automotive engineering; Alternative fuels; Electric vehicle","score_opus":0.013158606151967886,"score_gpt":0.2513267268759522,"score_spread":0.2381681207239843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952378113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28826934,0.00003639241,0.71036375,0.00014031117,0.00012287575,0.0007260055,0.00003320193,0.0001846464,0.00012348974],"genre_scores_gemma":[0.97968745,0.000023510906,0.019940421,0.00007423386,0.00002032926,0.00013126289,0.000064106694,0.000019999496,0.000038666716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990054,0.000004662009,0.00026936815,0.00023552247,0.00029841845,0.00018664794],"domain_scores_gemma":[0.99924386,0.000098257005,0.00006902516,0.00013847067,0.0004100348,0.000040351904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004234914,0.00010687889,0.00008962699,0.00010763684,0.00014967764,0.00006904602,0.00012649345,0.00002510816,0.000007962263],"category_scores_gemma":[0.000007732262,0.000081480306,0.000017834693,0.0008201307,0.00013181724,0.00064390275,8.433146e-7,0.00008754099,0.0000040531654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046850804,0.000048850303,0.010829251,0.00039243652,0.000078007775,7.06396e-7,0.029493488,0.7194689,0.017658444,0.06257701,0.000015744974,0.15939035],"study_design_scores_gemma":[0.0014141131,0.00010905908,0.27157724,0.00011095361,0.00006657897,0.0000023096013,0.0024992344,0.71394753,0.007284022,0.001651423,0.000987024,0.0003505096],"about_ca_topic_score_codex":0.000054953576,"about_ca_topic_score_gemma":0.00035723005,"teacher_disagreement_score":0.6914181,"about_ca_system_score_codex":0.00004110695,"about_ca_system_score_gemma":0.00008386425,"threshold_uncertainty_score":0.33226705},"labels":[],"label_agreement":null},{"id":"W2953891001","doi":"10.1287/trsc.2018.0876","title":"A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Université de Montréal; Transport Canada","funders":"","keywords":"Vehicle routing problem; Computer science; TRIPS architecture; Operations research; Routing (electronic design automation); Mathematical optimization; Residual; Engineering; Mathematics","score_opus":0.014085415359261281,"score_gpt":0.25906495470527746,"score_spread":0.24497953934601618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953891001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26349103,0.000016455875,0.7354785,0.00012663321,0.00009834217,0.00043288487,0.0000070032384,0.00016671515,0.0001823937],"genre_scores_gemma":[0.88308394,8.706597e-7,0.116701335,0.00006442299,0.0000160219,0.000058282,0.0000065873523,0.000020248004,0.00004826771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990144,0.000010648203,0.00019544552,0.00020779892,0.00031451855,0.00025719206],"domain_scores_gemma":[0.999268,0.00025719003,0.000055709977,0.0001965219,0.0001687796,0.00005380618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010365843,0.0000990937,0.00009485842,0.00007625957,0.00019167762,0.000064442844,0.0002293356,0.000026709273,0.000029726727],"category_scores_gemma":[0.000029974884,0.000071256145,0.000028715855,0.0006961709,0.00010140309,0.00025529633,0.0000012682244,0.00008396108,0.000009206114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014733014,0.000005238468,0.0023475243,0.00005953573,0.000004074936,1.5574774e-7,0.0004997279,0.9912368,0.0028728168,0.00046494775,0.0000032291362,0.002491216],"study_design_scores_gemma":[0.0005661764,0.000039524042,0.016621135,0.00009239852,0.000018808529,5.01391e-7,0.00015540735,0.97956544,0.0027370795,0.000046026704,0.000035174733,0.00012232835],"about_ca_topic_score_codex":0.00000585486,"about_ca_topic_score_gemma":0.000011903362,"teacher_disagreement_score":0.6195929,"about_ca_system_score_codex":0.000041008076,"about_ca_system_score_gemma":0.00012251054,"threshold_uncertainty_score":0.29057413},"labels":[],"label_agreement":null},{"id":"W2955754236","doi":"10.1287/trsc.2018.0881","title":"Exact Solution of Several Families of Location-Arc Routing Problems","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Ministerio de Economía y Competitividad","keywords":"Arc routing; Mathematical optimization; Traverse; Routing (electronic design automation); Graph; Computer science; Set (abstract data type); Vehicle routing problem; Mathematics; Mixed graph; Social connectedness; Constraint (computer-aided design); Theoretical computer science; Line graph","score_opus":0.01570143438517315,"score_gpt":0.25899625266381293,"score_spread":0.24329481827863977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955754236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6135774,0.000017211818,0.385483,0.00000808279,0.0001086958,0.00012412126,0.000004470219,0.0000624173,0.00061460794],"genre_scores_gemma":[0.9573417,0.00001286967,0.042584796,0.0000045025977,0.000005777678,0.0000035046185,0.000008771026,0.000009530353,0.000028551145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989328,0.000015976946,0.0003845033,0.00014991473,0.00036164917,0.00015518087],"domain_scores_gemma":[0.9993562,0.000050034145,0.00011490707,0.00016580196,0.00028025243,0.000032767188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071901747,0.00007540199,0.00013519145,0.00016814533,0.000039491388,0.0000094804045,0.00016783008,0.000033366425,0.00003437926],"category_scores_gemma":[0.00003931572,0.00007982461,0.000027573988,0.0011221246,0.00013195326,0.00044464695,0.000002558286,0.000057959285,0.0000059848717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027799522,0.0000073940146,0.020746686,0.00012404646,0.000002940116,3.68684e-8,0.002130305,0.87940997,0.095776565,0.00080123503,0.0000013735566,0.0009966885],"study_design_scores_gemma":[0.00019773167,0.000021236512,0.24748152,0.00007751275,0.0000069340676,3.162983e-7,0.0002449174,0.7018143,0.049994502,0.000057767487,0.000010297199,0.00009293949],"about_ca_topic_score_codex":0.000044399407,"about_ca_topic_score_gemma":0.000012449635,"teacher_disagreement_score":0.3437643,"about_ca_system_score_codex":0.000034044337,"about_ca_system_score_gemma":0.00008147201,"threshold_uncertainty_score":0.32551533},"labels":[],"label_agreement":null},{"id":"W2960400114","doi":"10.1287/trsc.2020.0988","title":"Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Path (computing); Algorithm; Arc (geometry); Variable (mathematics); Mathematics; Computer science; Geometry","score_opus":0.04511196812750818,"score_gpt":0.29447120525812354,"score_spread":0.24935923713061536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960400114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07452601,0.000021087391,0.9243118,0.00024267571,0.00010083657,0.00022934622,0.000024595856,0.00016584597,0.00037777604],"genre_scores_gemma":[0.68209356,0.0000035064018,0.3176022,0.00023733248,0.00001581965,0.000024699662,0.0000078859575,0.000011357473,0.000003640089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988978,0.000017318178,0.00025603324,0.00029462687,0.0002704451,0.00026380172],"domain_scores_gemma":[0.999545,0.00014720204,0.000038188296,0.00009187644,0.000072023824,0.00010572814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007252641,0.000106890744,0.00013445709,0.00011331424,0.00010557326,0.00005338548,0.00017082151,0.000033865505,0.000012565582],"category_scores_gemma":[0.00006549926,0.0001127115,0.000021128502,0.00095968007,0.00008241612,0.00044841846,0.0000018758752,0.00009453077,0.0000016287307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007839156,0.000005102483,0.0003417898,0.000046636997,0.0000012328206,9.2232744e-7,0.0011078693,0.98047596,0.012821298,0.0033237094,0.0000032897835,0.0018643185],"study_design_scores_gemma":[0.0005061593,0.000031438445,0.0010081268,0.000037654398,0.000004470661,1.6204774e-7,0.000048100002,0.9844742,0.012042506,0.001686109,0.000028416713,0.00013265177],"about_ca_topic_score_codex":0.000021876078,"about_ca_topic_score_gemma":0.000008193983,"teacher_disagreement_score":0.60756755,"about_ca_system_score_codex":0.000039693045,"about_ca_system_score_gemma":0.000090753194,"threshold_uncertainty_score":0.45962417},"labels":[],"label_agreement":null},{"id":"W2971325429","doi":"10.1287/trsc.2018.0875","title":"A Benders Decomposition Method for Designing Reliable Supply Chain Networks Accounting for Multimitigation Strategies and Demand Losses","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Ontario Tech University","funders":"","keywords":"Decomposition; Mathematical optimization; Benders' decomposition; Redundancy (engineering); Integer programming; Linear programming; Computer science; Supply chain; Reliability (semiconductor); Decomposition method (queueing theory); Supply chain network; Supply chain management; Reliability engineering; Operations research; Engineering; Mathematics","score_opus":0.01581469111104325,"score_gpt":0.2904127172073669,"score_spread":0.27459802609632367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971325429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35031143,0.00004316592,0.6480134,0.00022376562,0.00017302926,0.0010228929,0.0000026747355,0.00005607033,0.000153544],"genre_scores_gemma":[0.9378717,0.00001703366,0.06119785,0.00047770323,0.00013587378,0.0001507537,0.00009588275,0.000015240677,0.00003798051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998617,0.0000047611666,0.0002850745,0.0004650888,0.00027083931,0.00035722458],"domain_scores_gemma":[0.999211,0.00016833039,0.00021713554,0.000119880715,0.00026597516,0.000017683817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014049925,0.00014738293,0.0001581446,0.00028281304,0.00053175335,0.0007726442,0.00018779187,0.000047984733,0.000018750798],"category_scores_gemma":[0.00003217418,0.00013787029,0.000051306644,0.00054743723,0.00010525547,0.0041491967,0.000009373624,0.000051161103,0.0000036885679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002357539,0.000068190806,0.09582867,0.0010411808,0.000029685169,0.0000015150015,0.0012518633,0.7649092,0.02660647,0.092507936,0.00034855862,0.01717098],"study_design_scores_gemma":[0.0010781717,0.00003672473,0.061593607,0.0001057277,0.00007152111,3.8609758e-7,0.006814329,0.9218493,0.0014766227,0.0059270677,0.0007660332,0.00028048272],"about_ca_topic_score_codex":0.000244816,"about_ca_topic_score_gemma":0.00015130173,"teacher_disagreement_score":0.58756024,"about_ca_system_score_codex":0.000023908795,"about_ca_system_score_gemma":0.000049041166,"threshold_uncertainty_score":0.7450626},"labels":[],"label_agreement":null},{"id":"W2972680096","doi":"10.1287/trsc.2020.1018","title":"Electric Vehicle Routing with Public Charging Stations","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Leverage (statistics); Routing (electronic design automation); Queue; Static routing; Computer science; Electric vehicle; Operations research; Computer network; Engineering; Routing protocol","score_opus":0.00879866974187956,"score_gpt":0.20967433539530964,"score_spread":0.20087566565343007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972680096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9576101,0.000106469364,0.03941772,0.0001893563,0.00005586609,0.00005393646,0.0000049108426,0.0001978326,0.002363855],"genre_scores_gemma":[0.9976657,0.000021654569,0.0021437465,0.00007207367,0.0000201962,0.000005805314,0.000015419602,0.000011595904,0.000043802043],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990631,0.0000055249293,0.00014185034,0.00018136196,0.00030444085,0.00030377196],"domain_scores_gemma":[0.9995729,0.00001796813,0.000023757879,0.00011710891,0.00018362272,0.00008464073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012785471,0.000078054,0.00007260235,0.00011481799,0.00021197168,0.000103348466,0.000118649834,0.00002133317,0.00009171341],"category_scores_gemma":[0.0000125251245,0.00007213798,0.000016754628,0.0024870636,0.00004219596,0.0006031473,0.000001176917,0.00012285436,0.000007643611],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004373698,0.000026832675,0.04112573,0.000046475263,0.000024017387,0.000042985335,0.0026579446,0.06317235,0.803995,0.050521307,0.000113661015,0.03826932],"study_design_scores_gemma":[0.0005185407,0.00004771214,0.5371429,0.000028011225,0.000021278262,0.00002173967,0.0005850921,0.23242159,0.22693355,0.00073793,0.0011532472,0.00038844795],"about_ca_topic_score_codex":0.0000056687127,"about_ca_topic_score_gemma":0.000053488155,"teacher_disagreement_score":0.5770615,"about_ca_system_score_codex":0.000052879717,"about_ca_system_score_gemma":0.00019426715,"threshold_uncertainty_score":0.2941701},"labels":[],"label_agreement":null},{"id":"W2981013975","doi":"10.1287/trsc.2019.0913","title":"Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Crew scheduling; Computer science; Operations research; Crew resource management; Schedule; Column generation; Scheduling (production processes); Aviation; Mathematical optimization; Aeronautics; Operations management; Engineering; Mathematics","score_opus":0.018296338483712423,"score_gpt":0.25626094630158225,"score_spread":0.23796460781786982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981013975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9083627,0.00013013113,0.088015124,0.000077868615,0.00017510923,0.00043469892,0.0000070836973,0.0002818598,0.0025154117],"genre_scores_gemma":[0.9611992,0.00001755914,0.03858259,0.00009096639,0.000013765496,0.000032717428,0.0000072290854,0.000022221384,0.00003371202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982169,0.00005349867,0.00044572915,0.00037017776,0.00049628026,0.00041741025],"domain_scores_gemma":[0.9993317,0.00017063979,0.00008652885,0.00027424278,0.000069662165,0.00006722773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016521753,0.00017496651,0.00017956487,0.00016746204,0.00014643767,0.00015074444,0.0004791321,0.00005499701,0.000052415668],"category_scores_gemma":[0.00004907912,0.00015179621,0.000035477617,0.001017362,0.00011544927,0.00094071584,0.000009832457,0.00023396744,0.000018021583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056298404,0.00001648245,0.041071516,0.00026679822,0.000005274965,0.0000038059316,0.008374728,0.8068895,0.12748207,0.00038015482,0.000017750337,0.015486285],"study_design_scores_gemma":[0.001144749,0.00009742693,0.25756872,0.0005042786,0.000029622544,0.000012531928,0.0038853746,0.6699768,0.06475295,0.00040312947,0.0006349928,0.0009894898],"about_ca_topic_score_codex":0.000106407904,"about_ca_topic_score_gemma":0.000096003176,"teacher_disagreement_score":0.2164972,"about_ca_system_score_codex":0.000065076456,"about_ca_system_score_gemma":0.00007678416,"threshold_uncertainty_score":0.619007},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013352103453035993,"score_gpt":0.24868157888305245,"score_spread":0.23532947543001645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989947400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6000351,0.0000850372,0.39654586,0.0002713735,0.0000944757,0.00015824163,0.0000057627008,0.00039285692,0.0024113297],"genre_scores_gemma":[0.94903624,0.000029050776,0.05074094,0.000030959247,0.000011454761,0.000019047382,0.000010463818,0.000018007364,0.0001038404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988089,0.000034073273,0.00023615085,0.00020711837,0.00038443218,0.000329297],"domain_scores_gemma":[0.99921453,0.00013896916,0.0000491371,0.00017563505,0.00035025878,0.000071471666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070718414,0.000093259325,0.00007807461,0.00007909479,0.00064303994,0.00016298328,0.00016701699,0.000020732134,0.000017204773],"category_scores_gemma":[0.000060975057,0.000074077514,0.000018295419,0.0027189434,0.0001113608,0.0004057897,0.0000018792244,0.00013765333,0.000007504164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040024584,0.000009920927,0.00404149,0.000017328546,0.000012015834,0.000007758044,0.003515372,0.8421325,0.13379103,0.009887277,0.00001571679,0.0065655834],"study_design_scores_gemma":[0.0003599084,0.00001966538,0.06332941,0.00003852414,0.0000210363,0.000007650855,0.0011144009,0.83352166,0.10074759,0.00032783847,0.00027072817,0.00024155324],"about_ca_topic_score_codex":0.000009002841,"about_ca_topic_score_gemma":0.00007516341,"teacher_disagreement_score":0.34900117,"about_ca_system_score_codex":0.000065678636,"about_ca_system_score_gemma":0.00019678859,"threshold_uncertainty_score":0.4945808},"labels":[],"label_agreement":null},{"id":"W2999032258","doi":"10.1287/trsc.2019.0928","title":"Strategic Network Design for Parcel Delivery with Drones Under Competition","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competition (biology); Drone; Service (business); Government (linguistics); Multinomial logistic regression; Service delivery framework; Business; Operations research; Computer science; Industrial organization; Marketing; Engineering","score_opus":0.0682763272352669,"score_gpt":0.24798068673100684,"score_spread":0.17970435949573993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999032258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30460685,0.000014324098,0.69432425,0.00029427581,0.00006001526,0.0002928344,0.000028415277,0.00022190683,0.00015709775],"genre_scores_gemma":[0.9721553,0.000010552731,0.02726685,0.00034381685,0.000035949437,0.00006230112,0.00010618677,0.00001309869,0.0000059679423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915147,0.000005391211,0.00021787042,0.00020040544,0.000220565,0.00020432663],"domain_scores_gemma":[0.9995727,0.000043147185,0.000030991247,0.00008254938,0.0001739667,0.00009664735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015988333,0.00010081236,0.00009570474,0.00004682803,0.00015749296,0.000040860374,0.00011990547,0.000027466389,0.000046939924],"category_scores_gemma":[0.0000019774777,0.0000963457,0.000023921992,0.0008554105,0.0001497748,0.00034570403,3.4801567e-7,0.00006188587,0.000008343699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029401739,0.000009163413,0.00036233963,0.000032389536,0.0000074849904,6.8429836e-7,0.0006140643,0.93409556,0.0074527687,0.05722744,0.00003554356,0.00013314074],"study_design_scores_gemma":[0.0031321973,0.0006527457,0.33389175,0.00010289107,0.00017238628,0.0000025490713,0.0036585683,0.62625897,0.015916556,0.012873633,0.0021994896,0.0011382618],"about_ca_topic_score_codex":0.0000049536484,"about_ca_topic_score_gemma":0.000100340105,"teacher_disagreement_score":0.6675484,"about_ca_system_score_codex":0.000019464629,"about_ca_system_score_gemma":0.00010615797,"threshold_uncertainty_score":0.39288637},"labels":[],"label_agreement":null},{"id":"W3000972540","doi":"10.1287/trsc.2019.0904","title":"The Vehicle Routing Problem with Stochastic Two-Dimensional Items","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Transport Canada; Université Laval","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Integer (computer science); Integer programming; Probability distribution; Mathematics; Computer science; Statistics","score_opus":0.01835321259663467,"score_gpt":0.2561111963444445,"score_spread":0.23775798374780985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000972540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49285856,0.00003431913,0.5051819,0.000707852,0.000091474845,0.00022887137,0.0000049303917,0.00041119556,0.00048088378],"genre_scores_gemma":[0.96141386,7.324879e-7,0.038390864,0.000118742726,0.000030719304,0.000011336655,0.0000034647685,0.000016870737,0.0000133811545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883425,0.000017734721,0.00021888805,0.00021002335,0.000464793,0.00025430502],"domain_scores_gemma":[0.999467,0.00011993212,0.000045840203,0.00011400772,0.00012609533,0.00012708698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005340386,0.00009717069,0.00008091671,0.000031000494,0.0003722768,0.00009044449,0.00023041305,0.000016340264,0.000011390614],"category_scores_gemma":[0.00004178439,0.000070116665,0.00001769553,0.000988629,0.00019878805,0.00029728608,0.000003467159,0.00012739412,0.00001512545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007688444,0.0000022071408,0.0005544858,0.000005821723,0.0000032035703,0.0000011655936,0.0011855767,0.98459864,0.011172205,0.00089074695,0.000009488768,0.0015687945],"study_design_scores_gemma":[0.00028788976,0.000025859412,0.005965419,0.000016209447,0.000008053672,0.0000012914925,0.00012264708,0.99053705,0.002830294,0.000046174096,0.00004226241,0.00011685997],"about_ca_topic_score_codex":0.0000070091824,"about_ca_topic_score_gemma":0.0000135286,"teacher_disagreement_score":0.46855533,"about_ca_system_score_codex":0.00002646593,"about_ca_system_score_gemma":0.000079335645,"threshold_uncertainty_score":0.28632897},"labels":[],"label_agreement":null},{"id":"W3010220509","doi":"10.1287/trsc.2021.1042","title":"Dynamic Ride-Hailing with Electric Vehicles","year":2021,"lang":"en","type":"preprint","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada; HEC Montréal","funders":"HEC Montréal; Institut de Valorisation des Données; Agence Nationale de la Recherche","keywords":"Automotive engineering; Computer science; Aeronautics; Engineering","score_opus":0.010824230880328961,"score_gpt":0.24561652637769224,"score_spread":0.23479229549736327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010220509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9227679,0.00019941165,0.0752416,0.000078371304,0.00030788968,0.00028255628,0.000055566226,0.00054695754,0.0005197987],"genre_scores_gemma":[0.9920816,0.000121417645,0.007170355,0.00005388575,0.000011713437,0.0000763423,0.00041425173,0.000032753007,0.000037669215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9980828,0.000007396791,0.0004623483,0.00051447423,0.00060407695,0.0003289027],"domain_scores_gemma":[0.99894446,0.000026563132,0.00008116856,0.00041167872,0.0004300442,0.00010606055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026649566,0.00024721219,0.00023693415,0.00040383174,0.00015680464,0.000162903,0.00035016704,0.00011761047,0.00005777257],"category_scores_gemma":[0.0000096724125,0.00025344154,0.00006661801,0.0018974304,0.00017930506,0.00039062084,0.0000037211637,0.0004908449,0.0000076189403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009927048,0.0000536087,0.0038918843,0.00035590676,0.000051635612,0.000029343888,0.004048605,0.8795948,0.10495744,0.0013908554,0.000013406716,0.0056025963],"study_design_scores_gemma":[0.0005936215,0.00004299747,0.804953,0.00035649564,0.00016942254,0.000006138997,0.0013839607,0.13842642,0.052136283,0.00051689526,0.00032803603,0.0010867326],"about_ca_topic_score_codex":0.000054334138,"about_ca_topic_score_gemma":0.0013834813,"teacher_disagreement_score":0.8010611,"about_ca_system_score_codex":0.00012697016,"about_ca_system_score_gemma":0.00055981934,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W3027599221","doi":"10.1287/trsc.2021.1045","title":"Machine-Learning–Based Column Selection for Column Generation","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column (typography); Column generation; Selection (genetic algorithm); Computer science; Artificial intelligence; Mathematics","score_opus":0.04327470079641512,"score_gpt":0.3154515595752874,"score_spread":0.2721768587788723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027599221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055735824,0.000035120942,0.9925038,0.0007846236,0.00033304212,0.00034346088,0.000016305354,0.00016144643,0.000248625],"genre_scores_gemma":[0.5041382,0.000014853791,0.49380437,0.00031326758,0.00005966103,0.000104975756,0.00014431735,0.000011532298,0.0014088836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763656,0.00009117542,0.00033111792,0.0006612343,0.0009404719,0.00033944513],"domain_scores_gemma":[0.9976416,0.00013127166,0.00012164486,0.00028091477,0.0016605291,0.00016401247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011560551,0.00011060028,0.00013481054,0.00023335396,0.00068692624,0.0004982754,0.0005265916,0.000047856327,0.00014284738],"category_scores_gemma":[0.00045534925,0.00012525059,0.000059233826,0.002790699,0.00013406068,0.00087466574,0.000010770614,0.0001297241,0.000021025533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000363953,0.00040703244,0.011768967,0.000110518406,0.000024123661,0.000021942667,0.0014188444,0.7152207,0.13656335,0.09410295,0.0012799931,0.03904518],"study_design_scores_gemma":[0.0004865965,0.00007245419,0.00386333,0.0000045212355,0.0000061386922,0.0000027206709,0.000012117503,0.94654053,0.04398058,0.00018733181,0.004704429,0.00013922669],"about_ca_topic_score_codex":0.0000412179,"about_ca_topic_score_gemma":0.0002323175,"teacher_disagreement_score":0.49869943,"about_ca_system_score_codex":0.00009072406,"about_ca_system_score_gemma":0.0012302025,"threshold_uncertainty_score":0.52833503},"labels":[],"label_agreement":null},{"id":"W3028428492","doi":"10.1287/trsc.2019.0950","title":"Integrating Resource Management in Service Network Design for Bike-Sharing Systems","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Service (business); Operations research; Network planning and design; Redistribution (election); Resource allocation; Heuristic; Level of service; Transport engineering; Computer network; Engineering","score_opus":0.05980128379169978,"score_gpt":0.267698934900163,"score_spread":0.20789765110846323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028428492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09043542,0.000038066974,0.90702754,0.0003372975,0.0001567147,0.0008190742,0.000016847216,0.00030409696,0.0008649497],"genre_scores_gemma":[0.9712367,0.000004651559,0.02809763,0.00037417756,0.000034302557,0.00017407467,0.000048018628,0.0000154744,0.000014975021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988366,0.000005937784,0.0004093801,0.00027039635,0.00022075463,0.0002569479],"domain_scores_gemma":[0.9996191,0.000040929626,0.000039021284,0.00012335034,0.00009792167,0.00007962588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000489878,0.00010527584,0.00011571022,0.000113688075,0.00011028788,0.000063093925,0.0002619038,0.00002970622,0.0000078529465],"category_scores_gemma":[0.000008795055,0.00011457228,0.000022093629,0.002215964,0.000034141907,0.0003086671,0.0000017279143,0.0000905154,0.000005883024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010243458,0.0000054472666,0.0011326654,0.0001457866,0.0000055684663,0.000001612395,0.00261307,0.9692602,0.0010261587,0.02506753,0.00007169125,0.0006599839],"study_design_scores_gemma":[0.0006147086,0.00002573982,0.036885336,0.00010815731,0.000021537307,2.8247476e-7,0.0028820552,0.95358014,0.00060109515,0.00034146965,0.0046890634,0.00025038765],"about_ca_topic_score_codex":0.000019365527,"about_ca_topic_score_gemma":0.00014110749,"teacher_disagreement_score":0.88080126,"about_ca_system_score_codex":0.000042766063,"about_ca_system_score_gemma":0.00002563726,"threshold_uncertainty_score":0.46721217},"labels":[],"label_agreement":null},{"id":"W3031511692","doi":"10.1287/trsc.2020.0986","title":"Introduction to the Special Section: Urban Freight Transportation and Logistics","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Transport engineering; Traffic management; Section (typography); Special section; City logistics; Rail freight transport; Business; Engineering; Operations research; Advertising","score_opus":0.024220403038908392,"score_gpt":0.204552196244316,"score_spread":0.1803317932054076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031511692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20098314,0.00017869643,0.7802609,0.009643221,0.004871628,0.0006716812,0.0002673515,0.00063342985,0.0024899296],"genre_scores_gemma":[0.9911208,0.00005168187,0.0014242309,0.00038918544,0.006870821,0.0000123354885,0.00006872956,0.000016697773,0.000045478686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875563,0.000006831073,0.00029522533,0.00033474367,0.00037757817,0.00022996042],"domain_scores_gemma":[0.99948657,0.000018330553,0.000029808403,0.00015115418,0.00010159062,0.00021252557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016680757,0.00014806651,0.00012817774,0.000076779186,0.00022165992,0.00006719507,0.00020312011,0.00004965032,0.00016524266],"category_scores_gemma":[0.000019573434,0.00012317352,0.00003162507,0.0010096816,0.0002749528,0.00029516194,9.2760774e-7,0.00017572686,0.000038886665],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023441482,0.00008831091,0.028344303,0.00035862712,0.00007512284,0.00006986339,0.059348386,0.54341245,0.04112521,0.113646135,0.20239076,0.010906427],"study_design_scores_gemma":[0.0005667259,0.00020982651,0.4419644,0.000013659214,0.00012361909,0.000003993486,0.00067944307,0.017153308,0.008613201,0.00029613124,0.5297599,0.0006158322],"about_ca_topic_score_codex":0.000011339517,"about_ca_topic_score_gemma":0.00026140746,"teacher_disagreement_score":0.7901377,"about_ca_system_score_codex":0.00003255464,"about_ca_system_score_gemma":0.000035398083,"threshold_uncertainty_score":0.5022871},"labels":[],"label_agreement":null},{"id":"W3034530669","doi":"10.1287/trsc.2020.0991","title":"Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Stochastic programming; Integer programming; Sequence (biology); Mathematical optimization; Stage (stratigraphy); Integer (computer science); Airplane; Acceleration; Point (geometry); Function (biology); Computer science; Benders' decomposition; Operations research; Mathematics; Engineering; Aerospace engineering","score_opus":0.01415244542292193,"score_gpt":0.23638424088349339,"score_spread":0.22223179546057145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034530669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016049236,0.000012053398,0.98147786,0.00014724543,0.00012410732,0.0008252094,0.00001478195,0.00041274825,0.0009367463],"genre_scores_gemma":[0.9417173,0.0000040023097,0.05792825,0.00007969158,0.000026584674,0.000113489376,0.00003865836,0.000018634202,0.000073338044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988573,0.0000033154204,0.00019893995,0.00031415318,0.00033588716,0.0002903695],"domain_scores_gemma":[0.9996491,0.000013921614,0.00004299232,0.000106854095,0.00007265852,0.00011444276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015503269,0.00014078613,0.00011474286,0.000090183436,0.00011930624,0.00006393759,0.00020592488,0.000017177885,0.00004032281],"category_scores_gemma":[0.000005781521,0.00013303167,0.00003050819,0.0005954554,0.00021640978,0.00036622476,0.0000030619901,0.00005833435,0.000007935838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003323532,0.000014807086,0.000051236042,0.000182853,0.000019466454,0.0000068727145,0.0010637658,0.96784043,0.00018877993,0.012306377,0.00003211633,0.018260084],"study_design_scores_gemma":[0.0013712313,0.00011645318,0.002453442,0.000064289,0.00006170363,4.7861914e-7,0.0016305444,0.992236,0.00075959944,0.00003680467,0.00093724014,0.00033216976],"about_ca_topic_score_codex":9.677741e-7,"about_ca_topic_score_gemma":0.000019718418,"teacher_disagreement_score":0.9256681,"about_ca_system_score_codex":0.000025868772,"about_ca_system_score_gemma":0.000020744856,"threshold_uncertainty_score":0.5424874},"labels":[],"label_agreement":null},{"id":"W3036776288","doi":"10.1287/trsc.2019.0956","title":"Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University","funders":"","keywords":"Bounding overwatch; Scheduling (production processes); Mathematical optimization; Vehicle routing problem; Branch and cut; Integer programming; Linear programming; Computer science; Stochastic programming; Travelling salesman problem; Stochastic optimization; Routing (electronic design automation); Mathematics","score_opus":0.018078489015077453,"score_gpt":0.258140197037406,"score_spread":0.24006170802232854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036776288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4727989,0.00009349565,0.5255507,0.001041642,0.0000067043584,0.0003554582,0.000008460886,0.00011632252,0.000028295897],"genre_scores_gemma":[0.97725075,0.000009960777,0.022478763,0.00019498142,0.0000073960596,0.00003384755,0.000008231839,0.000014572893,0.0000014964015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914587,0.000015036708,0.00020321368,0.00026598846,0.00018579507,0.00018412447],"domain_scores_gemma":[0.9996108,0.000051727468,0.000036644782,0.00007694876,0.00008213334,0.00014178986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025841105,0.00009765539,0.00012480855,0.000070167196,0.00011703432,0.000046370144,0.00009250973,0.000029413597,0.0000032762932],"category_scores_gemma":[0.000013166622,0.000095054165,0.000005225426,0.0012129359,0.00006758164,0.00028944254,0.0000033421434,0.00010828916,0.0000012586402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009674504,0.000008645619,0.015042997,0.00031043828,0.0000038362255,0.0000010872307,0.013838535,0.9555852,0.01090294,0.0013584784,4.4206726e-7,0.0029377437],"study_design_scores_gemma":[0.00047339158,0.000026943237,0.13893189,0.000054575772,0.0000079627125,0.0000013293891,0.0006141212,0.8592157,0.000493252,0.000048456353,0.0000028018187,0.00012958352],"about_ca_topic_score_codex":0.00005801622,"about_ca_topic_score_gemma":0.0001447659,"teacher_disagreement_score":0.5044519,"about_ca_system_score_codex":0.000025723353,"about_ca_system_score_gemma":0.000058236907,"threshold_uncertainty_score":0.38761964},"labels":[],"label_agreement":null},{"id":"W3091088451","doi":"10.1287/trsc.2019.0947","title":"Probabilistic Envelope Constrained Multiperiod Stochastic Emergency Medical Services Location Model and Decomposition Scheme","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Probabilistic logic; Solver; Constraint (computer-aided design); Computer science; Stochastic programming; Integer programming; Scheme (mathematics); Decomposition; Operations research; Envelope (radar); Facility location problem; Service (business); Engineering; Mathematics; Economics","score_opus":0.027658958380372075,"score_gpt":0.26979965351820523,"score_spread":0.24214069513783315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091088451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85525686,0.000032418153,0.1385041,0.004844303,0.00017339789,0.0004487146,0.0000061372557,0.00017129803,0.0005627453],"genre_scores_gemma":[0.9970891,0.00001025294,0.0010469216,0.0016381287,0.00007059069,0.00003356427,0.00008771349,0.000007642945,0.000016093954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824315,0.0000045402303,0.00040515687,0.0004425059,0.00069771,0.00020690731],"domain_scores_gemma":[0.9993509,0.0000062432746,0.00008168835,0.00011855381,0.00036988736,0.00007270789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040014717,0.00013837065,0.00012062355,0.00012823804,0.00029138313,0.00010082426,0.00027690842,0.00003943184,0.0004308725],"category_scores_gemma":[0.00011788491,0.00013760396,0.0000242911,0.0010178167,0.00023558685,0.0014449905,0.000020837399,0.000076112374,0.00010359758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021634229,0.00040145038,0.015719905,0.0041613,0.00004259369,0.000008493234,0.007890932,0.7340293,0.013798572,0.21065065,0.00028511573,0.012795331],"study_design_scores_gemma":[0.00032584675,0.000007398285,0.044190448,0.000028981607,0.000021361027,1.8144664e-7,0.00037649804,0.9541418,0.000014264504,0.00058299664,0.00014444102,0.00016576755],"about_ca_topic_score_codex":0.0002038593,"about_ca_topic_score_gemma":0.0006599625,"teacher_disagreement_score":0.2201125,"about_ca_system_score_codex":0.000017488279,"about_ca_system_score_gemma":0.00009575248,"threshold_uncertainty_score":0.56113267},"labels":[],"label_agreement":null},{"id":"W3092337992","doi":"10.1287/trsc.2020.1003","title":"Benders Decomposition for the Profit Maximizing Capacitated Hub Location Problem with Multiple Demand Classes","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Benders' decomposition; Robustness (evolution); Computer science; Variable (mathematics); Convergence (economics); Pareto principle; Mathematics","score_opus":0.04746483725411603,"score_gpt":0.2588982549626443,"score_spread":0.21143341770852825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092337992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35018685,0.000030268502,0.63207555,0.014992167,0.00014704997,0.001724778,0.000007298909,0.0002019958,0.00063402124],"genre_scores_gemma":[0.9951162,0.0000049983128,0.0027443422,0.0017903737,0.00006356732,0.00015491538,0.00009140118,0.000009444808,0.000024757806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988333,0.0000040411255,0.00024711163,0.0003281692,0.00038095025,0.00020643293],"domain_scores_gemma":[0.9992543,0.000028687931,0.0000951455,0.00012382345,0.00047709423,0.000020945618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039912152,0.000112808906,0.000084228304,0.000097941505,0.0005701935,0.00020828107,0.0002534109,0.000018509232,0.000036370293],"category_scores_gemma":[0.000049456175,0.00008168161,0.000028914672,0.0013023685,0.00017165672,0.0015736467,0.000005795805,0.00005222616,0.000032329775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063717057,0.00013263086,0.085899204,0.001834067,0.00008364079,0.0000021873948,0.006411121,0.7961499,0.015164856,0.08102508,0.0019853038,0.0106748305],"study_design_scores_gemma":[0.0014776692,0.00005880696,0.2835221,0.00006182572,0.00015626382,2.4815594e-7,0.005480104,0.6973161,0.0017208972,0.0006541943,0.0091582555,0.00039348987],"about_ca_topic_score_codex":0.0003566761,"about_ca_topic_score_gemma":0.0015159877,"teacher_disagreement_score":0.64492935,"about_ca_system_score_codex":0.0000231814,"about_ca_system_score_gemma":0.00005209706,"threshold_uncertainty_score":0.43855253},"labels":[],"label_agreement":null},{"id":"W3107189808","doi":"10.1287/trsc.2021.1092","title":"A Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem with Time Windows","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Column generation; Vehicle routing problem; Benchmark (surveying); Echelon formation; Computer science; Mathematical optimization; Routing (electronic design automation); Branch and cut; Algorithm; Process (computing); Integer programming; Mathematics","score_opus":0.01732423156048552,"score_gpt":0.21989082002645668,"score_spread":0.20256658846597117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107189808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05664636,0.00026920246,0.9407852,0.00014780417,0.00009818912,0.00036711045,0.000061492996,0.00019913838,0.0014254893],"genre_scores_gemma":[0.9600804,0.000030095578,0.039491363,0.00007521641,0.00003951462,0.00003645456,0.000026390195,0.000019019159,0.00020157904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990097,0.0000047027775,0.0001959613,0.0002442879,0.00026813033,0.00027717356],"domain_scores_gemma":[0.99950284,0.00009225252,0.000030294874,0.00015824717,0.00013994612,0.000076420394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028740164,0.000118571756,0.00012064032,0.000038443395,0.00023920722,0.00007147685,0.00015419303,0.000029119292,0.000028385499],"category_scores_gemma":[0.0000061295623,0.00008653198,0.000030967687,0.0005676254,0.00023001354,0.0002450433,0.000001730964,0.00010440886,0.0000072217404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009326057,0.00020835918,0.020121774,0.000505729,0.00026417492,0.00015377796,0.01869272,0.27374244,0.2412674,0.035171468,0.00031893776,0.40945998],"study_design_scores_gemma":[0.0016709503,0.00007497422,0.06886875,0.00007890646,0.00013536014,0.000017219765,0.00024231788,0.881313,0.043606266,0.00094967225,0.002579203,0.000463342],"about_ca_topic_score_codex":0.000016960747,"about_ca_topic_score_gemma":0.00011017421,"teacher_disagreement_score":0.90343404,"about_ca_system_score_codex":0.000024271783,"about_ca_system_score_gemma":0.000091960035,"threshold_uncertainty_score":0.3528672},"labels":[],"label_agreement":null},{"id":"W3115020944","doi":"10.1287/trsc.2020.1022","title":"Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada; Université du Québec à Montréal","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Decomposition; Network planning and design; Computer science; Stochastic programming; Class (philosophy); Dual (grammatical number); Decomposition method (queueing theory); Relaxation (psychology); Process (computing); Mathematics","score_opus":0.07043514893512383,"score_gpt":0.32223355932867853,"score_spread":0.2517984103935547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115020944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075899404,0.00001600923,0.991501,0.0004124071,0.000052222975,0.00023013072,0.0000011314,0.00015197438,0.000045180943],"genre_scores_gemma":[0.60578674,0.0000014679174,0.39388725,0.00026208864,0.00003050181,0.00002255922,0.0000036387007,0.0000047609733,9.739981e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994114,0.00001433834,0.00014551533,0.00015962035,0.000120449535,0.00014865524],"domain_scores_gemma":[0.99967694,0.000053773605,0.00001521807,0.00005069435,0.00003197025,0.00017138112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024262581,0.000060336857,0.00008083867,0.000029151546,0.00008692636,0.000029599127,0.00007476128,0.000020849504,0.000016884485],"category_scores_gemma":[0.0000218039,0.00006268213,0.000010658453,0.00043700935,0.00006814102,0.000132858,0.000002193843,0.000039631457,0.000011461441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057404777,0.0000021970216,0.0000092496975,0.000009905347,0.0000018018989,2.547726e-7,0.0009293638,0.9817807,0.0051554013,0.0072352546,0.00003039415,0.004839753],"study_design_scores_gemma":[0.00010308864,0.000031128035,0.0004934666,0.000003540902,0.0000106950265,6.99864e-7,0.000052029598,0.9966104,0.0016078833,0.00088816247,0.00011108378,0.000087818975],"about_ca_topic_score_codex":0.0000012127753,"about_ca_topic_score_gemma":0.0000019357547,"teacher_disagreement_score":0.5981968,"about_ca_system_score_codex":0.000009964473,"about_ca_system_score_gemma":0.000013348553,"threshold_uncertainty_score":0.2556103},"labels":[],"label_agreement":null},{"id":"W3119081436","doi":"10.1287/trsc.2022.1128","title":"Real-Time Forecasting of Metro Origin-Destination Matrices with High-Order Weighted Dynamic Mode Decomposition","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; McGill University","funders":"","keywords":"Singular value decomposition; Computer science; Term (time); Baseline (sea); Dynamic mode decomposition; Rank (graph theory); Matrix (chemical analysis); Decomposition; Algorithm; Data mining; Mathematics; Machine learning","score_opus":0.007680510451620157,"score_gpt":0.25776284232690655,"score_spread":0.2500823318752864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119081436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7776038,0.0000064534906,0.22012311,0.000021654538,0.000066371744,0.00016742328,0.000030375088,0.0010740071,0.0009067857],"genre_scores_gemma":[0.9564217,0.000019026676,0.04337584,0.0000055250616,0.0000038078445,0.000045683315,0.000100037534,0.000011403926,0.00001700458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905074,0.000010654521,0.00020391123,0.00016617254,0.00043663295,0.00013190681],"domain_scores_gemma":[0.9996751,0.000019762661,0.000076804674,0.00010127385,0.00009491355,0.00003217962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002387786,0.00008028151,0.000089681496,0.00036489544,0.00016836233,0.00001756813,0.00015997808,0.000012420245,0.00004226512],"category_scores_gemma":[0.000002088283,0.00008070168,0.000015724128,0.0013753286,0.00006245063,0.00042271524,0.0000040503223,0.00006453531,0.0000013388258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036411264,0.0000669138,0.0007918811,0.00009660165,0.0000211453,0.0000069666567,0.00084269163,0.8406736,0.14004052,0.007713724,0.00013940538,0.009570125],"study_design_scores_gemma":[0.00026364272,0.00009636345,0.021068929,0.000017865668,0.00003060999,0.0000018912226,0.00012937405,0.969822,0.008202396,0.00017949265,0.00006290105,0.00012453953],"about_ca_topic_score_codex":0.00008503062,"about_ca_topic_score_gemma":0.00005017957,"teacher_disagreement_score":0.17881787,"about_ca_system_score_codex":0.00010902046,"about_ca_system_score_gemma":0.00003497786,"threshold_uncertainty_score":0.3290919},"labels":[],"label_agreement":null},{"id":"W3119505565","doi":"10.1287/trsc.2022.1147","title":"Departure Time Choice Models in Urban Transportation Systems Based on Mean Field Games","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Commission","keywords":"Queue; Mathematical optimization; Computer science; Game theory; Point (geometry); Field (mathematics); Mathematical economics; Mathematics","score_opus":0.02056232498680118,"score_gpt":0.280011843733553,"score_spread":0.2594495187467518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119505565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9530171,0.00012252439,0.028510435,0.0024345121,0.0010289602,0.0013818288,0.00037174762,0.00051607325,0.012616784],"genre_scores_gemma":[0.997814,0.000008667368,0.0005031402,0.00054886134,0.000043980894,0.00013322374,0.00034280712,0.000015040162,0.00059026416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969124,0.00015380979,0.00045693113,0.0005164651,0.0015556818,0.00040471627],"domain_scores_gemma":[0.9990316,0.00026488092,0.00018321665,0.00020208365,0.00016184333,0.00015639944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013919262,0.00015499578,0.00018638554,0.0004904604,0.0010552685,0.000100171375,0.00043965902,0.00007299815,0.00027973394],"category_scores_gemma":[0.000045911645,0.00017582903,0.000064504624,0.002152181,0.00019092581,0.0008302885,9.1667425e-7,0.00025987695,0.000009909403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067447734,0.00009151913,0.024757152,0.000011743223,0.0000020342125,0.000011113864,0.021303557,0.942016,0.00011820064,0.010935464,0.00033459743,0.000351185],"study_design_scores_gemma":[0.0023125487,0.0004339971,0.37676823,0.00014605215,0.00006419369,4.911673e-7,0.011938725,0.58475304,0.00035521472,0.00070659997,0.021523966,0.0009969649],"about_ca_topic_score_codex":0.0035948192,"about_ca_topic_score_gemma":0.0070379404,"teacher_disagreement_score":0.35726297,"about_ca_system_score_codex":0.00018069528,"about_ca_system_score_gemma":0.0005556355,"threshold_uncertainty_score":0.8116378},"labels":[],"label_agreement":null},{"id":"W3129729546","doi":"10.1287/trsc.2020.1013","title":"The Robust Vehicle Routing Problem with Time Window Assignments","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Compute Canada","keywords":"Subgradient method; Vehicle routing problem; Window (computing); Mathematical optimization; Computer science; Travel time; Routing (electronic design automation); Service (business); Operations research; Mathematics; Engineering; Transport engineering; Economics; Computer network","score_opus":0.013936633328072743,"score_gpt":0.23757625810749416,"score_spread":0.22363962477942143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129729546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.506925,0.00006323066,0.48545706,0.00030905663,0.0001458348,0.00023102602,0.0000074652344,0.0004384736,0.0064228484],"genre_scores_gemma":[0.899824,0.00000955411,0.09966909,0.000036111363,0.000016351021,0.000011988139,0.000007861243,0.000018920275,0.0004060749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876547,0.00003166488,0.00021566985,0.00022137558,0.0004771552,0.00028864574],"domain_scores_gemma":[0.9993963,0.00009050668,0.000045693916,0.00020772002,0.00018323264,0.0000765009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007742901,0.00009600595,0.000084121115,0.000035267833,0.00042992423,0.00015953727,0.00021306922,0.000025761801,0.000040345047],"category_scores_gemma":[0.00003335918,0.00007313175,0.000019789139,0.001087076,0.00015890432,0.000382892,0.0000039014594,0.00010988287,0.000025397652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032428861,0.000007778597,0.0057368707,0.000007936144,0.000007320596,0.000006397362,0.00063546136,0.9469355,0.042049803,0.00053001795,0.000016885964,0.0040628035],"study_design_scores_gemma":[0.00061568967,0.000028717941,0.14176473,0.00007243502,0.000026823152,0.000008334145,0.00043144322,0.7609222,0.09515819,0.000117680094,0.0005285466,0.00032523082],"about_ca_topic_score_codex":0.0000031681316,"about_ca_topic_score_gemma":0.000016668335,"teacher_disagreement_score":0.39289904,"about_ca_system_score_codex":0.000056688332,"about_ca_system_score_gemma":0.00012860294,"threshold_uncertainty_score":0.3306673},"labels":[],"label_agreement":null},{"id":"W3130000260","doi":"10.1287/trsc.2020.1030","title":"The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Fleet management; Integer programming; Time horizon; Mathematical optimization; Decomposition; Linear programming; Assignment problem; Reduction (mathematics); Constraint (computer-aided design); Operations research; Power (physics); Computer science; State (computer science); Constraint programming; Engineering; Transport engineering; Algorithm; Stochastic programming; Mathematics","score_opus":0.008333230380190881,"score_gpt":0.20577232988551913,"score_spread":0.19743909950532826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130000260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92630213,0.00033622928,0.024207624,0.0037390566,0.00064942864,0.00054091454,0.00029981247,0.00015991714,0.043764867],"genre_scores_gemma":[0.9992551,0.00000473204,0.000105662235,0.00004681609,0.000010709617,0.000031864416,0.0000439314,0.0000069959074,0.0004941857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9987035,0.000014606496,0.00015044305,0.0001732747,0.00067783357,0.0002803573],"domain_scores_gemma":[0.99936205,0.00005133283,0.000030430785,0.00014989215,0.00028887525,0.00011739207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042521005,0.00008892834,0.00006465072,0.000033001415,0.0010028776,0.00013326462,0.00022219589,0.000021550883,0.000068077665],"category_scores_gemma":[0.000010039143,0.00004927493,0.00002267643,0.00074862025,0.00031811657,0.00013747509,0.0000025872694,0.000079454265,0.00001975104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000471329,0.0000173954,0.0034402397,0.000008205114,0.000022007966,0.000015755684,0.0022693863,0.96463054,0.002174039,0.025366193,0.0015008515,0.0005506527],"study_design_scores_gemma":[0.000553978,0.000046893696,0.8127346,0.0000614398,0.00001760613,0.000026671998,0.0018736457,0.0273298,0.011265882,0.00026527562,0.14539574,0.00042847733],"about_ca_topic_score_codex":0.002574219,"about_ca_topic_score_gemma":0.31999785,"teacher_disagreement_score":0.93730074,"about_ca_system_score_codex":0.0003684206,"about_ca_system_score_gemma":0.00057351106,"threshold_uncertainty_score":0.7713426},"labels":[],"label_agreement":null},{"id":"W3130388201","doi":"10.1287/trsc.2020.1033","title":"A Strategic Markovian Traffic Equilibrium Model for Capacitated Networks","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Arc (geometry); Markov process; Flow network; Mathematical optimization; Computer science; Work (physics); Markov chain; Traffic flow (computer networking); Mathematical economics; Mathematics; Engineering; Computer network","score_opus":0.057840495474320845,"score_gpt":0.3191556694347269,"score_spread":0.26131517396040604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130388201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64254934,0.00007430999,0.35149923,0.00093928614,0.0003975676,0.00038126146,0.000089098685,0.00026498624,0.0038049207],"genre_scores_gemma":[0.98541933,0.000035002224,0.012593968,0.00018675796,0.000050886847,0.00003506183,0.00029409426,0.000012205195,0.0013727079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982379,0.0000388657,0.00031697663,0.00041955177,0.0005427053,0.00044399398],"domain_scores_gemma":[0.9987737,0.000087116074,0.00010565236,0.00014470768,0.00068381045,0.00020499087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084244594,0.00011215676,0.00013389777,0.00011539023,0.0006937745,0.0001775124,0.00023387728,0.00008864461,0.00007689896],"category_scores_gemma":[0.00005592341,0.00012568115,0.00007402585,0.0014321221,0.00048762825,0.0007031112,8.7521335e-7,0.00009015744,0.0000035004734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023509223,0.000034111345,0.00041981615,0.000010542655,0.0000040663826,0.000004443414,0.0129649555,0.9539849,0.0007140697,0.03127882,0.000070102964,0.00049062434],"study_design_scores_gemma":[0.00049539114,0.00001987456,0.0043399087,0.000022660204,0.000031482414,4.4653845e-7,0.0049379286,0.988104,0.00019389823,0.0013156601,0.0003086563,0.0002301093],"about_ca_topic_score_codex":0.000060877115,"about_ca_topic_score_gemma":0.0028271286,"teacher_disagreement_score":0.34287,"about_ca_system_score_codex":0.000055028886,"about_ca_system_score_gemma":0.0013153914,"threshold_uncertainty_score":0.53360224},"labels":[],"label_agreement":null},{"id":"W3131441060","doi":"10.1287/trsc.2020.1028","title":"A Data-Driven Method for Reconstructing a Distribution from a Truncated Sample with an Application to Inferring Car-Sharing Demand","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Truncation (statistics); Sample (material); Computer science; Trip distribution; Mathematical optimization; Process (computing); Sampling (signal processing); Maximum likelihood; Algorithm; Data mining; Statistics; Mathematics; Machine learning","score_opus":0.06315858534908499,"score_gpt":0.3767507232281914,"score_spread":0.31359213787910645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131441060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35517344,0.000004509007,0.6430251,0.00018745681,0.000054931676,0.0002823484,0.0011415316,0.00009483038,0.000035846828],"genre_scores_gemma":[0.6612817,0.0000033587646,0.33207512,0.000059253525,0.000043643653,0.00005485024,0.0064650015,0.000007749579,0.000009331903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981635,0.000048954953,0.0003092469,0.0007412646,0.0004564183,0.0002806113],"domain_scores_gemma":[0.99845916,0.0002252149,0.00015393201,0.0003579221,0.0005988074,0.00020496392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010816994,0.00010363672,0.0001458776,0.00008182506,0.0009501492,0.0002155781,0.00041141032,0.000054966033,0.000022998798],"category_scores_gemma":[0.0002970935,0.00010985984,0.000021141423,0.001376085,0.0001290196,0.0013579672,0.0000054790303,0.00007025523,0.0000017146882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032738337,0.00015226167,0.36924893,0.00005540515,0.00005335565,0.000007636371,0.08659639,0.43653435,0.019975938,0.04202133,0.000028096563,0.044998925],"study_design_scores_gemma":[0.0017027623,0.0001355607,0.37161753,0.00018505554,0.00024037842,0.0000023187158,0.024778392,0.5828296,0.0071032154,0.0037094255,0.0068657757,0.00082996394],"about_ca_topic_score_codex":0.00470933,"about_ca_topic_score_gemma":0.038815632,"teacher_disagreement_score":0.31094998,"about_ca_system_score_codex":0.000084626365,"about_ca_system_score_gemma":0.00057553034,"threshold_uncertainty_score":0.97872347},"labels":[],"label_agreement":null},{"id":"W3131447838","doi":"10.1287/trsc.2021.1062","title":"The Single-Line Design Problem for Demand-Adaptive Transit Systems: A Modeling Framework and Decomposition Approach for the Stationary-Demand Case","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Flexibility (engineering); Adaptability; Public transport; Decomposition; Computer science; Process (computing); Variety (cybernetics); Transit (satellite); Operations research; Industrial engineering; Transport engineering; Engineering; Economics; Artificial intelligence","score_opus":0.08429365334086981,"score_gpt":0.33679149007728915,"score_spread":0.25249783673641935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131447838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00919374,0.00081567914,0.98712337,0.0009059428,0.00014493425,0.0016025485,0.00009238008,0.00006048431,0.00006089739],"genre_scores_gemma":[0.7930019,0.0001422691,0.20624362,0.0000615283,0.000057097892,0.0003476191,0.00007920849,0.000010335029,0.000056430694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834883,0.000119976285,0.000386742,0.000387057,0.0004501903,0.0003072037],"domain_scores_gemma":[0.9973684,0.0014491155,0.00014490639,0.00012553971,0.0008136817,0.00009836901],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024855554,0.000121124176,0.00013091366,0.000058687252,0.003917256,0.000376649,0.00016571958,0.00008074081,0.000001800423],"category_scores_gemma":[0.00012207453,0.000088104964,0.00005507982,0.00063525914,0.00042351824,0.00055277743,0.0000011978852,0.0000910213,1.7924373e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116356394,0.0000343434,0.000039989027,0.000033374567,0.00001544818,0.000004494679,0.02113437,0.90983796,0.00015688327,0.0670826,0.000011348191,0.0015328529],"study_design_scores_gemma":[0.00047322066,0.000082744096,0.00018490959,0.000053121035,0.00011733377,0.000013678237,0.026274117,0.9674389,0.00016971838,0.0048290044,0.00020584952,0.00015739875],"about_ca_topic_score_codex":0.00017272544,"about_ca_topic_score_gemma":0.0005011207,"teacher_disagreement_score":0.7838082,"about_ca_system_score_codex":0.00005105082,"about_ca_system_score_gemma":0.00041977238,"threshold_uncertainty_score":0.9973795},"labels":[],"label_agreement":null},{"id":"W3134399921","doi":"10.1287/trsc.2020.1029","title":"Workforce Scheduling with Order-Picking Assignments in Distribution Facilities","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Order picking; Scheduling (production processes); Metaheuristic; Schedule; Job shop scheduling; Computer science; Mathematical optimization; Operations research; Order (exchange); Engineering; Mathematics; Economics; Business","score_opus":0.015554224380987962,"score_gpt":0.23615764952321558,"score_spread":0.2206034251422276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134399921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34346962,0.000032088574,0.6559192,0.00000955793,0.000054500397,0.000034838693,0.0000119908,0.00007169405,0.00039655337],"genre_scores_gemma":[0.9771086,0.000033377637,0.022631252,0.0000066301236,0.0000059510644,0.000007648013,0.00010742709,0.0000056683975,0.00009341917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993529,0.000004188619,0.00013246645,0.00015997562,0.00017921028,0.00017130973],"domain_scores_gemma":[0.9997588,0.00001817426,0.000018404395,0.00008675559,0.00008276047,0.00003512478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009409144,0.00007020613,0.00006626235,0.00004199554,0.00008049821,0.00004034131,0.00006080521,0.000021721562,0.000017027754],"category_scores_gemma":[0.000027740924,0.000069827234,0.0000075006874,0.0005456308,0.00008063265,0.00028469798,0.0000014108134,0.00007740039,0.0000024533776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004108564,0.0000053113054,0.003008088,0.000016940163,0.0000010026936,0.0000062082418,0.00037812945,0.99370754,0.0004667026,0.0014708205,5.468304e-7,0.0009346326],"study_design_scores_gemma":[0.0017634582,0.00009579163,0.25866604,0.00047577833,0.000027442898,0.000008951336,0.004598801,0.5528949,0.17574,0.0030975975,0.001608658,0.0010225688],"about_ca_topic_score_codex":0.000010210468,"about_ca_topic_score_gemma":0.00014144341,"teacher_disagreement_score":0.63363904,"about_ca_system_score_codex":0.000076859185,"about_ca_system_score_gemma":0.0000510499,"threshold_uncertainty_score":0.2847472},"labels":[],"label_agreement":null},{"id":"W3140856702","doi":"10.1287/trsc.2021.1084","title":"An Improved Integral Column Generation Algorithm Using Machine Learning for Aircrew Pairing","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Pairing; Crew; Aircrew; Column generation; Computer science; Algorithm; Scheduling (production processes); Crew scheduling; Process (computing); Set (abstract data type); Engineering; Mathematics; Mathematical optimization; Aeronautics; Physics; Programming language","score_opus":0.03862218519718917,"score_gpt":0.3131411882160839,"score_spread":0.2745190030188947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140856702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28143045,0.000043023047,0.71792793,0.000010261713,0.00023128687,0.00011454938,0.000012570952,0.00021259594,0.00001731508],"genre_scores_gemma":[0.49623492,0.000006552766,0.5035308,0.000020923897,0.000054181786,0.000009852578,0.0000995647,0.000018631714,0.000024555035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891734,0.00003840842,0.00028006124,0.00029878673,0.00021583302,0.00024954407],"domain_scores_gemma":[0.9993429,0.000036273992,0.000049931063,0.0001474519,0.0003252582,0.000098181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078192377,0.00011204694,0.00012469954,0.00010828211,0.00031953328,0.00013665958,0.00012993187,0.000048103124,0.000027978314],"category_scores_gemma":[0.00007841695,0.00013251377,0.0000411641,0.0007656595,0.00006243796,0.0007005381,0.0000023244868,0.00012646102,8.909556e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.4011384e-7,0.0000066372336,0.00081131305,0.000012468532,0.0000027427654,0.000001004124,0.00039538342,0.59505624,0.37860617,0.000044835502,5.608459e-7,0.025061766],"study_design_scores_gemma":[0.00022656714,0.000021637468,0.0016913696,0.0000101071555,0.000013334629,0.0000024936367,0.000117165255,0.8480581,0.1496235,0.000013697971,0.000085990636,0.00013602874],"about_ca_topic_score_codex":0.000041842894,"about_ca_topic_score_gemma":0.00013650474,"teacher_disagreement_score":0.25300184,"about_ca_system_score_codex":0.00008790972,"about_ca_system_score_gemma":0.00012836023,"threshold_uncertainty_score":0.5403755},"labels":[],"label_agreement":null},{"id":"W3157158781","doi":"10.1287/trsc.2022.1168","title":"The Fragility-Constrained Vehicle Routing Problem with Time Windows","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Fragility; Column generation; Constraint (computer-aided design); Mathematical optimization; Routing (electronic design automation); Path (computing); Computer science; Algorithm; Mathematics","score_opus":0.009692242060243708,"score_gpt":0.2352825047397383,"score_spread":0.22559026267949459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157158781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8526655,0.000036583308,0.1397441,0.00041844792,0.00015499315,0.00050422724,0.000027009406,0.00070148293,0.005747679],"genre_scores_gemma":[0.9713241,0.000001602245,0.028383112,0.000045586065,0.000011311057,0.000053062453,0.000008170393,0.000017197019,0.00015586955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985963,0.00005346103,0.0002483049,0.00022369051,0.0005742284,0.00030398057],"domain_scores_gemma":[0.99945116,0.0001245892,0.00005647308,0.00021317517,0.000086963584,0.00006764007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017764233,0.000097631106,0.00008774318,0.00006567781,0.0011706792,0.00008427529,0.00036749215,0.00001387813,0.000111932364],"category_scores_gemma":[0.000023696548,0.00007825131,0.000023619259,0.0012915395,0.00027545565,0.00027646188,0.000007617489,0.00020216504,0.000009347027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094766265,0.000007685625,0.0029034913,0.000005359557,0.000005022292,0.00000238412,0.0015900515,0.9782758,0.010831776,0.0013218771,0.000014208661,0.0050328765],"study_design_scores_gemma":[0.00050252536,0.00006415981,0.03386215,0.000009856791,0.0000146504,0.000007737499,0.0008682813,0.9581939,0.004592713,0.00023002128,0.0014024506,0.00025154732],"about_ca_topic_score_codex":0.000009578881,"about_ca_topic_score_gemma":0.000010665216,"teacher_disagreement_score":0.11865862,"about_ca_system_score_codex":0.0000843528,"about_ca_system_score_gemma":0.00012395131,"threshold_uncertainty_score":0.9004037},"labels":[],"label_agreement":null},{"id":"W3181596661","doi":"10.1287/trsc.2022.1176","title":"Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Metaheuristic; Computer science; Vehicle routing problem; Mathematical optimization; Combinatorial optimization; Routing (electronic design automation); Traveling purchaser problem; Heuristic; 2-opt; Mathematics; Artificial intelligence; Computer network","score_opus":0.020268344787622763,"score_gpt":0.25714307200236775,"score_spread":0.23687472721474498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181596661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32097143,0.00016452334,0.677252,0.0002432969,0.00036575797,0.00046164467,0.0000332371,0.00023716433,0.00027093344],"genre_scores_gemma":[0.9263094,0.000032207117,0.07333547,0.00007872069,0.000026248304,0.00013594839,0.000007475953,0.000018925015,0.000055588713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894905,0.000024117388,0.00024245659,0.00021906423,0.00034337142,0.00022191244],"domain_scores_gemma":[0.9994064,0.00028181466,0.00004459678,0.00014857529,0.00006559826,0.000053023265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219824,0.000091608075,0.00008899943,0.00005783864,0.0007275656,0.00005858074,0.00027814053,0.000016882565,0.00007142961],"category_scores_gemma":[0.000030112222,0.000083634804,0.000037797905,0.00060174766,0.00012201269,0.00022710634,0.000007977354,0.000120915065,9.153301e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001000534,0.000008867509,0.0010826836,0.00002865651,0.0000083376735,6.061478e-7,0.0035438032,0.96215814,0.021020107,0.0026091642,0.00003389177,0.009495721],"study_design_scores_gemma":[0.000656446,0.000051060095,0.059005585,0.000010126095,0.000051499035,0.000004570145,0.001334376,0.93100905,0.005120205,0.00069800694,0.0017902307,0.00026882163],"about_ca_topic_score_codex":0.000013924296,"about_ca_topic_score_gemma":0.000009805669,"teacher_disagreement_score":0.605338,"about_ca_system_score_codex":0.000043968786,"about_ca_system_score_gemma":0.00006178426,"threshold_uncertainty_score":0.559592},"labels":[],"label_agreement":null},{"id":"W3188428865","doi":"10.1287/trsc.2021.1043","title":"Efficient Simulation-Based Toll Optimization for Large-Scale Networks","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Traffic control and management","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"National Science Foundation","keywords":"Mathematical optimization; Computer science; Toll; Optimization problem; Set (abstract data type); Dimension (graph theory); Scalability; Nonlinear system; Scale (ratio); Algorithm; Mathematics","score_opus":0.007880051128196295,"score_gpt":0.22891210726499156,"score_spread":0.22103205613679527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188428865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040596027,0.000055112916,0.9583694,0.0000653504,0.0003059056,0.00020866242,0.000018058834,0.00018437176,0.00019712222],"genre_scores_gemma":[0.9823992,0.000002523574,0.017339498,0.000087980334,0.000024904482,0.00003330986,0.00007015631,0.000008778488,0.00003360576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992597,0.0000036097733,0.00016371011,0.00018210057,0.00019298136,0.00019789921],"domain_scores_gemma":[0.9995996,0.00006544205,0.000019736846,0.00011913606,0.00014312933,0.000052964377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018422032,0.0000687962,0.0000738762,0.000060950468,0.00011993936,0.000041203708,0.00007964627,0.000022362656,0.00006310326],"category_scores_gemma":[0.000012961909,0.00007335099,0.0000403073,0.0004587737,0.000022522923,0.0000664654,0.0000011264547,0.000029061073,0.000002025126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047434805,0.000021743554,0.00007729039,0.0000181113,0.0000024143683,8.01097e-7,0.00015456982,0.997497,0.00012063487,0.0003730725,0.000013637172,0.0017159737],"study_design_scores_gemma":[0.0005355987,0.000006996124,0.0081045,0.000008372478,0.00001458894,2.7161493e-8,0.00006292031,0.9900953,0.00015203061,0.0000056445197,0.0009258411,0.000088165754],"about_ca_topic_score_codex":8.4459344e-7,"about_ca_topic_score_gemma":0.000053677406,"teacher_disagreement_score":0.9418032,"about_ca_system_score_codex":0.000030598643,"about_ca_system_score_gemma":0.000044565837,"threshold_uncertainty_score":0.29911664},"labels":[],"label_agreement":null},{"id":"W3204544826","doi":"10.1287/trsc.2021.1064","title":"Robust Stochastic Models for Profit-Maximizing Hub Location Problems","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regret; Mathematical optimization; Stochastic programming; Robust optimization; Stochastic modelling; Revenue; Profit (economics); Computer science; Mathematics; Economics","score_opus":0.09763469457569629,"score_gpt":0.25822757367247573,"score_spread":0.16059287909677944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204544826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074111246,0.000051633688,0.92114997,0.0015871412,0.00046832516,0.00066733937,0.0000052763626,0.00014092939,0.0018181588],"genre_scores_gemma":[0.99529433,0.00000386791,0.0031233672,0.0006692543,0.0000929818,0.00016198133,0.00015378797,0.000011251698,0.0004891466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984624,0.0000031095203,0.0003351473,0.00045709158,0.0004660263,0.0002762515],"domain_scores_gemma":[0.9985503,0.000010974628,0.000080713995,0.00022976335,0.0011085884,0.00001964455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006248378,0.00011751156,0.00011020069,0.00020497413,0.00038835383,0.0002250151,0.00023903679,0.000026879427,0.000104061415],"category_scores_gemma":[0.00008947832,0.0001226025,0.000046815247,0.0016631185,0.000105643674,0.002506689,0.000011611975,0.000048127462,0.00006705725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007983563,0.00002533512,0.00033963073,0.00027206185,0.0000041731055,4.0811562e-7,0.00025702443,0.888877,0.00087860157,0.10740932,0.00014113104,0.0017873766],"study_design_scores_gemma":[0.00046690693,0.0000060138163,0.013890099,0.0000612518,0.000046306966,2.0101318e-7,0.0008215139,0.9734384,0.00026511418,0.009423344,0.0013274906,0.0002533526],"about_ca_topic_score_codex":0.0002038286,"about_ca_topic_score_gemma":0.00094293925,"teacher_disagreement_score":0.9211831,"about_ca_system_score_codex":0.000038242284,"about_ca_system_score_gemma":0.00012972888,"threshold_uncertainty_score":0.49995854},"labels":[],"label_agreement":null},{"id":"W3213024488","doi":"10.1287/trsc.2021.1096","title":"Probabilistic Set Covering Location Problem in Congested Networks","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Probabilistic logic; Service (business); Operations research; Computer science; Set (abstract data type); Facility location problem; Integer (computer science); Integer programming; Level of service; Transport engineering; Engineering; Mathematics; Economics","score_opus":0.02967950736546942,"score_gpt":0.25133128183237713,"score_spread":0.2216517744669077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213024488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96634704,0.00005711105,0.024405811,0.0013145768,0.0004873167,0.00050642417,0.000002272689,0.0001441456,0.0067352764],"genre_scores_gemma":[0.99874777,0.000009159394,0.00027614902,0.00060520606,0.000044969816,0.00003752118,0.0001017492,0.000005727718,0.00017177545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99874324,0.000005971505,0.00032348587,0.00035452456,0.00034651838,0.000226279],"domain_scores_gemma":[0.9993011,0.000009299381,0.00005528946,0.00018428243,0.00043615102,0.000013918228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917389,0.00009157177,0.00009511882,0.00018535316,0.00013183046,0.0001623644,0.00017643445,0.000025245794,0.00020540465],"category_scores_gemma":[0.0000798648,0.00009890992,0.000020222864,0.0027980544,0.00010653625,0.0013858824,0.000012094103,0.00006891052,0.00007770243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015088154,0.000099917546,0.039030164,0.00031921922,0.0000037607733,0.00001111569,0.00040043943,0.8756396,0.00055249454,0.07996678,0.00015233185,0.0038090658],"study_design_scores_gemma":[0.00043053442,0.00000393517,0.68442786,0.00007332803,0.000016559,3.1499948e-7,0.00060847786,0.3078482,0.00008747798,0.0013828304,0.0048949444,0.00022553645],"about_ca_topic_score_codex":0.000620997,"about_ca_topic_score_gemma":0.0060106004,"teacher_disagreement_score":0.6453977,"about_ca_system_score_codex":0.00005229018,"about_ca_system_score_gemma":0.000091909555,"threshold_uncertainty_score":0.40334296},"labels":[],"label_agreement":null},{"id":"W3213233844","doi":"10.1287/trsc.2021.1088","title":"Stochastic Last-Mile Delivery with Crowd-Shipping and Mobile Depots","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Operations research; Stochastic programming; Last mile (transportation); Decomposition; Integer (computer science); Routing (electronic design automation); Vehicle routing problem; Mile; Mathematical optimization; Engineering; Mathematics; Computer network","score_opus":0.012533441366807745,"score_gpt":0.19389786386397692,"score_spread":0.18136442249716916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213233844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81841797,0.00040713188,0.18023793,0.0000060437724,0.000101604426,0.00007910128,0.000020834726,0.00013580835,0.0005935723],"genre_scores_gemma":[0.99550784,0.000047187772,0.0042998176,0.000032377495,0.00001624377,0.000014424725,0.000022034395,0.000013497512,0.00004656442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9991309,0.0000033409124,0.0001549836,0.00023064378,0.00025886646,0.00022124777],"domain_scores_gemma":[0.9995978,0.000030120078,0.000016712924,0.00012949569,0.00011174151,0.000114130715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000845485,0.00010642951,0.00010821434,0.00006992787,0.0001161509,0.000049540195,0.00008991352,0.000030103329,0.000045782177],"category_scores_gemma":[0.0000048480106,0.0001002511,0.000016266913,0.00052924495,0.00026384948,0.00028358802,0.0000014418067,0.00009140501,0.0000069721295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041166106,0.00010139726,0.04151419,0.00037264518,0.000057695725,0.00052052713,0.008833666,0.79250664,0.14135222,0.005578041,0.00007153422,0.009050263],"study_design_scores_gemma":[0.0016417005,0.00019082746,0.8483037,0.0002499044,0.00017285344,0.000079690195,0.001624874,0.10646118,0.037908897,0.00042106194,0.0017956642,0.0011496679],"about_ca_topic_score_codex":0.00000816505,"about_ca_topic_score_gemma":0.00029199687,"teacher_disagreement_score":0.8067895,"about_ca_system_score_codex":0.00002049316,"about_ca_system_score_gemma":0.000085828404,"threshold_uncertainty_score":0.4088121},"labels":[],"label_agreement":null},{"id":"W38009008","doi":"10.1287/trsc.2015.0597","title":"A Dynamic Formulation for Car Ownership Modeling","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Context (archaeology); Computer science; Quality (philosophy); Discrete choice; Consumer choice; Set (abstract data type); Frame (networking); Product (mathematics); Consumer behaviour; Operations research; Mathematical optimization; Microeconomics; Economics; Marketing; Business; Mathematics; Machine learning","score_opus":0.08848845493086999,"score_gpt":0.36053596990500264,"score_spread":0.27204751497413265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38009008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3860602,0.00002254516,0.61085916,0.0005019638,0.00028518136,0.00034750326,0.000021303496,0.00015945327,0.001742669],"genre_scores_gemma":[0.97491264,0.00000745304,0.024488606,0.000073996474,0.000030786945,0.000032233766,0.00012982533,0.000007977888,0.00031648774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856436,0.000019947229,0.00023842692,0.0002559297,0.00064290204,0.00027841376],"domain_scores_gemma":[0.99891394,0.000042608604,0.00008284796,0.000096079944,0.00065791095,0.00020663315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014666136,0.00007504824,0.000085427295,0.00017309524,0.00058190845,0.000084693325,0.00019731809,0.000059528174,0.000009469912],"category_scores_gemma":[0.00015256455,0.000076365715,0.000039933566,0.00078258436,0.00012490143,0.0010620006,5.86487e-7,0.000049311384,0.00000679517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069196896,0.000029156754,0.007931963,0.00001456906,0.0000038212947,8.7419954e-7,0.08489602,0.78508234,0.00043719358,0.119359784,0.000044241704,0.002130861],"study_design_scores_gemma":[0.0011035743,0.0000653727,0.012076385,0.00003226619,0.000039546354,2.2113755e-7,0.016860047,0.95634145,0.00013370812,0.009490435,0.0035278392,0.00032918178],"about_ca_topic_score_codex":0.00043559365,"about_ca_topic_score_gemma":0.0023662797,"teacher_disagreement_score":0.5888524,"about_ca_system_score_codex":0.000120303404,"about_ca_system_score_gemma":0.0006806031,"threshold_uncertainty_score":0.44756278},"labels":[],"label_agreement":null},{"id":"W4200391575","doi":"10.1287/trsc.2021.1101","title":"Vehicle Routing with Stochastic Supply of Crowd Vehicles and Time Windows","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Transport Canada","funders":"","keywords":"Column generation; Heuristic; Vehicle routing problem; Computer science; Crowdsourcing; Operations research; Last mile (transportation); Routing (electronic design automation); Transport engineering; Mathematical optimization; Engineering; Computer network; Mile; Mathematics","score_opus":0.00854635132175214,"score_gpt":0.2179255727113468,"score_spread":0.20937922138959467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200391575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748609,0.000034789733,0.024485465,0.00007246083,0.00002981786,0.000086156324,0.00003962213,0.000088894456,0.0003018703],"genre_scores_gemma":[0.9975323,0.000003643906,0.0023473068,0.000027205966,0.0000051254897,0.0000070763876,0.000029862429,0.000008215276,0.000039261886],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99923027,0.0000040646178,0.00022502663,0.00016265112,0.00024050969,0.00013748673],"domain_scores_gemma":[0.99954873,0.000033651067,0.000031351603,0.00011606577,0.0002147855,0.0000554202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014433512,0.00007345554,0.00010178808,0.00008039197,0.00008175899,0.000023245906,0.00006805921,0.00002167227,0.000056936333],"category_scores_gemma":[0.000010849,0.00007242146,0.000014413088,0.0008347236,0.00023007087,0.00030693787,9.333234e-7,0.00006126969,0.000004078473],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017543378,0.000049877595,0.03608841,0.00008708953,0.000021393895,0.000009758893,0.00502934,0.19364682,0.74883574,0.012920644,0.000011206612,0.0032821535],"study_design_scores_gemma":[0.00044811168,0.000022904002,0.90168846,0.00004941553,0.00002396892,0.000003227046,0.00047818033,0.021660704,0.075340524,0.00011774613,0.00003153139,0.00013524269],"about_ca_topic_score_codex":0.000011729418,"about_ca_topic_score_gemma":0.000076818935,"teacher_disagreement_score":0.86560005,"about_ca_system_score_codex":0.00001163374,"about_ca_system_score_gemma":0.00010281372,"threshold_uncertainty_score":0.29532614},"labels":[],"label_agreement":null},{"id":"W4220659795","doi":"10.1287/trsc.2022.1135","title":"A Branch-and-Price-and-Cut Algorithm for the Vehicle Routing Problem with Two-Dimensional Loading Constraints","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"","keywords":"Vehicle routing problem; Branch and cut; Benchmark (surveying); Mathematical optimization; Relaxation (psychology); Constraint (computer-aided design); Algorithm; Routing (electronic design automation); Mathematics; Computer science; Integer programming","score_opus":0.012942038828167668,"score_gpt":0.2336807899293657,"score_spread":0.22073875110119803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220659795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3306176,0.00018394357,0.6666357,0.00046945963,0.00021718573,0.0008234405,0.00007898203,0.0002570018,0.00071672036],"genre_scores_gemma":[0.979418,0.000004638279,0.020340713,0.00010959362,0.000009650765,0.000061871346,0.000008547838,0.000010556629,0.000036457906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992592,0.0000073928923,0.00013611572,0.00017259695,0.00024970746,0.00017501025],"domain_scores_gemma":[0.9997015,0.00009686301,0.00003491729,0.000063401996,0.000052384006,0.000050951796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048564313,0.00007418099,0.00006850871,0.000056247627,0.00061437336,0.000058315916,0.00009396613,0.000009227875,0.000046410292],"category_scores_gemma":[0.00000402748,0.00005813987,0.000013007066,0.00037855664,0.0002253211,0.00018421074,0.000005190168,0.000093182614,6.0376277e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068199092,0.000007445117,0.0015419088,0.000019822439,0.000011391735,0.0000011090423,0.0032360042,0.95432377,0.003591883,0.0030114036,0.000012404611,0.03423602],"study_design_scores_gemma":[0.0007113235,0.0000398405,0.0053133857,0.000017874001,0.000016593429,0.000014292728,0.0003027909,0.992002,0.0010091305,0.00018904367,0.0002492236,0.00013447976],"about_ca_topic_score_codex":0.000012375204,"about_ca_topic_score_gemma":0.000013462476,"teacher_disagreement_score":0.6488004,"about_ca_system_score_codex":0.000021828993,"about_ca_system_score_gemma":0.00004924793,"threshold_uncertainty_score":0.47253254},"labels":[],"label_agreement":null},{"id":"W4220709268","doi":"10.1287/trsc.2022.1137","title":"No Longer in the Dark: Utilizing Imperfect Advance Load Information for Single-Truck Operators","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Truck; Set (abstract data type); Operations research; Computer science; Imperfect; Perfect information; Stochastic programming; Dynamic programming; Transport engineering; Engineering; Mathematical optimization; Economics; Automotive engineering; Microeconomics; Mathematics","score_opus":0.02268109912109147,"score_gpt":0.24726241065999222,"score_spread":0.22458131153890074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220709268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95085275,0.00004321707,0.0023410497,0.0007919738,0.0012320098,0.0013426713,0.000015191972,0.00009178781,0.04328935],"genre_scores_gemma":[0.99517274,0.0000020152584,0.0001754334,0.0042354353,0.00007661497,0.00021379137,0.000054783064,0.000006023145,0.000063142346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985571,0.000009386694,0.00028599953,0.0002035026,0.00068957143,0.00025447778],"domain_scores_gemma":[0.99947727,0.000030788695,0.000130056,0.00017909365,0.00017466421,0.0000081594535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016433494,0.00009835527,0.00008239283,0.0002598404,0.00059619313,0.00028533852,0.0005066451,0.00001091871,0.00019148424],"category_scores_gemma":[0.000073167714,0.00008240773,0.00004305639,0.0013187047,0.00009317315,0.0039536417,0.000021486998,0.00008603189,0.00004082008],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094054843,0.0010932229,0.18774734,0.0016101801,0.00004077456,0.00004109166,0.040293694,0.09316969,0.03052315,0.5391953,0.021574382,0.08377063],"study_design_scores_gemma":[0.0019744653,0.00009879157,0.08493047,0.000036061523,0.00003733388,0.000001158653,0.020576864,0.026674088,0.00042432718,0.0015650208,0.8631391,0.000542297],"about_ca_topic_score_codex":0.00015313034,"about_ca_topic_score_gemma":0.00011889899,"teacher_disagreement_score":0.8415647,"about_ca_system_score_codex":0.000112804875,"about_ca_system_score_gemma":0.000056872843,"threshold_uncertainty_score":0.4585496},"labels":[],"label_agreement":null},{"id":"W4221122161","doi":"10.1287/trsc.2022.1129","title":"Vehicle Routing with Stochastic Demands and Partial Reoptimization","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Vehicle routing problem; A priori and a posteriori; Context (archaeology); Operations research; Routing (electronic design automation); Stochastic dominance; Mathematics","score_opus":0.011874176218330378,"score_gpt":0.24106467431340253,"score_spread":0.22919049809507216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221122161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45055518,0.000012782107,0.54896975,0.00003185696,0.000060463663,0.00008101761,0.000004805999,0.00015956041,0.00012458317],"genre_scores_gemma":[0.97149897,0.0000020732077,0.028383547,0.000031702184,0.000011788517,0.00002744069,0.0000110232895,0.000015442332,0.00001798685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999034,0.000023873452,0.00017189156,0.00020515583,0.0003744477,0.00019061528],"domain_scores_gemma":[0.9996934,0.000038145885,0.000040889714,0.00010475221,0.000053528147,0.00006930386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006022437,0.00007924337,0.000079663936,0.00011100843,0.00045625243,0.00004563028,0.000112463546,0.000012729276,0.00005392186],"category_scores_gemma":[0.000019063382,0.00008256258,0.000009438196,0.0009190473,0.00011245026,0.00031725172,0.0000060144807,0.00010637832,9.376037e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007931173,0.000004845123,0.0023671354,0.0000054030247,0.000002154872,0.0000013578508,0.0013852029,0.99253726,0.0017351178,0.00075020484,0.0000023096472,0.0012010504],"study_design_scores_gemma":[0.0002935741,0.000040352246,0.017525958,0.0000054099464,0.000011784658,0.0000045437623,0.00031006802,0.9806826,0.00096400036,0.000022318947,0.00002133482,0.00011805851],"about_ca_topic_score_codex":0.000006664756,"about_ca_topic_score_gemma":0.000004428391,"teacher_disagreement_score":0.5209438,"about_ca_system_score_codex":0.000049387694,"about_ca_system_score_gemma":0.000047618305,"threshold_uncertainty_score":0.3509171},"labels":[],"label_agreement":null},{"id":"W4256171839","doi":"10.1287/trsc.2016.0713","title":"<i>Transportation Science</i> Special Issue on Freight Transportation and Logistics, Part II","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Transport engineering; Traffic management; Business; Engineering","score_opus":0.021245683423270875,"score_gpt":0.21890307642361959,"score_spread":0.1976573930003487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256171839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91706866,0.00014745873,0.05978623,0.0005885232,0.0041925795,0.00082153105,0.0016048235,0.00092598906,0.014864179],"genre_scores_gemma":[0.9968501,0.00036440344,0.0012622018,0.00014144689,0.00086285244,0.000024125713,0.00012104513,0.000039396928,0.00033443814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99662185,0.000009012122,0.0006994104,0.0007822613,0.0011829311,0.0007045437],"domain_scores_gemma":[0.99875176,0.00007138435,0.000107072396,0.00037961514,0.00029741236,0.0003927454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000565018,0.00036585756,0.00030614162,0.00042212085,0.00064715097,0.00008407489,0.00047590368,0.00012184157,0.0005179216],"category_scores_gemma":[0.00003051967,0.00029181,0.00007193242,0.0013436237,0.0025275978,0.0011837252,0.0000013687393,0.00018276185,0.00007010325],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005623407,0.00075379794,0.084884755,0.00057895714,0.000116568364,0.00034968485,0.020560807,0.027503652,0.25202808,0.4858283,0.014569364,0.1122637],"study_design_scores_gemma":[0.002571896,0.00055101246,0.73986816,0.0003043102,0.00018917694,0.0000035760954,0.00028531934,0.0011372314,0.0980357,0.0046590897,0.15082096,0.0015735468],"about_ca_topic_score_codex":0.000029037808,"about_ca_topic_score_gemma":0.000587396,"teacher_disagreement_score":0.6549834,"about_ca_system_score_codex":0.00013250925,"about_ca_system_score_gemma":0.00018980794,"threshold_uncertainty_score":0.9999534},"labels":[],"label_agreement":null},{"id":"W4280633481","doi":"10.1287/trsc.2022.1145","title":"Undiscounted Recursive Path Choice Models: Convergence Properties and Algorithms","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Economic and Environmental Valuation","field":"Economics, Econometrics and Finance","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Markov decision process; Mathematical optimization; Operator (biology); Path (computing); Convergence (economics); Bellman equation; Computer science; Mathematics; Algorithm; Markov process","score_opus":0.18600313423915593,"score_gpt":0.2310748304403269,"score_spread":0.04507169620117096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280633481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902573,0.00060002774,0.006992543,0.00026025882,0.00024417715,0.00018598378,0.00014732413,0.000019963361,0.0012923878],"genre_scores_gemma":[0.99855477,0.00014355607,0.0006349803,0.00019868258,0.000011072191,0.00006342702,0.000026057849,0.000007234431,0.00036022192],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99905276,0.000008035032,0.0003014521,0.00038906597,0.00008472312,0.00016395068],"domain_scores_gemma":[0.9996273,0.000011957028,0.00016513835,0.00012577421,0.00001294993,0.00005689938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062642177,0.00007605795,0.000123007,0.00010849298,0.0004176878,0.000035421697,0.00017991682,0.0000144707965,0.0004356189],"category_scores_gemma":[0.000011531627,0.000089410925,0.000023272458,0.0002517754,0.00026089567,0.0008322227,0.000014814286,0.000076451885,0.00004159677],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033257296,0.00017111267,0.5075143,0.000040190906,0.000024781091,0.0000035335,0.017694704,0.055005923,0.0013326549,0.415843,0.00017559259,0.0021609338],"study_design_scores_gemma":[0.00063160935,0.00012729998,0.8116568,0.000008417929,0.000007945878,0.0000031421841,0.0028174645,0.14556605,0.0003531644,0.036009487,0.002450801,0.00036786005],"about_ca_topic_score_codex":0.00042006394,"about_ca_topic_score_gemma":0.000025256222,"teacher_disagreement_score":0.37983352,"about_ca_system_score_codex":0.00014074404,"about_ca_system_score_gemma":0.0000314122,"threshold_uncertainty_score":0.47697213},"labels":[],"label_agreement":null},{"id":"W4281745214","doi":"10.1287/trsc.2022.1150","title":"Two-Level Capacitated Discrete Location with Concave Costs","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Transshipment (information security); Preprocessor; Computer science; Linear programming; Sensitivity (control systems); Nonlinear system; Facility location problem; Routing (electronic design automation); Binary number; Mathematics; Operations research; Engineering","score_opus":0.03565401904833083,"score_gpt":0.2535051113669228,"score_spread":0.21785109231859195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281745214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9558004,0.0000147487535,0.02766604,0.0018548314,0.0005040315,0.00057241943,0.000029459714,0.00020417852,0.013353883],"genre_scores_gemma":[0.9974333,0.0000010783057,0.00039101674,0.0013614611,0.000037129365,0.000093868846,0.0001907341,0.000008925946,0.00048249573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983356,0.000007911482,0.00024051829,0.00035446597,0.00082838896,0.00023310189],"domain_scores_gemma":[0.9993025,0.000007030474,0.00008812365,0.00021237107,0.00037064927,0.000019340087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064917357,0.00011039928,0.00008790909,0.00028343176,0.00074827357,0.000120439654,0.00033212992,0.000007819506,0.0008381867],"category_scores_gemma":[0.000021242466,0.00010318478,0.00002198809,0.0025106322,0.000224567,0.0014335606,0.000017316775,0.00008847325,0.0001187579],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029710235,0.00029330087,0.072175525,0.00022647991,0.000040719482,0.000021763795,0.0030584508,0.39379814,0.0049619693,0.5139497,0.0016087058,0.009568132],"study_design_scores_gemma":[0.0020034728,0.000064376305,0.8808643,0.000027710576,0.000087385255,0.0000014313157,0.009621894,0.08147463,0.00035529333,0.000912297,0.023888439,0.00069877633],"about_ca_topic_score_codex":0.0036026705,"about_ca_topic_score_gemma":0.0038590298,"teacher_disagreement_score":0.80868876,"about_ca_system_score_codex":0.000108634486,"about_ca_system_score_gemma":0.00008525298,"threshold_uncertainty_score":0.91775566},"labels":[],"label_agreement":null},{"id":"W4297628801","doi":"10.1287/trsc.2022.0342","title":"Solving a Continent-Scale Inventory Routing Problem at Renault","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scale (ratio); Context (archaeology); Routing (electronic design automation); Benchmark (surveying); Heuristic; Commodity; Morse code; Relaxation (psychology); Operations research; Mathematical optimization; Artificial intelligence; Mathematics; Computer network; Business; Telecommunications; Geography","score_opus":0.02124898207473498,"score_gpt":0.2729537527922278,"score_spread":0.2517047707174928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297628801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92866206,0.000020251397,0.066626415,0.00011557137,0.0003011529,0.00018436932,0.000007990707,0.0014746014,0.002607596],"genre_scores_gemma":[0.9668825,0.000020253607,0.03240966,0.000031567113,0.000029565832,0.000021835076,0.000026540716,0.00002688627,0.00055117114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998543,0.00001990175,0.00033174278,0.00027458096,0.000442632,0.0003881441],"domain_scores_gemma":[0.9994932,0.000049666327,0.000058244845,0.00017794246,0.0001084105,0.00011257221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012059066,0.000112686444,0.00011964267,0.0002241642,0.00027497608,0.00005581412,0.00023177691,0.00004270264,0.000048967555],"category_scores_gemma":[0.0000506336,0.00012289471,0.000039509923,0.0018855189,0.00013401968,0.00041755242,0.000009405653,0.000100025754,0.00010320518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003882823,0.0000072951416,0.05298446,0.00007097539,0.000005762315,0.0000063660523,0.007329731,0.7950415,0.1406219,0.0005389781,0.00032531578,0.0030638056],"study_design_scores_gemma":[0.00033097217,0.000010315117,0.12802163,0.0000707367,0.000011583776,0.0000018003068,0.00034332398,0.8437167,0.026266823,0.00010667449,0.0008552808,0.00026415472],"about_ca_topic_score_codex":0.000013172148,"about_ca_topic_score_gemma":0.00005839795,"teacher_disagreement_score":0.11435507,"about_ca_system_score_codex":0.000103337596,"about_ca_system_score_gemma":0.000045125365,"threshold_uncertainty_score":0.5011501},"labels":[],"label_agreement":null},{"id":"W4310251926","doi":"10.1287/trsc.2022.1185","title":"Constrained Local Search for Last-Mile Routing","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mile; Routing (electronic design automation); Last mile (transportation); Transport engineering; Computer science; Local search (optimization); Mathematical optimization; Operations research; Engineering; Computer network; Mathematics; Geography; Algorithm","score_opus":0.028058050547799737,"score_gpt":0.30090013077915523,"score_spread":0.2728420802313555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310251926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15930554,0.00000865557,0.8390584,0.000050848288,0.00019969913,0.00018813291,0.00004978185,0.00023127228,0.0009076481],"genre_scores_gemma":[0.9335795,9.173465e-7,0.06622097,0.000047665,0.000015182489,0.000052790718,0.00002672914,0.000014939252,0.000041325013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989082,0.00002276123,0.0002071537,0.00019548209,0.0003963135,0.00027009577],"domain_scores_gemma":[0.99959636,0.00010565914,0.000022958178,0.000110575274,0.00009441892,0.00007001244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013324484,0.000070346905,0.00008384479,0.00012482551,0.00044404654,0.000030778938,0.0002248536,0.00001490048,0.00014966307],"category_scores_gemma":[0.00002188413,0.00008408323,0.000032363456,0.0008938315,0.00018208903,0.00018312554,0.0000053109748,0.0001155038,0.0000031905977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041026833,0.0000060023144,0.0008251551,0.0000124367425,0.0000020768841,9.1152737e-7,0.001279935,0.975687,0.009026364,0.0033436506,0.000020015399,0.009792339],"study_design_scores_gemma":[0.00036680838,0.00003402798,0.006614857,0.000003848823,0.0000058481837,0.0000024421056,0.0015073667,0.97650605,0.014191872,0.00006259383,0.0005706397,0.00013361215],"about_ca_topic_score_codex":0.000006333208,"about_ca_topic_score_gemma":0.0000061134183,"teacher_disagreement_score":0.77427393,"about_ca_system_score_codex":0.00009340187,"about_ca_system_score_gemma":0.00012218821,"threshold_uncertainty_score":0.34288144},"labels":[],"label_agreement":null},{"id":"W4318224794","doi":"10.1287/trsc.2023.1197","title":"In Memoriam: Bernard Gendron,1966–2022","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Download; Library science; Management; Economics; Computer science; World Wide Web","score_opus":0.03042451283329796,"score_gpt":0.34480658009101944,"score_spread":0.3143820672577215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318224794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98199874,0.000022218708,0.0016812201,0.003332828,0.0021739686,0.0002794497,0.000030686482,0.00039987013,0.010081022],"genre_scores_gemma":[0.9963207,0.00015820023,0.0007385615,0.00017455446,0.000117985604,0.000023366732,0.00006540008,0.000008349591,0.0023928604],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980509,0.00004121197,0.00028159583,0.00032833684,0.00090288563,0.00039506823],"domain_scores_gemma":[0.99946624,0.00006701777,0.00007534969,0.00012414897,0.00013588447,0.00013135541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016520096,0.00008035137,0.00010139606,0.0004863067,0.00052289857,0.00006707757,0.00031759392,0.00005474581,0.0003239709],"category_scores_gemma":[0.000079597376,0.00008966598,0.000033663004,0.004520275,0.00040055788,0.00100657,0.0000015242596,0.00009783204,0.00018862002],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007090751,0.00012658372,0.4160204,0.00004041014,0.000009724602,0.00020185293,0.28511685,0.072016425,0.0038729843,0.20946547,0.00900446,0.0040539396],"study_design_scores_gemma":[0.00048675938,0.000020057712,0.939397,0.000022048518,0.000009003617,3.0019527e-7,0.008242411,0.0012466807,0.00049222447,0.0020185502,0.04781385,0.00025115343],"about_ca_topic_score_codex":0.0011762244,"about_ca_topic_score_gemma":0.0056942217,"teacher_disagreement_score":0.5233766,"about_ca_system_score_codex":0.00007280846,"about_ca_system_score_gemma":0.0004104251,"threshold_uncertainty_score":0.40217662},"labels":[],"label_agreement":null},{"id":"W4323357131","doi":"10.1287/trsc.2023.1199","title":"Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Computer science; Scalability; Scheduling (production processes); Context (archaeology); Operations research; Heuristic; Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Mathematics","score_opus":0.03936776487769003,"score_gpt":0.2945584043615546,"score_spread":0.25519063948386456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323357131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82970554,0.000077261146,0.16872898,0.00009608819,0.00020964291,0.00013959524,0.0000070514598,0.0006458795,0.00038994465],"genre_scores_gemma":[0.9320843,0.00018675222,0.06744657,0.00005816955,0.00004544012,0.000019131738,0.000030012387,0.000021420281,0.00010818066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987878,0.000022731036,0.0002545612,0.00028775612,0.00033242235,0.0003146886],"domain_scores_gemma":[0.99958307,0.000046515746,0.000037766004,0.0001476713,0.00011007425,0.00007492977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973244,0.00010302488,0.00011048116,0.00018280903,0.0002958283,0.00011262663,0.00013502364,0.00005374354,0.000022532668],"category_scores_gemma":[0.000067767134,0.000118409705,0.000019050985,0.0029526216,0.00006959825,0.000867491,0.0000037218738,0.00010626477,0.0000397165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018260982,0.0000046735313,0.0038958145,0.000022846638,0.0000036964873,0.0000018715199,0.0010886632,0.58778405,0.40184775,0.0012625864,0.00006869899,0.004017514],"study_design_scores_gemma":[0.00018690225,0.000011916977,0.024243046,0.0000113881415,0.000007754768,8.758753e-7,0.0000627891,0.90172714,0.07325912,0.00016883647,0.00018298111,0.00013726298],"about_ca_topic_score_codex":0.000022733324,"about_ca_topic_score_gemma":0.00002088689,"teacher_disagreement_score":0.32858863,"about_ca_system_score_codex":0.0000611415,"about_ca_system_score_gemma":0.000060649792,"threshold_uncertainty_score":0.48286077},"labels":[],"label_agreement":null},{"id":"W4380877068","doi":"10.1287/trsc.2021.0494","title":"Charging Station Location and Sizing for Electric Vehicles Under Congestion","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sizing; Bilevel optimization; Queue; Mathematical optimization; Charging station; Probabilistic logic; Computer science; Location model; Benchmark (surveying); Service (business); Electric vehicle; Queueing theory; Operations research; Optimization problem; Engineering; Computer network; Mathematics; Power (physics)","score_opus":0.013629978300084179,"score_gpt":0.24529126059885817,"score_spread":0.231661282298774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380877068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90711296,0.0001019147,0.09214065,0.00011514196,0.000074931864,0.00016074118,0.0000057844363,0.00025543923,0.000032426437],"genre_scores_gemma":[0.9990942,0.00011376279,0.0006450039,0.000033803535,0.000024477795,0.00002158036,0.00004203788,0.000010401786,0.000014758187],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993657,0.0000033042481,0.00013032788,0.00014811062,0.00016136454,0.00019122049],"domain_scores_gemma":[0.9997319,0.000046840378,0.000024882142,0.00005086986,0.00010430348,0.000041187646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000244074,0.00006469906,0.000057335925,0.00020950657,0.0001609455,0.00004698514,0.00005611168,0.00002976835,0.0000023743826],"category_scores_gemma":[0.000015689036,0.00006703549,0.000010279017,0.0013955513,0.000035588662,0.0004235019,7.3333564e-7,0.00004987701,0.0000037184961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077316545,0.0000030198169,0.002106837,0.00011712864,0.0000056528525,4.3024474e-7,0.0012819995,0.23893625,0.6729551,0.015086409,0.00009260989,0.06940684],"study_design_scores_gemma":[0.00018631511,0.000023897208,0.4918696,0.000014836413,0.000008244914,7.1013295e-7,0.00016532184,0.47211382,0.03263874,0.0027974285,0.000081534854,0.00009956022],"about_ca_topic_score_codex":0.0000073913957,"about_ca_topic_score_gemma":0.000013280119,"teacher_disagreement_score":0.64031637,"about_ca_system_score_codex":0.000039824685,"about_ca_system_score_gemma":0.000035202545,"threshold_uncertainty_score":0.2733628},"labels":[],"label_agreement":null},{"id":"W4380882365","doi":"10.1287/trsc.2022.0112","title":"Hub Network Design Problem with Capacity, Congestion, and Stochastic Demand Considerations","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Column generation; Mathematical optimization; Computer science; Routing (electronic design automation); Exploit; Network planning and design; Operations research; Engineering; Mathematics; Computer network","score_opus":0.043050717474767894,"score_gpt":0.2641178654701955,"score_spread":0.2210671479954276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380882365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12989047,0.000016193282,0.86910886,0.00011071186,0.00006356606,0.00024922387,0.0000049356668,0.0004626605,0.00009336956],"genre_scores_gemma":[0.7476354,0.000007503603,0.25226268,0.000023018418,0.000013514685,0.000025963986,0.0000052838936,0.000011586778,0.000015006976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991127,0.000030429872,0.00018166314,0.00019974222,0.00024385852,0.00023156691],"domain_scores_gemma":[0.9994095,0.00021926747,0.000031930227,0.000100946585,0.00014565398,0.000092722825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009124646,0.000093636205,0.00009564178,0.00012136044,0.00030703304,0.00008834074,0.00006081256,0.000030180781,0.000015821615],"category_scores_gemma":[0.000051341325,0.000089223126,0.000007517337,0.0011744829,0.00027323197,0.00033694055,0.000001989437,0.00007659585,0.000008558522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001983444,0.0000018719768,0.0011028451,0.00001690028,0.0000032697233,0.0000018502092,0.0009796154,0.9932308,0.0010234148,0.0034078849,0.000078259036,0.0001512952],"study_design_scores_gemma":[0.0003539031,0.00003962128,0.09124678,0.000061489445,0.000028406925,0.000011769215,0.000091277354,0.9024377,0.00082767,0.0046734563,0.000010716983,0.00021720897],"about_ca_topic_score_codex":0.0000049309037,"about_ca_topic_score_gemma":0.000039508363,"teacher_disagreement_score":0.617745,"about_ca_system_score_codex":0.000018365805,"about_ca_system_score_gemma":0.00007032459,"threshold_uncertainty_score":0.36384135},"labels":[],"label_agreement":null},{"id":"W4385349667","doi":"10.1287/trsc.2022.0271","title":"An Iterated Local Search Metaheuristic for the Capacitated Demand-Driven Timetabling Problem","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Iterated local search; Train; Mathematical optimization; Public transport; Computer science; Metaheuristic; Iterated function; Scheduling (production processes); Local search (optimization); Integer programming; Moment (physics); Operations research; Transport engineering; Engineering; Mathematics","score_opus":0.02547928558253623,"score_gpt":0.2717124748811242,"score_spread":0.24623318929858798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385349667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50168765,0.000050640767,0.49722964,0.00004256685,0.00020250755,0.00026341464,0.000024278525,0.00037257661,0.00012671606],"genre_scores_gemma":[0.99829996,0.000014788587,0.0014178074,0.00001071479,0.000031500735,0.00007213667,0.000045961566,0.000017565662,0.00008956937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881124,0.000014746316,0.00024586212,0.00022621731,0.00035375063,0.0003481991],"domain_scores_gemma":[0.9994388,0.000097912205,0.000020902762,0.00018061003,0.00017243427,0.00008931631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009628002,0.000100001256,0.000110388246,0.00018936775,0.0003567867,0.000104977466,0.00031413368,0.000030262305,0.0000146479815],"category_scores_gemma":[0.000010827985,0.00007159429,0.000036272097,0.0019679782,0.00018964213,0.00036513445,0.0000014063395,0.00007328799,0.000031921925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032110524,0.0000055713926,0.0000941607,0.000031062827,0.0000075172043,0.0000018616211,0.001969254,0.95334715,0.04120037,0.0010742927,0.000036086007,0.0022294421],"study_design_scores_gemma":[0.0001535189,0.000030118728,0.013434026,0.000014599534,0.000015706282,0.0000011094689,0.00045465215,0.98056614,0.004721422,0.000052679738,0.0004496159,0.000106406354],"about_ca_topic_score_codex":0.00008456511,"about_ca_topic_score_gemma":0.00009176216,"teacher_disagreement_score":0.49661228,"about_ca_system_score_codex":0.000024168914,"about_ca_system_score_gemma":0.00005733088,"threshold_uncertainty_score":0.29195303},"labels":[],"label_agreement":null},{"id":"W4385749309","doi":"10.1287/trsc.2021.0110","title":"Iterative Backpropagation Method for Efficient Gradient Estimation in Bilevel Network Equilibrium Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Computer science; Backpropagation; Optimization problem; Iterative method; Iterative and incremental development; Matching (statistics); Mathematics; Artificial neural network; Artificial intelligence; Statistics","score_opus":0.04052427478692713,"score_gpt":0.34987745305525914,"score_spread":0.30935317826833203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385749309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06610831,0.000012893304,0.93034947,0.00078967767,0.0006122825,0.0013419379,0.00004475809,0.0003151005,0.00042557265],"genre_scores_gemma":[0.74232644,0.00002107374,0.25613037,0.00007385935,0.00006221971,0.0002947686,0.0007753374,0.000019159825,0.00029679158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974515,0.000117991774,0.0005639714,0.00053406757,0.000776567,0.000555908],"domain_scores_gemma":[0.99872166,0.00027300834,0.00023890527,0.0001388593,0.0004948908,0.00013265893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036915673,0.00014949334,0.00017663462,0.00054476445,0.00072261674,0.000163233,0.0002403509,0.00009279766,0.00003448685],"category_scores_gemma":[0.00022822926,0.00015837951,0.000056614917,0.0049728053,0.0002622108,0.0008375981,0.0000027069839,0.00008921209,0.000012834435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022762059,0.00003074461,0.003338489,0.000024151963,0.000002530207,8.8095953e-7,0.021975497,0.96038496,0.00024674193,0.012177505,0.000074996584,0.0017207372],"study_design_scores_gemma":[0.0005126283,0.000042050247,0.038664825,0.000074162424,0.00001420701,1.3336268e-7,0.0010552651,0.9573845,0.00019953545,0.001536187,0.00032234465,0.000194131],"about_ca_topic_score_codex":0.00023475842,"about_ca_topic_score_gemma":0.0008548938,"teacher_disagreement_score":0.6762181,"about_ca_system_score_codex":0.00016594751,"about_ca_system_score_gemma":0.00042638564,"threshold_uncertainty_score":0.6458529},"labels":[],"label_agreement":null},{"id":"W4385877360","doi":"10.1287/trsc.2022.0261","title":"A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval; Transport Canada","funders":"","keywords":"Branch and cut; Benchmark (surveying); Mathematical optimization; Computer science; Branch and bound; Routing (electronic design automation); Production (economics); Heuristic; Time horizon; Algorithm; Vendor-managed inventory; Integer programming; Supply chain; Mathematics; Supply chain management","score_opus":0.03466089813080044,"score_gpt":0.2828480735673259,"score_spread":0.24818717543652544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385877360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24473163,0.000059364927,0.75410116,0.00011510805,0.00021574307,0.00035423966,0.0000065703603,0.00038459193,0.000031587042],"genre_scores_gemma":[0.77697265,0.00007702914,0.22264051,0.000018220488,0.00005922757,0.000103459046,0.000018252576,0.000024576417,0.00008609193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990775,0.000007732501,0.00020884725,0.00027786146,0.00020314803,0.00022490321],"domain_scores_gemma":[0.99967957,0.000032531065,0.0000376613,0.00009805255,0.0000825895,0.00006961957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010401721,0.000090291804,0.000098385346,0.00014646318,0.00019908066,0.00004620663,0.000076964185,0.00003320471,0.0000027546018],"category_scores_gemma":[0.00006823888,0.000094753894,0.000016884498,0.00053307525,0.00016422938,0.0003987287,0.0000034737552,0.000060815888,0.0000029617906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057252605,0.000012188383,0.017270647,0.00025951592,0.000015133305,9.858452e-7,0.010449426,0.77056783,0.01633618,0.0009793601,0.00012588206,0.1839771],"study_design_scores_gemma":[0.00019165651,0.000015327207,0.06038183,0.000039056053,0.00001017272,0.0000014821534,0.00012848689,0.93703014,0.0012128137,0.00077504735,0.0000883387,0.00012567759],"about_ca_topic_score_codex":0.0000140090615,"about_ca_topic_score_gemma":0.000094917086,"teacher_disagreement_score":0.532241,"about_ca_system_score_codex":0.000025381325,"about_ca_system_score_gemma":0.000028974557,"threshold_uncertainty_score":0.38639516},"labels":[],"label_agreement":null},{"id":"W4387496398","doi":"10.1287/trsc.2022.0214","title":"Probabilistic Forecasting of Bus Travel Time with a Bayesian Gaussian Mixture Model","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; McGill University","funders":"","keywords":"Computer science; Probabilistic logic; Markov chain Monte Carlo; Headway; Bayesian probability; Mixture model; Scheduling (production processes); Markov chain; Simulation; Mathematical optimization; Machine learning; Mathematics; Artificial intelligence","score_opus":0.03117630804305867,"score_gpt":0.28221276323373595,"score_spread":0.2510364551906773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387496398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83460957,0.00000964324,0.14787862,0.0008951286,0.000098511104,0.0006338805,0.00011552953,0.0003620348,0.015397093],"genre_scores_gemma":[0.9917547,0.000006243628,0.007207797,0.000028208546,0.00001620091,0.000016704307,0.00008666951,0.00001043746,0.0008730091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823904,0.000022866288,0.0002861972,0.00030381107,0.00082441274,0.00032365049],"domain_scores_gemma":[0.9992082,0.00006976809,0.00015644732,0.00012291012,0.00030486862,0.00013779428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007807923,0.00010020353,0.00014180898,0.0002590052,0.0005124094,0.000044155375,0.000245937,0.000056681743,0.00005756612],"category_scores_gemma":[0.00007708048,0.00008906964,0.00003397733,0.002740253,0.00068482035,0.0005097749,9.732054e-7,0.00007558928,0.000008652184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055650176,0.000042270603,0.005793472,0.000049338058,0.000006801145,0.000011832097,0.08282312,0.88201845,0.0023028865,0.02563492,0.00007022013,0.0011910272],"study_design_scores_gemma":[0.00078613235,0.00012554285,0.11459652,0.00022328127,0.000076039505,0.0000013587676,0.008063977,0.8698151,0.0014056579,0.0043258914,0.000118395605,0.00046206592],"about_ca_topic_score_codex":0.00020497687,"about_ca_topic_score_gemma":0.000985662,"teacher_disagreement_score":0.15714517,"about_ca_system_score_codex":0.00003101453,"about_ca_system_score_gemma":0.0005362595,"threshold_uncertainty_score":0.39410904},"labels":[],"label_agreement":null},{"id":"W4392284704","doi":"10.1287/trsc.2022.0323","title":"Crowdkeeping in Last-Mile Delivery","year":2024,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mile; Operations research; Flexibility (engineering); Computer science; Linear programming; Integer (computer science); Last mile (transportation); Transport engineering; Engineering; Economics; Operating system; Algorithm","score_opus":0.017977736551499052,"score_gpt":0.22104832014671807,"score_spread":0.203070583595219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392284704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9223937,0.0010641917,0.06578493,0.000031122156,0.00085068843,0.0001036385,0.00003146857,0.0006026413,0.009137611],"genre_scores_gemma":[0.9985543,0.00009178877,0.0012193351,0.000024456993,0.000024508658,0.000006424222,0.000012667825,0.000011480498,0.000055033273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99922633,0.0000019923675,0.0001846911,0.00017638161,0.00020444662,0.000206129],"domain_scores_gemma":[0.9998081,0.00002339169,0.0000046645455,0.000086276516,0.00002260688,0.00005498949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017412956,0.00007618303,0.000071568356,0.00022861751,0.00003532024,0.00005211887,0.0001351872,0.000028939163,0.00007016808],"category_scores_gemma":[0.00000289362,0.000077999866,0.000025231058,0.000972247,0.00013857335,0.00039265916,6.5284615e-7,0.00011188826,0.0000626292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000219858,0.00009692348,0.08386742,0.0012576121,0.00004017728,0.0012713991,0.019418158,0.45597222,0.24645245,0.13781554,0.0012525924,0.052533515],"study_design_scores_gemma":[0.0003041103,0.000028698125,0.60987467,0.00025645376,0.000024617028,0.0000044030908,0.00021952912,0.35741314,0.012581208,0.0015255088,0.017241735,0.0005259426],"about_ca_topic_score_codex":0.000020524054,"about_ca_topic_score_gemma":0.00037307572,"teacher_disagreement_score":0.52600724,"about_ca_system_score_codex":0.00004779204,"about_ca_system_score_gemma":0.000054342672,"threshold_uncertainty_score":0.31807423},"labels":[],"label_agreement":null},{"id":"W4392296454","doi":"10.1287/trsc.2023.0247","title":"Modeling and Solving the Traveling Salesman Problem with Speed Optimization for a Plug-In Hybrid Electric Vehicle","year":2024,"lang":"en","type":"article","venue":"Transportation Science","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Benchmark (surveying); Discretization; Nonlinear system; Computer science; Integer programming; Nonlinear programming; Energy consumption; Optimization problem; Engineering; Mathematics; Electrical engineering","score_opus":0.00708887064662942,"score_gpt":0.20908548067234992,"score_spread":0.2019966100257205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392296454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6213545,0.00028936157,0.37795827,0.000058581238,0.000023378987,0.00018816619,0.0000022762395,0.00007837583,0.000047068886],"genre_scores_gemma":[0.99126655,0.00006900088,0.008585007,0.000017638478,0.000021192956,0.000013811567,0.000005741554,0.00001602962,0.0000050479307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992618,0.000003251378,0.00016140028,0.000195305,0.0001603002,0.00021793167],"domain_scores_gemma":[0.999826,0.000028079681,0.0000104259725,0.00005969989,0.000043531734,0.000032252443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026463676,0.000084660736,0.00007123952,0.00011614198,0.0001237804,0.00012426819,0.0000954709,0.000018966577,0.0000033238048],"category_scores_gemma":[0.0000036802828,0.000060528662,0.000014530777,0.0008337636,0.000033914836,0.00039655282,8.98267e-7,0.00011270925,2.2996198e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005251993,0.0000014780582,0.00018644266,0.000058928093,0.0000029077182,0.0000016049412,0.0006991233,0.980445,0.0123416595,0.00067264895,0.0000017801916,0.0055831275],"study_design_scores_gemma":[0.00015001575,0.000027286138,0.0012988697,0.00005825625,0.000011198298,0.0000048557486,0.000054429933,0.99394584,0.0038992562,0.00045064167,0.0000087653325,0.00009056885],"about_ca_topic_score_codex":0.000019458308,"about_ca_topic_score_gemma":0.00005545675,"teacher_disagreement_score":0.369912,"about_ca_system_score_codex":0.000038950817,"about_ca_system_score_gemma":0.00006159652,"threshold_uncertainty_score":0.24682873},"labels":[],"label_agreement":null},{"id":"W4396871741","doi":"10.1287/trsc.2023.0120","title":"Dynamic Home Care Routing and Scheduling with Uncertain Number of Visits per Referral","year":2024,"lang":"en","type":"article","venue":"Transportation Science","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Scheduling (production processes); Referral; Routing (electronic design automation); Operations research; Computer science; Medicine; Operations management; Medical emergency; Computer network; Engineering; Nursing","score_opus":0.0434525070552426,"score_gpt":0.4333166064772511,"score_spread":0.3898640994220085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396871741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96940607,0.00016981119,0.028772311,0.00050515286,0.00018445218,0.0002848854,0.000026674063,0.00007468408,0.00057598157],"genre_scores_gemma":[0.9628853,0.000041864078,0.036738012,0.00008064151,0.000017820574,0.00002230811,0.000049976094,0.000013057476,0.00015100073],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986779,0.000054767635,0.000367366,0.00031659933,0.00032853757,0.00025480476],"domain_scores_gemma":[0.9991418,0.00009056915,0.000069140406,0.00012446415,0.0004764774,0.00009752802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006339186,0.000090346606,0.00013113057,0.00012367863,0.00068758824,0.000035878307,0.000083646686,0.00006832761,0.00010335718],"category_scores_gemma":[0.000028967992,0.00007070227,0.000016039827,0.0007465521,0.00013130797,0.00048769117,0.00000426597,0.0002443271,0.000016331323],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009596803,0.0000323535,0.6306263,0.0026625826,0.000023115517,0.000018763403,0.21773829,0.059123196,0.007940251,0.06936412,0.000006694841,0.012368355],"study_design_scores_gemma":[0.0007688133,0.00013274974,0.64676714,0.0022182923,0.000056338566,0.0000067090346,0.046717923,0.30231646,0.0001382483,0.0002549696,0.00022004567,0.00040228904],"about_ca_topic_score_codex":0.00028089384,"about_ca_topic_score_gemma":0.0006731402,"teacher_disagreement_score":0.24319327,"about_ca_system_score_codex":0.00009599769,"about_ca_system_score_gemma":0.0009596782,"threshold_uncertainty_score":0.52884424},"labels":[],"label_agreement":null},{"id":"W4399497615","doi":"10.1287/trsc.2023.0110","title":"A Sampling Strategy for High-Dimensional, Simulation-Based Transportation Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Sampling (signal processing); Mathematical optimization; Computer science; Optimization problem; Sampling distribution; Bayesian optimization; Probability distribution; Importance sampling; Data mining; Algorithm; Mathematics; Statistics; Monte Carlo method","score_opus":0.06460351217906143,"score_gpt":0.36020488523953004,"score_spread":0.29560137306046863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399497615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062174905,0.00012549991,0.9343687,0.00071000797,0.0006142298,0.0009424141,0.0002722401,0.00061686535,0.00017510781],"genre_scores_gemma":[0.95627797,0.000018271669,0.041568466,0.00012581884,0.0001103269,0.00013201317,0.0015447091,0.00003132444,0.00019109588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727607,0.000041368174,0.00058326364,0.0006560165,0.0010021153,0.00044119137],"domain_scores_gemma":[0.9982129,0.0005768581,0.00014309143,0.00015105808,0.0007277113,0.00018842111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012865207,0.00019621172,0.00017670423,0.0004858492,0.0011649991,0.00039594612,0.00024134548,0.0001322556,0.00022323694],"category_scores_gemma":[0.000113093876,0.00020802784,0.00009905347,0.0020514682,0.00042924462,0.0015388426,4.323932e-7,0.0001214351,0.000011432519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032652173,0.00003636222,0.0004840324,0.000083934836,0.000007859342,0.0000017240535,0.0056667444,0.964087,0.000269215,0.027442193,0.000020576686,0.0018676897],"study_design_scores_gemma":[0.00053387857,0.000079561294,0.009907897,0.00018123319,0.00008249267,6.391125e-8,0.0005961695,0.98398185,0.00027670604,0.0015543943,0.002454796,0.0003509453],"about_ca_topic_score_codex":0.0006307311,"about_ca_topic_score_gemma":0.001460291,"teacher_disagreement_score":0.89410305,"about_ca_system_score_codex":0.00012986753,"about_ca_system_score_gemma":0.0012022351,"threshold_uncertainty_score":0.8960349},"labels":[],"label_agreement":null},{"id":"W4401266817","doi":"10.1287/trsc.2024.intro.v58.n4","title":"Special Section on “DIMACS Implementation Challenge: Vehicle Routing” and “The EURO Meets NeurIPS 2022 Vehicle Routing Competition”","year":2024,"lang":"en","type":"article","venue":"Transportation Science","topic":"E-commerce and Technology Innovations","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Routing (electronic design automation); Section (typography); Competition (biology); Computer science; Operations research; Transport engineering; Computer network; Engineering","score_opus":0.022182990364528987,"score_gpt":0.2772637986917995,"score_spread":0.25508080832727054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401266817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95855844,0.00003310178,0.00058269117,0.029808817,0.0017743049,0.00036110714,0.000013336749,0.0003351894,0.008533026],"genre_scores_gemma":[0.9964166,0.000023349101,0.00003834928,0.0013979463,0.0019426965,0.000028701555,0.00006833204,0.0000140947095,0.00006990257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99861145,0.0000133341,0.00033199086,0.00038830325,0.00040980367,0.0002451321],"domain_scores_gemma":[0.99947006,0.000072587216,0.00012859942,0.0001562816,0.00016118199,0.00001128595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009965084,0.00012845111,0.00011006515,0.00035547724,0.0009003778,0.00041098372,0.00020928797,0.000044282413,0.00022261978],"category_scores_gemma":[0.000042163796,0.000108631895,0.00003975579,0.0018136178,0.00048652745,0.001452209,0.00001947228,0.00024999055,0.00007701858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026878442,0.00003075155,0.004255806,0.000034602373,0.000008513197,0.000007312619,0.0007331459,0.000055368622,0.0024088703,0.9759953,0.0013052061,0.015138255],"study_design_scores_gemma":[0.00567862,0.00015765824,0.65529156,0.0003061896,0.000302196,0.00001148109,0.0127000995,0.051891033,0.003692719,0.029363424,0.23948896,0.0011160604],"about_ca_topic_score_codex":0.00026169876,"about_ca_topic_score_gemma":0.0007557749,"teacher_disagreement_score":0.94663185,"about_ca_system_score_codex":0.000036705707,"about_ca_system_score_gemma":0.000038180948,"threshold_uncertainty_score":0.6925069},"labels":[],"label_agreement":null},{"id":"W4401515398","doi":"10.1287/trsc.2023.0252","title":"A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems","year":2024,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Compartment (ship); Benchmark (surveying); Computer science; Flexibility (engineering); Branch and cut; Pickup; Mathematical optimization; Running time; Algorithm; Operations research; Mathematics; Integer programming; Artificial intelligence; Statistics","score_opus":0.026585570824390187,"score_gpt":0.2830538029403578,"score_spread":0.25646823211596764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401515398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20175532,0.00038604767,0.7970058,0.00005443264,0.0001784008,0.0002696694,0.000021662961,0.00025433194,0.00007438329],"genre_scores_gemma":[0.7371734,0.00009228354,0.2625998,0.000020151894,0.000015628075,0.00003674361,0.000009325773,0.0000125489005,0.000040140763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992442,0.000007455666,0.00018097379,0.0002340355,0.00016155436,0.00017179562],"domain_scores_gemma":[0.99968404,0.00009028125,0.000014021253,0.00007366413,0.00005886632,0.000079125406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044533904,0.000088514666,0.00009111927,0.00012354934,0.00010040993,0.00010680586,0.000069021306,0.00002676451,0.000006978582],"category_scores_gemma":[0.000008871854,0.000085910695,0.000017563907,0.00039177938,0.00010952747,0.00032783582,0.000002373136,0.000054858072,0.00000220874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000652226,0.000025844953,0.00090177695,0.00068125717,0.00003862545,0.0000046837417,0.009960654,0.40156275,0.041494306,0.004845442,0.000060129543,0.54041797],"study_design_scores_gemma":[0.00023070858,0.000017928447,0.008484312,0.000045630924,0.000017154958,0.0000018597088,0.00004863386,0.9858733,0.003959372,0.00031521491,0.0008904115,0.00011548746],"about_ca_topic_score_codex":0.000008704054,"about_ca_topic_score_gemma":0.0000107578935,"teacher_disagreement_score":0.58431053,"about_ca_system_score_codex":0.00002931404,"about_ca_system_score_gemma":0.00003687424,"threshold_uncertainty_score":0.35033366},"labels":[],"label_agreement":null},{"id":"W4401979611","doi":"10.1287/trsc.2022.0418","title":"Heatmap Design for Probabilistic Driver Repositioning in Crowdsourced Delivery","year":2024,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Probabilistic logic; Crowdsourcing; Computer science; Transport engineering; Engineering; Artificial intelligence; World Wide Web","score_opus":0.025921696902829673,"score_gpt":0.26634226731243993,"score_spread":0.24042057040961026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401979611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5574239,0.000060199818,0.44120148,0.000081954444,0.00023380101,0.0004226117,0.000027125092,0.00034856555,0.00020035304],"genre_scores_gemma":[0.9878504,0.000006963037,0.011795898,0.00003451616,0.000014582901,0.00017492128,0.000052667743,0.000014024129,0.000055989443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903226,0.000005465898,0.00032504674,0.00025105017,0.0001881058,0.00019808895],"domain_scores_gemma":[0.99962044,0.00009515447,0.000012530036,0.000110122586,0.00011451605,0.00004721556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003990926,0.00009156447,0.00008518498,0.00029417916,0.00009993898,0.00008508545,0.000101982376,0.000035146313,0.000034396646],"category_scores_gemma":[0.000016809458,0.00009780831,0.00003695273,0.0012623031,0.00012131567,0.00051136926,4.4785972e-7,0.000081407416,0.000009465139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014627504,0.000026606895,0.0010443651,0.0002226239,0.0000098083165,0.0000120515315,0.0054657767,0.88870573,0.074541986,0.02761452,0.00014932947,0.0021925913],"study_design_scores_gemma":[0.00078757846,0.00008875919,0.29639962,0.00033701243,0.0000615005,0.000005344521,0.0004836677,0.66059923,0.032968704,0.0047474597,0.002965772,0.0005553613],"about_ca_topic_score_codex":0.000014475699,"about_ca_topic_score_gemma":0.00012029083,"teacher_disagreement_score":0.43042654,"about_ca_system_score_codex":0.00009480264,"about_ca_system_score_gemma":0.00012920813,"threshold_uncertainty_score":0.39885074},"labels":[],"label_agreement":null},{"id":"W4408102369","doi":"10.1287/trsc.2024.0657","title":"Intermodal Hub Network Design with Probabilistic Service-Level Constraints","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University; HEC Montréal","funders":"","keywords":"Network planning and design; Transport engineering; Probabilistic logic; Service (business); Level of service; Computer science; Service level; Operations research; Engineering; Computer network; Business; Marketing","score_opus":0.0318273802419134,"score_gpt":0.24048790524678776,"score_spread":0.20866052500487436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408102369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018728774,0.000018180386,0.9709879,0.00006314933,0.00029711597,0.0002444704,0.00001832957,0.00016849469,0.009473586],"genre_scores_gemma":[0.977425,0.0000031308705,0.022279657,0.00014671603,0.000019513875,0.00001833681,0.000010801747,0.000006408587,0.00009047566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99921054,0.000006057253,0.00018660724,0.00018017893,0.00018495282,0.00023165291],"domain_scores_gemma":[0.9995129,0.000046509158,0.000021405367,0.00013845795,0.00022107681,0.00005963949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027455456,0.000097661454,0.000100826896,0.000064170184,0.00009969351,0.000054536347,0.0001868655,0.000028303539,0.00011260503],"category_scores_gemma":[0.000023447425,0.00008403816,0.00001212541,0.0007566588,0.00034756528,0.00014877705,0.0000021931367,0.000081923085,0.0000065446866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017932183,0.0000163626,0.0028335915,0.0001285921,0.0000124647895,0.000012844817,0.00058947614,0.96271366,0.00026168485,0.025007252,0.00034694496,0.00805918],"study_design_scores_gemma":[0.0011714658,0.00011570395,0.5087075,0.0005184862,0.00013380617,0.0000071731365,0.00035042124,0.47219568,0.0021560572,0.011554789,0.002292027,0.00079689414],"about_ca_topic_score_codex":0.000018233133,"about_ca_topic_score_gemma":0.00021753003,"teacher_disagreement_score":0.9586962,"about_ca_system_score_codex":0.0000305228,"about_ca_system_score_gemma":0.00016817449,"threshold_uncertainty_score":0.34269768},"labels":[],"label_agreement":null},{"id":"W4408472572","doi":"10.1287/trsc.2024.0547","title":"Scalable Dynamic Mixture Model with Full Covariance for Probabilistic Traffic Forecasting","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal","funders":"","keywords":"Covariance; Probabilistic logic; Probabilistic forecasting; Computer science; Scalability; Operations research; Engineering; Artificial intelligence; Mathematics; Statistics","score_opus":0.03765625911313712,"score_gpt":0.2527043688502907,"score_spread":0.21504810973715355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408472572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43762738,0.00010998576,0.5610801,0.0001950343,0.000081363425,0.00031371598,0.00010351921,0.000030924606,0.00045797552],"genre_scores_gemma":[0.93547845,0.000010045963,0.06382767,0.000085551175,0.0000073080214,0.00007607422,0.000021519012,0.000009219185,0.0004841859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986277,0.0000021644908,0.0004458397,0.00054271484,0.0000660225,0.0003155311],"domain_scores_gemma":[0.9993756,0.00004849832,0.00015831593,0.00020893663,0.00015871365,0.000049932296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007023996,0.00012038402,0.00022785731,0.0002015892,0.00034876345,0.000074246935,0.00025399454,0.000056260647,0.000007331036],"category_scores_gemma":[0.00011754415,0.00012455859,0.000051851577,0.00091442646,0.0001932155,0.000451458,0.000003190404,0.00009222466,0.000004976911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009751839,0.000045527682,0.0013714724,0.0001265047,0.0000049531777,4.500112e-7,0.000766263,0.7989314,0.00017512974,0.19649269,0.000018068331,0.0019700143],"study_design_scores_gemma":[0.00041589298,0.000046264297,0.004104761,0.000051522427,0.000008145989,3.067422e-7,0.0000340305,0.952536,0.000036123547,0.042418983,0.00020528487,0.00014269302],"about_ca_topic_score_codex":0.000028341881,"about_ca_topic_score_gemma":0.00042899075,"teacher_disagreement_score":0.49785104,"about_ca_system_score_codex":0.00009334768,"about_ca_system_score_gemma":0.00023296177,"threshold_uncertainty_score":0.5079352},"labels":[],"label_agreement":null},{"id":"W4409010015","doi":"10.1287/trsc.2023.intro.v59.n2","title":"Special Issue on TSL Conference 2023","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Engineering; Operations research; Transport engineering; Computer science","score_opus":0.026732075799925505,"score_gpt":0.3030562876560336,"score_spread":0.2763242118561081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409010015","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10500122,0.000035485256,0.43486974,0.010095702,0.0069206776,0.00036301007,0.000008545124,0.00041928727,0.44228634],"genre_scores_gemma":[0.98572266,0.000015333666,0.008410073,0.0012016423,0.0003859113,0.000009955706,0.0000019589327,0.0000019546108,0.004250513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99867886,0.000013236325,0.00019152902,0.00043641674,0.00043488605,0.00024507134],"domain_scores_gemma":[0.9992916,0.00007101872,0.0000477325,0.0003840765,0.00015042303,0.00005517894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033797915,0.000092166,0.000110655914,0.00022402428,0.00021904531,0.00018475475,0.0012001938,0.000032061293,0.00014519333],"category_scores_gemma":[0.00005522004,0.00008059621,0.000031782638,0.0013948634,0.00029924407,0.0005971262,0.0000140060365,0.00008014819,0.00022548922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010555199,0.000048292277,0.0022930156,0.000011548117,0.0000033691697,0.000016540977,0.0014795107,0.00017661318,0.0015179024,0.8938536,0.009874504,0.09071457],"study_design_scores_gemma":[0.00060366705,0.00013573229,0.7936059,0.000096018055,0.000010050565,0.0000014807014,0.0004954585,0.0066632703,0.03225972,0.025171697,0.14058475,0.00037225508],"about_ca_topic_score_codex":0.00004385554,"about_ca_topic_score_gemma":0.00013906613,"teacher_disagreement_score":0.88072145,"about_ca_system_score_codex":0.000026115218,"about_ca_system_score_gemma":0.00030541857,"threshold_uncertainty_score":0.32866183},"labels":[],"label_agreement":null},{"id":"W4409246081","doi":"10.1287/trsc.2024.0560","title":"Probabilistic Traffic Forecasting with Dynamic Regression","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Probabilistic logic; Probabilistic forecasting; Regression analysis; Regression; Computer science; Mathematical model; Transport engineering; Operations research; Econometrics; Engineering; Statistics; Artificial intelligence; Economics; Mathematics; Machine learning","score_opus":0.008999947762259044,"score_gpt":0.23685530465507254,"score_spread":0.2278553568928135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409246081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7423254,0.000031304335,0.24733406,0.00007478568,0.00017797505,0.00027217634,0.0000035512837,0.0035346327,0.0062460583],"genre_scores_gemma":[0.99589884,0.000013440394,0.0039275656,0.000024792906,0.0000025232785,0.00003083033,0.000007025028,0.000005677754,0.000089331326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938416,0.000002821415,0.00013033362,0.00016124464,0.0001808602,0.00014060491],"domain_scores_gemma":[0.99978256,0.000011639796,0.000016617676,0.0001141967,0.000043014745,0.00003198438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014713923,0.00007556494,0.000063270396,0.00019954331,0.000102494574,0.000031603995,0.00014071667,0.000019149164,0.0000049309424],"category_scores_gemma":[0.0000066751127,0.000060354043,0.000013606694,0.00082961447,0.00012999623,0.00024917882,0.0000015846086,0.0000618525,0.0000017933137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038467126,0.00006383644,0.0005991421,0.00047250913,0.000022708353,0.000017863373,0.0015389675,0.674799,0.008378247,0.0156112,0.0020303018,0.2964277],"study_design_scores_gemma":[0.0002775506,0.000033009128,0.03411325,0.00023640011,0.000022812523,0.0000012225465,0.00016308755,0.962286,0.0014074447,0.00014197589,0.0011733247,0.00014395028],"about_ca_topic_score_codex":0.0000013227786,"about_ca_topic_score_gemma":0.00007605792,"teacher_disagreement_score":0.29628375,"about_ca_system_score_codex":0.00004877708,"about_ca_system_score_gemma":0.00003530422,"threshold_uncertainty_score":0.24611664},"labels":[],"label_agreement":null},{"id":"W4409430417","doi":"10.1287/trsc.2024.0725","title":"Branch-Price-and-Cut for the Electric Vehicle Routing Problem with Heterogeneous Recharging Technologies and Nonlinear Recharging Functions","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Nonlinear system; Routing (electronic design automation); Vehicle routing problem; Electric vehicle; Mathematical optimization; Computer science; Operations research; Engineering; Computer network; Mathematics; Power (physics); Physics","score_opus":0.013599852196323897,"score_gpt":0.26021661817717856,"score_spread":0.24661676598085466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409430417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30514097,0.00030626135,0.6930509,0.00042728044,0.000060514136,0.00037419188,0.000005248401,0.0005226261,0.0001119967],"genre_scores_gemma":[0.9079201,0.00012711037,0.0917698,0.000036508904,0.000008492141,0.000073336254,0.000002647449,0.000014451418,0.000047522997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907166,0.000012084344,0.00021321047,0.0002798625,0.00015015637,0.00027304373],"domain_scores_gemma":[0.9993857,0.00026053467,0.000050172668,0.00015923433,0.00011674927,0.000027587916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075838534,0.00011782136,0.00011511741,0.00022078671,0.0005891571,0.000109299355,0.00016241963,0.000048734964,0.0000013930638],"category_scores_gemma":[0.000084971594,0.000092189846,0.000018382661,0.0015467615,0.00014378733,0.00025735423,0.000006827456,0.0001483683,4.496724e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032502703,0.000014118143,0.008194214,0.00018737445,0.00004520243,0.0000012398909,0.0016239657,0.6341943,0.09285009,0.0028340146,0.00001147181,0.2600115],"study_design_scores_gemma":[0.00033995832,0.000037877828,0.00390631,0.0000797955,0.000043866643,0.0000052671394,0.00049017847,0.9503807,0.043976303,0.00036484285,0.00021836955,0.00015654448],"about_ca_topic_score_codex":0.000008624987,"about_ca_topic_score_gemma":0.00002515532,"teacher_disagreement_score":0.60277915,"about_ca_system_score_codex":0.00004323248,"about_ca_system_score_gemma":0.000057384357,"threshold_uncertainty_score":0.45313796},"labels":[],"label_agreement":null},{"id":"W4411483963","doi":"10.1287/trsc.2024.0693","title":"Optimizing an On-Demand Delivery Mode Based on Trucks and Drones","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Drone; Truck; Transshipment (information security); Computer science; Integer programming; Order (exchange); Mode (computer interface); Scale (ratio); Operations research; Transport engineering; Engineering; Business; Automotive engineering; Algorithm","score_opus":0.007242228473600837,"score_gpt":0.24519259704681604,"score_spread":0.2379503685732152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411483963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62753403,0.000018471565,0.36997578,0.0000607282,0.00005051242,0.00010768843,0.000008896197,0.0001099536,0.0021339515],"genre_scores_gemma":[0.9868721,0.00002591377,0.012900505,0.00013074777,0.0000054446673,0.000019731582,0.00001769911,0.0000054747047,0.000022377091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994691,0.000003884604,0.00011223648,0.00018115602,0.00013349112,0.00010011519],"domain_scores_gemma":[0.99973863,0.000024681753,0.000012941299,0.00013771202,0.000041549687,0.000044466884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010644863,0.000068642395,0.000057966477,0.00017813238,0.0001465162,0.00004676971,0.00009010327,0.00002540184,0.000009794048],"category_scores_gemma":[0.0000030052176,0.000068497575,0.000010389435,0.00044101977,0.00007267858,0.0002453593,7.218416e-7,0.000044919758,0.0000021686187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067632645,0.000013145054,0.0004225653,0.000010105428,9.802903e-7,2.2859278e-7,0.00026131174,0.9889194,0.0031617414,0.004486016,0.000008469316,0.0027092812],"study_design_scores_gemma":[0.0001885465,0.00002248841,0.028604696,0.000022621009,0.000006477271,4.7725237e-8,0.000051393312,0.96465117,0.0061094407,0.0002010511,0.00006626864,0.00007578939],"about_ca_topic_score_codex":0.000011254661,"about_ca_topic_score_gemma":0.000030239322,"teacher_disagreement_score":0.3593381,"about_ca_system_score_codex":0.000022890998,"about_ca_system_score_gemma":0.000030398138,"threshold_uncertainty_score":0.279325},"labels":[],"label_agreement":null},{"id":"W4412920879","doi":"10.1287/trsc.2025.intro.v59.n4","title":"Special Issue on Machine Learning Methods for Urban Passenger Mobility","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Transport engineering; Computer science; Public transport; Engineering","score_opus":0.028284489862974535,"score_gpt":0.41677296966588323,"score_spread":0.3884884798029087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412920879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18103191,0.00015129852,0.6441541,0.012362949,0.0029496618,0.0024729425,0.00007137028,0.00047521133,0.15633056],"genre_scores_gemma":[0.98570573,0.000015895379,0.005753128,0.00039518374,0.00096994406,0.00007211426,0.000029512963,0.0000045193924,0.007053986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842966,0.00021864116,0.0002787613,0.0004279639,0.00038045872,0.0002645394],"domain_scores_gemma":[0.9987094,0.0006055776,0.0000792876,0.0001883195,0.000323167,0.00009428761],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004824412,0.0000882958,0.00015210213,0.00022181998,0.0015319121,0.00009955584,0.0003322067,0.000056294528,0.0009252182],"category_scores_gemma":[0.0008631728,0.00008698063,0.00010331728,0.0015367897,0.00075513514,0.00025300437,0.000002432178,0.00013448721,0.000019449293],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016211341,0.00048915186,0.044972956,0.000095768846,0.000039368544,8.621668e-7,0.06044094,0.0068932017,0.0021087162,0.23165953,0.0023562997,0.6507811],"study_design_scores_gemma":[0.00036451724,0.000071465496,0.0749496,0.000024386389,0.000066128094,1.0076944e-8,0.004255467,0.0068571214,0.002558387,0.004903239,0.90573835,0.00021132782],"about_ca_topic_score_codex":0.001842592,"about_ca_topic_score_gemma":0.009407437,"teacher_disagreement_score":0.90338206,"about_ca_system_score_codex":0.00013605825,"about_ca_system_score_gemma":0.0005280348,"threshold_uncertainty_score":0.9999881},"labels":[],"label_agreement":null},{"id":"W4414350770","doi":"10.1287/trsc.2024.0840","title":"A Heteroscedastic Robust Bayesian Optimization Method for Solving Simulation-Based Transportation Problems","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Heteroscedasticity; Optimization problem; Bayesian probability; Gaussian process; Ranking (information retrieval); Constraint (computer-aided design); Bayesian optimization; Probabilistic logic; Bayesian inference","score_opus":0.03307681624404186,"score_gpt":0.35239952365310645,"score_spread":0.3193227074090646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414350770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003412947,0.0000281381,0.99291974,0.0009238509,0.00045269795,0.0011880556,0.00009917368,0.000336431,0.0006389565],"genre_scores_gemma":[0.7476216,0.000008537026,0.25115755,0.00030402557,0.000033864537,0.00015190049,0.00044835624,0.000016737768,0.0002573935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973506,0.00006694175,0.00067988946,0.000652882,0.000751732,0.0004979574],"domain_scores_gemma":[0.99761784,0.0007580706,0.0002777139,0.00020688862,0.00097456836,0.0001648941],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016900245,0.00020966024,0.00023443277,0.00061965076,0.0016968942,0.0002396046,0.00036141076,0.00014939961,0.000089936824],"category_scores_gemma":[0.000349573,0.00023724801,0.00012247756,0.0025233112,0.00038426564,0.001090908,7.218881e-7,0.000115824405,0.0000020185664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050853232,0.00005593964,0.0044845804,0.00007816934,0.00000806195,4.927608e-7,0.005663798,0.97655827,0.00037060885,0.011263347,0.000019147681,0.0014467468],"study_design_scores_gemma":[0.0007782752,0.00003963566,0.0134369815,0.00013473506,0.00009019187,1.8995756e-8,0.00089719216,0.982289,0.00048477884,0.0005656547,0.0010193818,0.00026415568],"about_ca_topic_score_codex":0.00049665465,"about_ca_topic_score_gemma":0.002817211,"teacher_disagreement_score":0.7442087,"about_ca_system_score_codex":0.00015938986,"about_ca_system_score_gemma":0.0011384736,"threshold_uncertainty_score":0.99960274},"labels":[],"label_agreement":null},{"id":"W4414534886","doi":"10.1287/trsc.2025.0104","title":"Dynamic Facility Location Under Cumulative Customer Demand","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université du Québec à Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Time horizon; Quality (philosophy); Service quality; Work (physics); Service (business); Customer service; Customer satisfaction; Representation (politics); Linear programming","score_opus":0.02247093730472269,"score_gpt":0.28748442333179036,"score_spread":0.26501348602706765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414534886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7379366,0.00004461581,0.2343391,0.0028862888,0.000767027,0.00050784415,0.000008117191,0.00021950204,0.023290876],"genre_scores_gemma":[0.9967586,0.0000056935914,0.000137687,0.0015211947,0.000010741704,0.000024209725,0.00007006267,0.0000027336162,0.0014690798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99866074,0.0000054907136,0.00031528072,0.00038852662,0.00041687893,0.00021307524],"domain_scores_gemma":[0.9992062,0.000010524049,0.00005688449,0.00024155574,0.00047176,0.000013096806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067219307,0.00011614165,0.00010174269,0.00042761397,0.00035320726,0.00013200921,0.00027371864,0.000029506307,0.00031941064],"category_scores_gemma":[0.000051093815,0.00011348786,0.000036787205,0.0026702236,0.0002634915,0.0016688799,0.000013470711,0.00006377728,0.00060417363],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008255618,0.0002991507,0.03972789,0.00066529267,0.000042442818,0.0000015807151,0.0008592051,0.3502258,0.0030401547,0.5842502,0.0018183315,0.018987382],"study_design_scores_gemma":[0.00035181205,0.0000025255956,0.8863284,0.000025453533,0.00004098931,2.6003823e-8,0.000772353,0.0915419,0.00011912919,0.005390655,0.015230573,0.00019617159],"about_ca_topic_score_codex":0.0007175585,"about_ca_topic_score_gemma":0.0017975915,"teacher_disagreement_score":0.84660053,"about_ca_system_score_codex":0.00007483029,"about_ca_system_score_gemma":0.00008261039,"threshold_uncertainty_score":0.77656317},"labels":[],"label_agreement":null},{"id":"W4417437321","doi":"10.1287/trsc.2024.0556","title":"Fair Stochastic Vehicle Routing with Partial Deliveries","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Bounding overwatch; Vehicle routing problem; Routing (electronic design automation); Resource allocation; Resource (disambiguation); Interdependence; Service (business); Equity (law)","score_opus":0.010843213677750973,"score_gpt":0.2616994611993252,"score_spread":0.2508562475215742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417437321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38796526,0.0000120058185,0.6109177,0.000039059218,0.000098680626,0.000070222035,0.0000026622258,0.00024568394,0.0006487319],"genre_scores_gemma":[0.96313494,0.0000016929639,0.03673416,0.00004291766,0.000010355386,0.0000116166575,0.0000035981825,0.0000091363945,0.000051551702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912834,0.000011466195,0.00018959957,0.00019574167,0.0002500841,0.00022474141],"domain_scores_gemma":[0.99961483,0.000051258794,0.000026203119,0.00014028708,0.00011469678,0.000052714982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034737546,0.000091796,0.00009367114,0.0001281865,0.00019846493,0.000061213665,0.00017029718,0.00002560318,0.000020857728],"category_scores_gemma":[0.000035705576,0.00008744478,0.000016242753,0.0012045017,0.00020556811,0.0003842899,0.0000027347817,0.00008294333,0.0000063034095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007900067,0.0000048123397,0.0039231903,0.000014010439,0.000004693432,0.0000011848954,0.0008441481,0.9829549,0.005611024,0.0037936326,0.0000062908075,0.0028342016],"study_design_scores_gemma":[0.0003688364,0.000019940815,0.06965616,0.00006178523,0.0000229958,6.686394e-7,0.00036657372,0.9087615,0.020376952,0.00010732685,0.0000818759,0.00017539058],"about_ca_topic_score_codex":0.0000133069125,"about_ca_topic_score_gemma":0.000025940217,"teacher_disagreement_score":0.5751697,"about_ca_system_score_codex":0.000044297725,"about_ca_system_score_gemma":0.00009850488,"threshold_uncertainty_score":0.35658944},"labels":[],"label_agreement":null}]}