{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11429659,0.00062408636,0.877156,0.00029049753,0.000086917185,0.00024880242,0.0003374027,0.0012718224,0.005687842],"genre_scores_gemma":[0.6810139,0.00026184967,0.31517205,0.00013230406,0.000032352546,0.00020334068,0.00049520173,0.00014877076,0.0025402016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977046,0.00009336817,0.000006975032,0.000032707056,0.000040607847,0.00005579087],"domain_scores_gemma":[0.9995691,0.00023554893,0.000053759824,0.000047030237,0.000054178006,0.000040308354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045839022,0.0005293614,0.00065716525,0.000564763,0.00044006834,0.00045855957,0.0007500738,0.00035523705,0.0025079108],"category_scores_gemma":[0.0009812813,0.00031254848,0.00045763951,0.0009006848,0.00038207258,0.00038153096,0.00055666745,0.0004854102,0.00032740104],"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.00012047404,0.000103025784,0.0006678787,0.00008851581,0.000025743971,0.000095377276,0.00006716457,0.891956,0.0030563155,0.0047271773,0.003568487,0.09552374],"study_design_scores_gemma":[0.000024602596,0.00003683849,0.00012448641,0.0000036906727,0.0000066072853,0.00001782015,0.000017382314,0.9961318,0.0007953306,0.001981066,0.0008545816,0.00000575734],"about_ca_topic_score_codex":0.008359695,"about_ca_topic_score_gemma":0.011037187,"teacher_disagreement_score":0.008359695,"about_ca_system_score_codex":0.0006531199,"about_ca_system_score_gemma":0.0010218492,"threshold_uncertainty_score":0.016622066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009425824,0.00034989053,0.9821776,0.0004187344,0.00010477982,0.00032359766,0.00031883243,0.00071958476,0.006161251],"genre_scores_gemma":[0.06616209,0.0003178904,0.9282212,0.00019690058,0.000061314,0.0005361506,0.00097375165,0.00021631528,0.0033143726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999173,0.00025568603,0.000042208983,0.0001866074,0.00021789542,0.00012462378],"domain_scores_gemma":[0.99871945,0.00081721804,0.00009471821,0.00009659759,0.00020026676,0.000071787355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012471023,0.0017044053,0.001388446,0.0011550654,0.0009543174,0.0014233759,0.0019565243,0.0021129015,0.0078057046],"category_scores_gemma":[0.0038031498,0.0007452484,0.0009831566,0.0021892095,0.00052275276,0.0017357839,0.0010800662,0.002839974,0.0013010628],"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.00018669818,0.0003602666,0.0005529306,0.00022486491,0.0000758735,0.00013036952,0.00007362893,0.6852326,0.0016154624,0.028450122,0.017077575,0.2660196],"study_design_scores_gemma":[0.000080081845,0.00007414402,0.00009213523,0.000015437248,0.000020336727,0.00005541434,0.000018119541,0.98196983,0.0008062693,0.013686841,0.0031713548,0.00001007739],"about_ca_topic_score_codex":0.005548859,"about_ca_topic_score_gemma":0.006791743,"teacher_disagreement_score":0.0078057046,"about_ca_system_score_codex":0.0017533537,"about_ca_system_score_gemma":0.003156814,"threshold_uncertainty_score":0.026112676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001950141,0.0004337328,0.99541986,0.0002312364,0.000049732243,0.00002934054,0.00009634624,0.00014594637,0.0016436686],"genre_scores_gemma":[0.36759627,0.0032353897,0.6159497,0.00035949462,0.00046265725,0.0007722634,0.0011253771,0.00035308173,0.010145747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980882,0.0006267382,0.00011527606,0.00041543914,0.00047942228,0.00027491417],"domain_scores_gemma":[0.99612504,0.0024771567,0.0005427502,0.00025503663,0.00046982555,0.00013014971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024590467,0.0018720165,0.0021853163,0.0013748974,0.00075706386,0.0027008783,0.0031677373,0.002249848,0.004614563],"category_scores_gemma":[0.008632091,0.0011127557,0.0021689672,0.0022454178,0.0012661507,0.003440709,0.002357688,0.0035382695,0.00098937],"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.000020713762,0.000021848216,0.00011410674,0.00006486118,0.000026179456,0.00003057885,0.000029260718,0.9195033,0.00018600246,0.06904769,0.0008740341,0.010081484],"study_design_scores_gemma":[0.000008827979,0.000010355728,0.000022046359,0.000007082753,0.000004949404,0.000011533077,0.000007688725,0.9613123,0.000071825714,0.037548307,0.0009894518,0.0000056909516],"about_ca_topic_score_codex":0.007449032,"about_ca_topic_score_gemma":0.0052439035,"teacher_disagreement_score":0.007449032,"about_ca_system_score_codex":0.0024247689,"about_ca_system_score_gemma":0.0025480157,"threshold_uncertainty_score":0.017592967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054530352,0.004713257,0.901874,0.0012940232,0.00025306368,0.0004831157,0.0013435325,0.0018112848,0.03369738],"genre_scores_gemma":[0.42575717,0.003824427,0.5527963,0.0005212599,0.00016524801,0.0016615794,0.0016295767,0.0005751093,0.013069241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985312,0.0009926127,0.00003393393,0.000097105265,0.00017164773,0.00017349029],"domain_scores_gemma":[0.99633753,0.0030143103,0.00024438975,0.00014779314,0.00017987771,0.00007617257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017995465,0.0016670029,0.0015779443,0.0016496802,0.00095655187,0.0033777296,0.0025929173,0.0028349739,0.009198117],"category_scores_gemma":[0.0064902618,0.001345048,0.001201108,0.003916352,0.001552867,0.0023553944,0.0010101709,0.0022617155,0.0017236663],"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.00005919874,0.000052465737,0.00009866923,0.00006078533,0.000018388933,0.000025032234,0.00003859751,0.96792006,0.00007514596,0.022435116,0.0013809172,0.007835607],"study_design_scores_gemma":[0.000032086995,0.00002069893,0.000030761126,0.00001681722,0.0000064156857,0.000008784395,0.00001920781,0.98529446,0.00005926626,0.013541849,0.0009630829,0.000006594755],"about_ca_topic_score_codex":0.015583588,"about_ca_topic_score_gemma":0.020087825,"teacher_disagreement_score":0.015583588,"about_ca_system_score_codex":0.0029725966,"about_ca_system_score_gemma":0.0023385254,"threshold_uncertainty_score":0.030985713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010304189,0.00020240928,0.9820338,0.00035059208,0.00003770809,0.00012890922,0.0000843296,0.0003363008,0.0065217586],"genre_scores_gemma":[0.10880764,0.0003618483,0.8848064,0.000101940655,0.00006531037,0.0003443565,0.00022686707,0.00015895723,0.0051267077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996165,0.0001414336,0.000013380088,0.000060097125,0.000103379556,0.000065105596],"domain_scores_gemma":[0.99945337,0.00039469168,0.000029495075,0.000030442496,0.000053770415,0.000038252623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008541331,0.00078659895,0.00093860866,0.0007130023,0.00054015726,0.0010962569,0.0011527191,0.0016975073,0.008733722],"category_scores_gemma":[0.0022809554,0.0005011136,0.000527952,0.001406067,0.00054595794,0.0015963323,0.0010186465,0.0014053168,0.0009599531],"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.00013850877,0.00016476536,0.0005004652,0.00013941695,0.000035682722,0.00015523375,0.00011505197,0.762706,0.0013433484,0.06698706,0.008985316,0.15872923],"study_design_scores_gemma":[0.00003913943,0.000027736125,0.000050687828,0.0000078215735,0.0000061596197,0.000031600943,0.000016788033,0.9734687,0.0002623579,0.024110306,0.0019739547,0.000004748532],"about_ca_topic_score_codex":0.0034090558,"about_ca_topic_score_gemma":0.0038613456,"teacher_disagreement_score":0.008733722,"about_ca_system_score_codex":0.00073139503,"about_ca_system_score_gemma":0.0018213288,"threshold_uncertainty_score":0.029217184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015938515,0.00028065333,0.97797716,0.00039420556,0.00003149531,0.00009149776,0.00010812393,0.00015235782,0.005026092],"genre_scores_gemma":[0.627753,0.00063392153,0.36372808,0.00021990023,0.00009389759,0.00051892694,0.00024836184,0.00012909515,0.0066748005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986759,0.0006734658,0.00003079353,0.00017434747,0.00026521581,0.00018015188],"domain_scores_gemma":[0.9980021,0.0015232051,0.00014233941,0.000090044065,0.00015091526,0.00009135134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001885785,0.0010411112,0.0014947192,0.0008544901,0.0005693061,0.0018170088,0.0019960694,0.0014362015,0.004779652],"category_scores_gemma":[0.0055043176,0.0009001884,0.00087602175,0.0016402706,0.0011483156,0.0020117748,0.0011791195,0.001732594,0.00037200286],"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.000016019287,0.000020361296,0.00009435453,0.00001599651,0.000009752812,0.000017269385,0.000013597066,0.9826041,0.00006870903,0.012783639,0.0002528099,0.0041033807],"study_design_scores_gemma":[0.0000041803396,0.0000062932986,0.000012799088,0.0000019930096,0.000002061704,0.0000039020197,0.000004229455,0.9937402,0.00003666201,0.006008324,0.00017765189,0.000001632643],"about_ca_topic_score_codex":0.013313855,"about_ca_topic_score_gemma":0.009778366,"teacher_disagreement_score":0.013313855,"about_ca_system_score_codex":0.002684568,"about_ca_system_score_gemma":0.0022899453,"threshold_uncertainty_score":0.026472747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069660456,0.00020799981,0.9878414,0.00028756444,0.000049939812,0.00014430085,0.0000789674,0.00030130317,0.0041224696],"genre_scores_gemma":[0.08738266,0.00032465355,0.9072774,0.00014572353,0.00006632505,0.00040030165,0.00033610183,0.00020900067,0.003857745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936026,0.00020376526,0.00003110531,0.00012824843,0.00018387758,0.000092822134],"domain_scores_gemma":[0.99911696,0.00058964227,0.000062859304,0.000055235643,0.00012298772,0.000052224088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010769243,0.0014448252,0.0015866364,0.0009642977,0.0007371444,0.0013599596,0.0019363132,0.001992738,0.008521611],"category_scores_gemma":[0.0033532113,0.00076689105,0.000917327,0.0018023538,0.0006531806,0.0021167174,0.001402684,0.0022274144,0.0011837741],"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.000101931684,0.00020079245,0.00037498891,0.00017171199,0.000056857018,0.00014745464,0.00007946832,0.77710193,0.0015647807,0.044450007,0.00739611,0.16835399],"study_design_scores_gemma":[0.00003630479,0.000042265827,0.00004311223,0.000007087471,0.000009485125,0.000032847922,0.000014025848,0.98234093,0.00035209837,0.015586195,0.0015298774,0.000005755966],"about_ca_topic_score_codex":0.0041326415,"about_ca_topic_score_gemma":0.0044099586,"teacher_disagreement_score":0.008521611,"about_ca_system_score_codex":0.0012557805,"about_ca_system_score_gemma":0.0020741285,"threshold_uncertainty_score":0.02850765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023694824,0.007795152,0.84270996,0.0035654756,0.00080986635,0.00045633552,0.0010674751,0.00042307383,0.11947786],"genre_scores_gemma":[0.49290204,0.021029446,0.4049446,0.0011069875,0.0017569113,0.0008506504,0.002084245,0.00031980447,0.075005315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859864,0.00047464285,0.000093166906,0.00026307406,0.0003764267,0.00019399474],"domain_scores_gemma":[0.9990829,0.00054010755,0.0001102247,0.00006775945,0.00013743535,0.000061625935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009350173,0.0012643334,0.0010613115,0.00073567,0.0011669458,0.0034069747,0.0012565762,0.0015757912,0.008671001],"category_scores_gemma":[0.0039020106,0.00045594893,0.0009996531,0.002246797,0.0013680044,0.003956824,0.0015542175,0.0022730809,0.002083281],"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.000040024355,0.00007855439,0.0003116656,0.00028399433,0.00004731483,0.00027485355,0.00021345967,0.12443794,0.0005798984,0.7858513,0.02030717,0.06757376],"study_design_scores_gemma":[0.000032091753,0.000044135966,0.00021774971,0.00006427198,0.00002817771,0.00036132295,0.00021939371,0.23012461,0.00039186503,0.70720375,0.06128485,0.000027819831],"about_ca_topic_score_codex":0.0031872024,"about_ca_topic_score_gemma":0.0022283017,"teacher_disagreement_score":0.008671001,"about_ca_system_score_codex":0.0013380272,"about_ca_system_score_gemma":0.0016896904,"threshold_uncertainty_score":0.029007435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94551945,0.00017660581,0.046322472,0.00010126146,0.000048121376,0.00027087086,0.00029356414,0.00028791273,0.006979596],"genre_scores_gemma":[0.94317734,0.00018006234,0.04926375,0.000021930558,0.000013627778,0.00015214641,0.0005502435,0.00007885967,0.006562124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969745,0.000057832716,0.000011569841,0.000075555865,0.000045098488,0.0001125484],"domain_scores_gemma":[0.99960583,0.00013694284,0.0000477334,0.00003793004,0.000052283835,0.00011920811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037143996,0.0008225666,0.0010061024,0.00034049267,0.0006198377,0.0008550851,0.0011927094,0.00074345095,0.0061306152],"category_scores_gemma":[0.00070762984,0.00063256326,0.00071615155,0.0006897473,0.0004989478,0.00068212603,0.0006185657,0.00067780894,0.00043524557],"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.00032502966,0.00013305331,0.0012470585,0.000084857886,0.000029016166,0.00024541194,0.00006788974,0.98136765,0.0039293314,0.001244284,0.0008102056,0.010516304],"study_design_scores_gemma":[0.0000668115,0.00022699093,0.00094171125,0.000005435382,0.000014576956,0.000034627945,0.00010508949,0.9955029,0.0016264872,0.00045239268,0.0010136879,0.000009295167],"about_ca_topic_score_codex":0.03367749,"about_ca_topic_score_gemma":0.025020223,"teacher_disagreement_score":0.03367749,"about_ca_system_score_codex":0.0011388742,"about_ca_system_score_gemma":0.0019279418,"threshold_uncertainty_score":0.0669629},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005972926,0.004652813,0.0001729321,0.021675536,0.968525,0.000019642313,0.00007280626,0.000048125443,0.004773374],"genre_scores_gemma":[0.0006411891,0.0054338393,0.0001026775,0.013402646,0.9659137,0.00001915273,0.000072044015,0.000049343445,0.014365474],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998466,0.00023020156,0.00018059683,0.0003141424,0.00065708667,0.00015197427],"domain_scores_gemma":[0.99180883,0.0026993125,0.0003622331,0.00023308495,0.0037732043,0.0011233741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020922837,0.0026939514,0.0023909041,0.002792379,0.0020698218,0.0061035845,0.0025713819,0.008854898,0.03125896],"category_scores_gemma":[0.00672821,0.00067451893,0.0019428402,0.0015949042,0.0018937439,0.00352764,0.0008754502,0.011026833,0.02434399],"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.000053333366,0.00001343374,0.000035152803,0.00016391385,0.000009829963,0.00006722753,0.0000037647314,0.00002629416,0.00009248177,0.00032025785,0.9929183,0.006295904],"study_design_scores_gemma":[0.000030134881,0.000032669952,0.00041999746,0.00023906578,0.000025961222,0.00022121634,0.000022032247,0.00020425186,0.00017741918,0.00070767116,0.9979042,0.000015422791],"about_ca_topic_score_codex":0.002247768,"about_ca_topic_score_gemma":0.0032770701,"teacher_disagreement_score":0.03125896,"about_ca_system_score_codex":0.0020980053,"about_ca_system_score_gemma":0.0013604416,"threshold_uncertainty_score":0.1045717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18196467,0.0016925473,0.781766,0.0035399885,0.0002613407,0.00040695604,0.0003562918,0.0004226613,0.029589579],"genre_scores_gemma":[0.95424235,0.0010129448,0.041510306,0.00012611406,0.00006484401,0.000148875,0.0000800003,0.000022597596,0.0027920147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986935,0.0007192684,0.000040774903,0.00010003605,0.0002652387,0.00018118041],"domain_scores_gemma":[0.99713135,0.0020145264,0.00038821032,0.00011159822,0.00019835464,0.00015587694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023909768,0.00075407536,0.0005254413,0.0011336597,0.00051116047,0.00152518,0.0010748663,0.00128386,0.0044390685],"category_scores_gemma":[0.007995827,0.000357142,0.00043813372,0.0007552138,0.0011817507,0.0023283781,0.0011602831,0.001308587,0.00019326126],"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.00009968337,0.00009155017,0.0007850891,0.00014167688,0.000033495857,0.000055439043,0.000044980115,0.8472033,0.00091163034,0.12716977,0.0013186922,0.022144714],"study_design_scores_gemma":[0.000102475075,0.00011735254,0.00038477973,0.000047751375,0.00004862701,0.000049383212,0.00013542367,0.9047381,0.0017549251,0.086789824,0.0058084857,0.000022937049],"about_ca_topic_score_codex":0.0038408611,"about_ca_topic_score_gemma":0.0032212466,"teacher_disagreement_score":0.0044390685,"about_ca_system_score_codex":0.0020026127,"about_ca_system_score_gemma":0.002456135,"threshold_uncertainty_score":0.01485014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0402392,0.0005121139,0.95219547,0.00044626003,0.00005330177,0.000054815413,0.00037490236,0.00042156107,0.0057023014],"genre_scores_gemma":[0.84779984,0.0005908825,0.1474814,0.000104049876,0.00008250741,0.0001445783,0.0005945694,0.00017932453,0.003022825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985904,0.0005103194,0.000081002676,0.0002635166,0.00033668257,0.00021818579],"domain_scores_gemma":[0.9984035,0.0009575079,0.0002707086,0.00014724924,0.00015493124,0.00006614794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014570652,0.0011054708,0.0013311026,0.0005977081,0.00047091887,0.0015626134,0.0014080221,0.0015123412,0.0019523286],"category_scores_gemma":[0.004088538,0.0008373776,0.00089570903,0.0012682339,0.00070523785,0.0021706994,0.0010421888,0.0010943881,0.00033363767],"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.000029410945,0.00000878013,0.00008089109,0.000023886725,0.000013259839,0.000050047074,0.000013649592,0.98720366,0.00053899403,0.007013826,0.00033121824,0.0046924623],"study_design_scores_gemma":[0.0000056172953,0.000013138195,0.00004903178,0.0000025467948,0.0000049218543,0.00001735567,0.0000076178844,0.9914551,0.00023827195,0.007830912,0.00037024333,0.0000052039704],"about_ca_topic_score_codex":0.0038243204,"about_ca_topic_score_gemma":0.0020197183,"teacher_disagreement_score":0.0038243204,"about_ca_system_score_codex":0.0015464254,"about_ca_system_score_gemma":0.0009220769,"threshold_uncertainty_score":0.011220157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029933205,0.0029483098,0.9526279,0.00042397497,0.00018628738,0.00054914545,0.0002569969,0.0007802333,0.012293948],"genre_scores_gemma":[0.27353886,0.0030599618,0.71635604,0.0003030505,0.00016336488,0.00045717298,0.00046451567,0.00020508727,0.005451963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992124,0.00035787735,0.000036512436,0.00011971613,0.00013229345,0.0001410637],"domain_scores_gemma":[0.9989532,0.00072475045,0.00013176275,0.000065254535,0.00006147003,0.000063587184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010283701,0.0012718411,0.0012706001,0.0011583831,0.0006972944,0.0014166117,0.0017900108,0.0013882278,0.0036473556],"category_scores_gemma":[0.0023833355,0.00061129924,0.0009877764,0.0019894948,0.00079829013,0.0013282216,0.00085292954,0.0011914808,0.00067307346],"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.00012196012,0.0002067229,0.00038098005,0.000472181,0.0000659303,0.00027920783,0.00015923263,0.8509044,0.0010801632,0.058331385,0.006666752,0.081331104],"study_design_scores_gemma":[0.00017023113,0.00016977036,0.00025711514,0.00007030518,0.000062005296,0.0002670323,0.0001356039,0.9447488,0.0012368443,0.041407723,0.0114358,0.000038707753],"about_ca_topic_score_codex":0.0040667877,"about_ca_topic_score_gemma":0.006131396,"teacher_disagreement_score":0.0040667877,"about_ca_system_score_codex":0.0014318861,"about_ca_system_score_gemma":0.0019239977,"threshold_uncertainty_score":0.012201607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008868409,0.0011876549,0.9748616,0.00071191636,0.000069422815,0.0002887342,0.0002693096,0.00014599581,0.01359702],"genre_scores_gemma":[0.17474073,0.0034887944,0.80959874,0.00024343554,0.0002250421,0.0013407867,0.000469275,0.00020368258,0.009689595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920243,0.00046798875,0.000025565003,0.000093420545,0.0001262421,0.000084321684],"domain_scores_gemma":[0.99880266,0.0009085501,0.000116079995,0.000045315264,0.000091178386,0.000036198726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020323445,0.0015039444,0.0011937085,0.0015345468,0.00062155427,0.002305745,0.0015909077,0.0025492157,0.005286617],"category_scores_gemma":[0.004342741,0.0011929885,0.0009517246,0.0024439364,0.0010904445,0.0015573336,0.001322868,0.0016143917,0.0006985682],"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.000011967139,0.00003311874,0.00013120157,0.00008984458,0.000012638046,0.00005267691,0.000038920534,0.9564473,0.00015953979,0.028763698,0.00145539,0.012803658],"study_design_scores_gemma":[0.000021671187,0.00001771869,0.000039488925,0.000043100972,0.000009499276,0.000020019857,0.000058349327,0.9703846,0.0002203341,0.024693253,0.004485427,0.0000065576855],"about_ca_topic_score_codex":0.006604647,"about_ca_topic_score_gemma":0.006590661,"teacher_disagreement_score":0.006604647,"about_ca_system_score_codex":0.0028322171,"about_ca_system_score_gemma":0.0025013648,"threshold_uncertainty_score":0.020549297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024474126,0.0033644852,0.000058966703,0.01966146,0.9753728,0.000015141331,0.000036984195,0.000030756535,0.0014349797],"genre_scores_gemma":[0.0002648978,0.0021320032,0.000052731462,0.009231623,0.97827977,0.000016483486,0.000029752304,0.000034154935,0.00995862],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946732,0.00080901553,0.00053738646,0.0007996284,0.0026647365,0.0005160391],"domain_scores_gemma":[0.98425746,0.0039855423,0.00172397,0.00043718325,0.006483553,0.0031122447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059123556,0.005161604,0.0055615744,0.006264165,0.0042821956,0.0106437905,0.004069525,0.020461697,0.03297763],"category_scores_gemma":[0.021055954,0.0016759855,0.0032737462,0.00227426,0.0021321208,0.0043228404,0.0027881744,0.01567714,0.016546534],"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.000035250014,0.000012389091,0.000026059015,0.00011931454,0.000016792232,0.0001057755,0.0000057262787,0.000019763831,0.000044932985,0.00011457485,0.9964838,0.0030157347],"study_design_scores_gemma":[0.00011584996,0.000039929375,0.0004447158,0.00041478666,0.00009258288,0.00023830748,0.000035356377,0.0002109516,0.00012546407,0.00085318444,0.9974044,0.000024586127],"about_ca_topic_score_codex":0.0019526874,"about_ca_topic_score_gemma":0.00729546,"teacher_disagreement_score":0.03297763,"about_ca_system_score_codex":0.0042404453,"about_ca_system_score_gemma":0.0036963897,"threshold_uncertainty_score":0.110321224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008443709,0.0000756233,0.9964206,0.00006801285,0.000013835517,0.000038940754,0.000029616485,0.00007993897,0.0024290823],"genre_scores_gemma":[0.0470403,0.00039781604,0.94891375,0.00013967494,0.000046988698,0.00038947773,0.00020828283,0.0001385918,0.0027251595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991677,0.0003021904,0.00003899538,0.00011613771,0.00031058668,0.000064427244],"domain_scores_gemma":[0.9988913,0.00071904145,0.00009741024,0.00011421912,0.00014134042,0.000036740425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052452,0.0019883183,0.0009254541,0.0011191617,0.00061945274,0.0014609221,0.0015589183,0.0013306685,0.006924072],"category_scores_gemma":[0.0040627974,0.00078776275,0.0017119616,0.00127231,0.0013356742,0.0012435799,0.0018020262,0.0031284005,0.0014786124],"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.00004850108,0.000068253095,0.00031423548,0.0002811023,0.00004374526,0.00009844468,0.00009466015,0.76590323,0.0023687843,0.15105882,0.003082261,0.07663795],"study_design_scores_gemma":[0.000020223131,0.000050193885,0.00006273159,0.00004462702,0.000014362272,0.00006368375,0.000021066144,0.9084287,0.0012372248,0.08073562,0.009309875,0.0000116541505],"about_ca_topic_score_codex":0.0018811148,"about_ca_topic_score_gemma":0.0022287725,"teacher_disagreement_score":0.006924072,"about_ca_system_score_codex":0.0012827959,"about_ca_system_score_gemma":0.0017524934,"threshold_uncertainty_score":0.023163319},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009893409,0.016590945,0.00033260402,0.07411483,0.90067995,0.000039433435,0.00019031638,0.00006315577,0.00788993],"genre_scores_gemma":[0.00087405584,0.014598331,0.0003695892,0.046038315,0.8581345,0.00006237787,0.00034939314,0.00018566822,0.07938787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99804914,0.00025874685,0.00021133009,0.00023746978,0.0010694546,0.00017380985],"domain_scores_gemma":[0.9836178,0.0044646896,0.0012173522,0.00042737016,0.007873497,0.0023992804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022417277,0.0032553107,0.0040706885,0.0037250125,0.0028304562,0.009169155,0.002194805,0.011520105,0.060881764],"category_scores_gemma":[0.009899054,0.0007715064,0.0013250331,0.002953715,0.0015133289,0.004990178,0.0016243722,0.010304356,0.056262873],"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.000012861343,0.000009520359,0.00002525406,0.00006426159,0.0000041333,0.000014066072,0.0000051954366,0.000011907691,0.00005465974,0.0001748733,0.99499387,0.0046293926],"study_design_scores_gemma":[0.0000166544,0.00004275513,0.0006346417,0.0002504769,0.0000234448,0.000070711794,0.000062848376,0.00009560074,0.00009088117,0.0017477814,0.99694926,0.000014970967],"about_ca_topic_score_codex":0.002514307,"about_ca_topic_score_gemma":0.0060074693,"teacher_disagreement_score":0.060881764,"about_ca_system_score_codex":0.0018451728,"about_ca_system_score_gemma":0.0032107884,"threshold_uncertainty_score":0.20366979},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32847223,0.0020155024,0.6308187,0.0016762394,0.00012878717,0.0002571393,0.0009825968,0.0002777233,0.035371017],"genre_scores_gemma":[0.86423063,0.0016062655,0.11749104,0.000249519,0.00015402077,0.00033694113,0.00090005074,0.000114716866,0.014916794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879444,0.0005994932,0.000057478417,0.00017933123,0.00015661548,0.00021265364],"domain_scores_gemma":[0.99741495,0.0017398358,0.00027344635,0.00020570346,0.00015794982,0.00020808357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015884852,0.0013878815,0.0013696561,0.0012901359,0.0010339898,0.0024191202,0.0020618574,0.001967195,0.0038607805],"category_scores_gemma":[0.005185301,0.00080770673,0.0008658003,0.0031116342,0.0011704202,0.004270373,0.0025424226,0.0010691131,0.0005277185],"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.00034258896,0.00017104838,0.001209284,0.00031654668,0.00010203563,0.00032776114,0.00022004433,0.8136403,0.002248173,0.13495839,0.0049908236,0.041472986],"study_design_scores_gemma":[0.00006871733,0.00016552121,0.0007889101,0.00003945081,0.000044764798,0.000375085,0.0002784353,0.8472538,0.0013520243,0.14352672,0.0060775653,0.000028999097],"about_ca_topic_score_codex":0.0014831306,"about_ca_topic_score_gemma":0.0019350906,"teacher_disagreement_score":0.0038607805,"about_ca_system_score_codex":0.0014528241,"about_ca_system_score_gemma":0.0005025003,"threshold_uncertainty_score":0.012915552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029481586,0.00094176974,0.95397365,0.0008920732,0.00009092328,0.000069220405,0.00044286763,0.00018788013,0.013920121],"genre_scores_gemma":[0.77359235,0.002187644,0.19856705,0.0002589464,0.00018141567,0.00042795812,0.0008895924,0.00015719094,0.023737928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987198,0.00048789495,0.000050237933,0.00027306718,0.00020281097,0.00026625616],"domain_scores_gemma":[0.99902296,0.00050017925,0.00013589962,0.000058107773,0.00016586928,0.000116959214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247971,0.0013128795,0.0023855644,0.0010073483,0.0009370463,0.0038118965,0.0021196422,0.002807047,0.005464072],"category_scores_gemma":[0.0040102266,0.0008806632,0.0012260228,0.0032413385,0.0016307591,0.0033729735,0.002235448,0.0027389391,0.0009400186],"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.000043445438,0.000042924177,0.00021740542,0.000090447174,0.000027851098,0.00009493864,0.00006561586,0.9081237,0.00030798002,0.08404746,0.00093232124,0.0060059144],"study_design_scores_gemma":[0.00001589402,0.000026175312,0.000041969437,0.000012292728,0.000010436583,0.00002183245,0.000028611774,0.9434953,0.000076915465,0.054750457,0.0015109323,0.000009211035],"about_ca_topic_score_codex":0.009147476,"about_ca_topic_score_gemma":0.0074451687,"teacher_disagreement_score":0.009147476,"about_ca_system_score_codex":0.0019675142,"about_ca_system_score_gemma":0.0018117393,"threshold_uncertainty_score":0.018279135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049235355,0.003957872,0.8794173,0.0020542883,0.00038106588,0.0006609658,0.00058297825,0.0005259592,0.06318418],"genre_scores_gemma":[0.33124855,0.005203341,0.65241504,0.0006191239,0.00068754976,0.0018039902,0.0019546854,0.0007269197,0.005340756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99111253,0.0041135997,0.00032581788,0.000735012,0.0029452704,0.0007677868],"domain_scores_gemma":[0.94727385,0.046194185,0.0016949702,0.001820914,0.0023181397,0.0006979661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010271748,0.0024214126,0.001244449,0.003688675,0.0015832946,0.004603391,0.0034601795,0.002597285,0.014595458],"category_scores_gemma":[0.05897715,0.0010902378,0.0020522517,0.004620768,0.002503705,0.0060953978,0.0020570338,0.0044370247,0.0010519018],"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.0009183248,0.00051891734,0.0012348269,0.0008986912,0.000112012625,0.00017323361,0.00025181434,0.52979195,0.002048872,0.3517391,0.008695765,0.103616446],"study_design_scores_gemma":[0.00016823591,0.0006831688,0.0010626492,0.00026023312,0.00011062069,0.00034958633,0.00022040209,0.81490564,0.002181184,0.17184731,0.008163449,0.000047471854],"about_ca_topic_score_codex":0.0018586027,"about_ca_topic_score_gemma":0.0021763514,"teacher_disagreement_score":0.014595458,"about_ca_system_score_codex":0.0051241713,"about_ca_system_score_gemma":0.003543475,"threshold_uncertainty_score":0.05432284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062815934,0.00037646823,0.9080811,0.0012663796,0.00007744705,0.0003172998,0.0014787613,0.00030281895,0.025283772],"genre_scores_gemma":[0.69702023,0.00078080007,0.27615875,0.00021282182,0.000054397264,0.0011877427,0.0011129457,0.00007986163,0.023392348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995111,0.00016974774,0.000020517777,0.00011534489,0.000100324585,0.0000829525],"domain_scores_gemma":[0.99949336,0.00028938122,0.00006974366,0.000020686695,0.00008141281,0.000045524775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010007218,0.0009105478,0.0007568232,0.00092783355,0.000687118,0.0016929721,0.0015893846,0.001763568,0.0063362373],"category_scores_gemma":[0.0012847186,0.0005435072,0.0009057033,0.001588675,0.001012219,0.0012336981,0.00077790656,0.0012285197,0.0005694094],"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.000014839752,0.000019896948,0.00011018113,0.000024035735,0.000010416456,0.00008860288,0.00003089577,0.98204654,0.00017550298,0.015002428,0.00038040956,0.0020963543],"study_design_scores_gemma":[0.000015132229,0.00002636914,0.00006816076,0.000006351448,0.000008702705,0.000027269673,0.000029377092,0.9922575,0.000085727464,0.0063278605,0.0011420207,0.0000055135206],"about_ca_topic_score_codex":0.022627655,"about_ca_topic_score_gemma":0.021816343,"teacher_disagreement_score":0.022627655,"about_ca_system_score_codex":0.0022254274,"about_ca_system_score_gemma":0.0028604171,"threshold_uncertainty_score":0.04499191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014271082,0.00079877686,0.9747546,0.00026781406,0.00007856101,0.00021455898,0.0005844328,0.0005700661,0.008460123],"genre_scores_gemma":[0.16446698,0.0013893644,0.8183726,0.00013937164,0.00013409709,0.0007587943,0.0020639393,0.0003563692,0.01231851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903584,0.00041822778,0.000034472116,0.0001546332,0.00021133939,0.000145525],"domain_scores_gemma":[0.9993892,0.0003803383,0.000076802855,0.000042900214,0.00006556441,0.000045176344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013446553,0.0020026613,0.0014718111,0.0012532927,0.00057505054,0.0012918949,0.0009872316,0.0011970452,0.007737903],"category_scores_gemma":[0.0021558192,0.0010882242,0.0015347888,0.0019271381,0.00050655217,0.0011656731,0.00081840565,0.0018998979,0.0012383125],"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.00012994037,0.000094059345,0.0002362197,0.00016729016,0.000055655557,0.0000663189,0.0000697413,0.9251002,0.0016809104,0.027032562,0.0040381746,0.04132888],"study_design_scores_gemma":[0.000044305794,0.000049111826,0.00012937107,0.00001754956,0.000015216166,0.000023847337,0.000023914406,0.97185814,0.00052719,0.023612777,0.0036889433,0.000009636747],"about_ca_topic_score_codex":0.007838444,"about_ca_topic_score_gemma":0.00836853,"teacher_disagreement_score":0.007838444,"about_ca_system_score_codex":0.0013733696,"about_ca_system_score_gemma":0.001841119,"threshold_uncertainty_score":0.02588588},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013154468,0.013575763,0.9611138,0.0006160376,0.000115726754,0.0001162932,0.0001411804,0.00038268778,0.010784096],"genre_scores_gemma":[0.39185604,0.024297608,0.5623655,0.00029838784,0.0005227569,0.00065380667,0.0005331952,0.000318725,0.019153953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995932,0.00017829242,0.000022044085,0.00007712287,0.00008407429,0.000045201],"domain_scores_gemma":[0.9995158,0.00032162544,0.000074827854,0.000029879819,0.000035949255,0.000021961112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069211214,0.0008593218,0.0011990588,0.00051124376,0.0004280464,0.001739366,0.0011049655,0.0010462686,0.0026869576],"category_scores_gemma":[0.0017572506,0.0004570096,0.00069362397,0.0018424051,0.0005772199,0.0022776534,0.0007035764,0.001134337,0.00069279486],"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.00011253323,0.00011807909,0.00043493838,0.0006620647,0.000086502776,0.000104568,0.00012215658,0.7119612,0.002317845,0.06884886,0.008429431,0.20680176],"study_design_scores_gemma":[0.000048675654,0.00012475104,0.0002882833,0.000081904676,0.000047072986,0.00020104567,0.00008024577,0.9339967,0.0017499956,0.045032408,0.018324971,0.000023948063],"about_ca_topic_score_codex":0.0023179022,"about_ca_topic_score_gemma":0.0014958811,"teacher_disagreement_score":0.0026869576,"about_ca_system_score_codex":0.0008768331,"about_ca_system_score_gemma":0.00086839264,"threshold_uncertainty_score":0.008988738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29106483,0.00027734946,0.70339274,0.0009969819,0.00006969929,0.000047821824,0.00041195788,0.00036854346,0.0033700038],"genre_scores_gemma":[0.98228914,0.00011707755,0.016983667,0.000028304492,0.0000271727,0.00001682429,0.00017373396,0.000023787767,0.00034031842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936086,0.00023333938,0.000040134117,0.00013047764,0.00013924802,0.000095859876],"domain_scores_gemma":[0.9934481,0.0046946825,0.00071097753,0.0005405062,0.00039298914,0.00021287322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002008486,0.0009236552,0.0009240853,0.0005682351,0.00040504872,0.0015025388,0.0015205352,0.0011883848,0.0015612696],"category_scores_gemma":[0.009942055,0.00071309233,0.00044372282,0.0007428674,0.0007646548,0.0041136686,0.0008115066,0.0014631136,0.00031374473],"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.00015733555,0.000039415037,0.0013639868,0.000034652538,0.00002128075,0.00005863511,0.000042714986,0.9832955,0.0010478181,0.002925847,0.00023369404,0.010779193],"study_design_scores_gemma":[0.000011317308,0.00003631787,0.0005637142,0.0000032273836,0.000010423787,0.00002200644,0.000020528048,0.9941788,0.00070961384,0.004244151,0.00018824714,0.0000117137215],"about_ca_topic_score_codex":0.003732371,"about_ca_topic_score_gemma":0.0043782443,"teacher_disagreement_score":0.003732371,"about_ca_system_score_codex":0.00073895615,"about_ca_system_score_gemma":0.0009890825,"threshold_uncertainty_score":0.010622025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5249261,0.0025451942,0.3917716,0.008979968,0.0003945278,0.0001850127,0.00046981714,0.0003764517,0.07035126],"genre_scores_gemma":[0.9523546,0.0003090697,0.04408401,0.00023228725,0.00005688194,0.00009408347,0.000109181936,0.00003879648,0.0027211055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937266,0.00037651396,0.000019595025,0.00005317121,0.00011639007,0.00006175343],"domain_scores_gemma":[0.9896762,0.008770845,0.0005380095,0.00027052872,0.000559288,0.00018517673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017325472,0.00044479483,0.00052603317,0.00078278995,0.00069166376,0.0008424136,0.00078458706,0.001702503,0.004398446],"category_scores_gemma":[0.019676542,0.00023354855,0.00034102623,0.00092307106,0.0013915966,0.0014335602,0.0009832731,0.0016495207,0.00015009909],"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.00006414235,0.000111678,0.0016936504,0.00009604493,0.000018324956,0.0001616975,0.00007860047,0.9251813,0.0004727362,0.06465455,0.0016816175,0.005785604],"study_design_scores_gemma":[0.000013140028,0.00001392314,0.00013393833,0.000009280729,0.0000029635792,0.00002358133,0.00003589282,0.99114627,0.00009781556,0.008150077,0.00036890517,0.000004131914],"about_ca_topic_score_codex":0.007406526,"about_ca_topic_score_gemma":0.0046195006,"teacher_disagreement_score":0.007406526,"about_ca_system_score_codex":0.0008161861,"about_ca_system_score_gemma":0.0008024306,"threshold_uncertainty_score":0.014726818},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06282647,0.0020150344,0.92035943,0.002263613,0.0002070449,0.0002543931,0.000924691,0.00046563137,0.010683709],"genre_scores_gemma":[0.8346128,0.0022493242,0.13966633,0.00038522636,0.00037367627,0.00071257574,0.0010424667,0.00027550664,0.020682039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806577,0.0008441558,0.000091358736,0.000349619,0.00028630218,0.00036282215],"domain_scores_gemma":[0.99773335,0.0016535654,0.0002620887,0.00004288423,0.00014047713,0.00016757142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025006176,0.0020104179,0.0031356912,0.001332963,0.0009467278,0.003372374,0.0018456744,0.0028002453,0.004345715],"category_scores_gemma":[0.0040782657,0.0020971338,0.0015231328,0.002339734,0.0013503688,0.0018702878,0.0015609686,0.0019043975,0.00048802156],"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.000044118337,0.000020205107,0.00013597247,0.000042845906,0.000028073182,0.000067760295,0.000020401656,0.9885844,0.00011640606,0.007774546,0.0004936519,0.002671677],"study_design_scores_gemma":[0.000023109116,0.00001973659,0.000045223325,0.000005625689,0.000012368759,0.000012793263,0.000011579637,0.99169403,0.000057010024,0.0076672514,0.00044405845,0.000007226139],"about_ca_topic_score_codex":0.023015158,"about_ca_topic_score_gemma":0.01317223,"teacher_disagreement_score":0.023015158,"about_ca_system_score_codex":0.0034386464,"about_ca_system_score_gemma":0.0027799534,"threshold_uncertainty_score":0.04576242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062124515,0.00019795183,0.9896947,0.00031312957,0.000027017291,0.000039576924,0.000060781083,0.00007794441,0.0033764709],"genre_scores_gemma":[0.3267411,0.0007574775,0.66345876,0.00020581932,0.00008981064,0.0005216183,0.00033916094,0.00016172562,0.0077245026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928325,0.0003103224,0.000024690484,0.00013398181,0.00012477394,0.0001231164],"domain_scores_gemma":[0.9991487,0.00053210446,0.00006446117,0.00004072166,0.00014678732,0.00006725927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014829829,0.0011367784,0.0019724981,0.00077169645,0.0008839391,0.0028221083,0.0020030453,0.003226012,0.0052089156],"category_scores_gemma":[0.004035679,0.00095860177,0.0010581162,0.0018354807,0.0012007059,0.0024127248,0.002320782,0.0033650948,0.0008058544],"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.000028807515,0.000047563328,0.00012223377,0.00005845197,0.00001743627,0.000047773126,0.00005838456,0.94563395,0.00022992305,0.04219353,0.00097449595,0.010587415],"study_design_scores_gemma":[0.00001139418,0.0000119179485,0.000012498779,0.0000064877513,0.0000035038136,0.000008982611,0.000018329943,0.98290193,0.000061404564,0.016283605,0.0006759935,0.0000039329416],"about_ca_topic_score_codex":0.0072152033,"about_ca_topic_score_gemma":0.005176615,"teacher_disagreement_score":0.0072152033,"about_ca_system_score_codex":0.0015809692,"about_ca_system_score_gemma":0.0019779182,"threshold_uncertainty_score":0.017425537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07276998,0.00032611212,0.9200896,0.00024509127,0.00004436423,0.000088891466,0.00018816708,0.000463794,0.005783848],"genre_scores_gemma":[0.55171174,0.0002923485,0.44414255,0.000057851863,0.00004330484,0.00019817315,0.00034941384,0.000101081125,0.0031034981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995795,0.00016067804,0.000014196585,0.00006832419,0.000108413944,0.000068930945],"domain_scores_gemma":[0.99895144,0.0007033073,0.00011093537,0.00011071141,0.00008036618,0.00004320802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087119295,0.0009245291,0.00097623735,0.0005313116,0.00049662305,0.00085784437,0.0012739939,0.00095330324,0.0037701996],"category_scores_gemma":[0.0022669586,0.00056879973,0.00057680387,0.00097463094,0.0006050772,0.0012149614,0.0009354139,0.0011053834,0.00032472736],"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.000026584503,0.000030304855,0.00016062302,0.00004571077,0.00001264396,0.00004016755,0.000013284375,0.97984767,0.000416195,0.0046309284,0.0004071492,0.014368802],"study_design_scores_gemma":[0.000013939514,0.000015419442,0.00006858037,0.0000033348663,0.000003264207,0.0000112293565,0.000014649083,0.9937372,0.0002939943,0.005580636,0.00025550733,0.0000021917815],"about_ca_topic_score_codex":0.0039428365,"about_ca_topic_score_gemma":0.0066407793,"teacher_disagreement_score":0.0039428365,"about_ca_system_score_codex":0.0008287454,"about_ca_system_score_gemma":0.0013162857,"threshold_uncertainty_score":0.012612581},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12301461,0.001144316,0.83125234,0.0033287413,0.0003486547,0.00039787477,0.0063324515,0.0016800349,0.032501],"genre_scores_gemma":[0.8306142,0.0016811091,0.054805517,0.0006237625,0.00039325506,0.0010118979,0.0044130036,0.00035659102,0.106100574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924904,0.00024694338,0.000026559474,0.00021109822,0.00011501305,0.00015130875],"domain_scores_gemma":[0.9983467,0.000940528,0.00024189554,0.00006267568,0.00025357178,0.0001544894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015953097,0.0019714667,0.0017389206,0.0011996946,0.0009448283,0.0021482264,0.0034989717,0.0039878455,0.017690318],"category_scores_gemma":[0.0063712844,0.0010272401,0.0015267368,0.0015662377,0.0012168938,0.0036752422,0.001015926,0.003080267,0.0027489197],"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.00004455303,0.000023037577,0.0003913366,0.000021014877,0.000015538313,0.000062876425,0.00004214357,0.96769184,0.00017531624,0.028620357,0.0013412889,0.0015707104],"study_design_scores_gemma":[0.000020419182,0.00001088452,0.000089917274,0.0000033672427,0.000005722211,0.000017525652,0.0000073780084,0.99381304,0.000029983757,0.005161993,0.00083400094,0.000005744492],"about_ca_topic_score_codex":0.05026655,"about_ca_topic_score_gemma":0.014329471,"teacher_disagreement_score":0.05026655,"about_ca_system_score_codex":0.0029388391,"about_ca_system_score_gemma":0.0014891416,"threshold_uncertainty_score":0.09994799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19542308,0.0008139349,0.79036325,0.00053314696,0.000032957825,0.0001914994,0.00067714223,0.00045561485,0.011509316],"genre_scores_gemma":[0.84676725,0.0009364208,0.14270474,0.000038444345,0.00001590403,0.00014188554,0.00074105925,0.0000881505,0.008566105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982446,0.00006476328,0.0000048721845,0.000033543296,0.000031047817,0.00004139406],"domain_scores_gemma":[0.99989235,0.00005391545,0.000021690443,0.00000731611,0.0000147723395,0.000009926517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003003027,0.00041285146,0.00034629638,0.00041608338,0.00058518536,0.00074659655,0.0006224743,0.00049533404,0.0030204195],"category_scores_gemma":[0.00046543064,0.0003442278,0.00039656158,0.0009459466,0.00035395316,0.0005359938,0.00027922983,0.0003285119,0.0002507905],"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.000019124816,0.000012014845,0.00035270967,0.000025268122,0.0000073800197,0.000026832287,0.000028272652,0.9831277,0.00073548703,0.003949496,0.00048324888,0.011232451],"study_design_scores_gemma":[0.000010577744,0.000021365591,0.0003789783,0.000004210233,0.000007703704,0.000020798532,0.00006556172,0.99291295,0.0004969943,0.0038782994,0.0021968104,0.00000571981],"about_ca_topic_score_codex":0.0487942,"about_ca_topic_score_gemma":0.07563871,"teacher_disagreement_score":0.0487942,"about_ca_system_score_codex":0.00185867,"about_ca_system_score_gemma":0.0021446357,"threshold_uncertainty_score":0.09702039},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23328754,0.00043179552,0.74988973,0.0017758994,0.0001247673,0.0009589355,0.0024133374,0.0011719943,0.00994596],"genre_scores_gemma":[0.5252818,0.0003801838,0.46818444,0.00034868403,0.00010540813,0.00065055146,0.0029587771,0.00023066571,0.0018595124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99247557,0.0031982958,0.0005377009,0.0014584764,0.001498621,0.0008312256],"domain_scores_gemma":[0.9422549,0.051393386,0.0019869814,0.0017673285,0.002021308,0.0005761896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068484917,0.0017165786,0.002188597,0.0022599073,0.0016511086,0.0048043323,0.0031581693,0.0032111928,0.007150842],"category_scores_gemma":[0.050074417,0.0018725744,0.0024982376,0.0030141054,0.0029136338,0.008061526,0.0026234665,0.003399508,0.0006853803],"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.0006170681,0.00039912917,0.00489076,0.00041756497,0.00031329456,0.0008668595,0.00022865554,0.880499,0.002760074,0.061327025,0.0038639095,0.04381676],"study_design_scores_gemma":[0.00012946375,0.00013708186,0.00046541344,0.00005038581,0.000046931425,0.00012842451,0.00019078582,0.9334374,0.0029724413,0.061043076,0.0013578867,0.000040598337],"about_ca_topic_score_codex":0.00901198,"about_ca_topic_score_gemma":0.007636299,"teacher_disagreement_score":0.00901198,"about_ca_system_score_codex":0.0015812379,"about_ca_system_score_gemma":0.0035618572,"threshold_uncertainty_score":0.036218762},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027948103,0.00027558373,0.9902896,0.00046215544,0.0000857688,0.000039908336,0.00025434347,0.0001290708,0.005668561],"genre_scores_gemma":[0.36643952,0.0039982824,0.59169877,0.00042217912,0.00071415235,0.0011689301,0.0014681186,0.0003268666,0.033763155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994261,0.00018578429,0.000027704767,0.00013383914,0.00015458581,0.000071877155],"domain_scores_gemma":[0.99950814,0.00021898924,0.00007902461,0.00005016915,0.0000781304,0.00006552595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010700189,0.0015754595,0.00084097986,0.00088874233,0.0010898546,0.0021908549,0.0028178336,0.0016441529,0.007644481],"category_scores_gemma":[0.0016131604,0.00059376,0.0017492924,0.0017088808,0.0011081732,0.0033464325,0.0013236003,0.0023311768,0.0013031617],"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.000009247059,0.000025137839,0.00009816131,0.000045632012,0.000018537532,0.00006131249,0.00007159875,0.39967042,0.00042062727,0.5928934,0.001601716,0.0050842436],"study_design_scores_gemma":[0.000011890519,0.000022715854,0.000061267216,0.000020548874,0.000021139407,0.000039008934,0.000029690302,0.7300978,0.00013828432,0.25754842,0.011996077,0.00001315671],"about_ca_topic_score_codex":0.0147834895,"about_ca_topic_score_gemma":0.013095617,"teacher_disagreement_score":0.0147834895,"about_ca_system_score_codex":0.0022544307,"about_ca_system_score_gemma":0.002295342,"threshold_uncertainty_score":0.029394925},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015706227,0.0069989404,0.0017942097,0.6547412,0.33237025,0.000015898424,0.00005682378,0.0000656756,0.0037999107],"genre_scores_gemma":[0.0039150957,0.007840765,0.0012411484,0.35208446,0.6263494,0.00003403561,0.000038664988,0.000102618214,0.008393822],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883031,0.0023516286,0.0015141908,0.0018284278,0.0051242816,0.00087848475],"domain_scores_gemma":[0.9682514,0.019414982,0.0022761307,0.0009569429,0.0075049843,0.0015954854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013729762,0.0017402704,0.0014442194,0.00096618757,0.004152176,0.008318312,0.005686064,0.030400028,0.007112116],"category_scores_gemma":[0.037884414,0.0007630988,0.0019684827,0.0013841683,0.0063294405,0.012061555,0.0025780322,0.03563833,0.003561135],"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.000018302253,0.00001302793,0.00009182161,0.00011469374,0.000010229008,0.00023293016,0.00016771763,0.0002122634,0.000069251386,0.012765676,0.9784882,0.00781588],"study_design_scores_gemma":[0.000020469231,0.000039485963,0.0002987551,0.0002202048,0.000018628438,0.00025978824,0.00025719102,0.0005330224,0.00010387522,0.009859605,0.9883537,0.000035233403],"about_ca_topic_score_codex":0.0061740805,"about_ca_topic_score_gemma":0.010039617,"teacher_disagreement_score":0.030400028,"about_ca_system_score_codex":0.0028666405,"about_ca_system_score_gemma":0.003847773,"threshold_uncertainty_score":0.072610795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06611857,0.00041336284,0.91548616,0.0007319813,0.00010580942,0.00018939718,0.00097475323,0.00042248904,0.015557362],"genre_scores_gemma":[0.8380411,0.00069594174,0.14511362,0.00017851134,0.0001274643,0.0003484642,0.00074699725,0.00015763429,0.014590249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856925,0.000504053,0.00005140144,0.00030747827,0.00021977667,0.00034802503],"domain_scores_gemma":[0.99818265,0.00079038943,0.00037180824,0.00027813576,0.00018494487,0.00019203697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016331683,0.0015698882,0.0010638534,0.0009167783,0.0005559347,0.0016715092,0.0027672327,0.0014566843,0.0072791646],"category_scores_gemma":[0.003997674,0.00091816165,0.0016913981,0.0020555807,0.0013275847,0.0031489774,0.0022090687,0.0017137243,0.0008644274],"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.00005071648,0.000025263922,0.00021660351,0.000052831085,0.000016358708,0.00008886822,0.000023145238,0.9328663,0.00062915427,0.058211766,0.001389321,0.0064296564],"study_design_scores_gemma":[0.000023681432,0.00004233077,0.00013416074,0.000011577887,0.000011873741,0.000051276293,0.000018013992,0.96347666,0.00025287404,0.034021426,0.0019437023,0.000012410876],"about_ca_topic_score_codex":0.0052713584,"about_ca_topic_score_gemma":0.00498238,"teacher_disagreement_score":0.0072791646,"about_ca_system_score_codex":0.0024038854,"about_ca_system_score_gemma":0.0015856955,"threshold_uncertainty_score":0.02435118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01412833,0.001695389,0.9601554,0.0018507591,0.00015368016,0.00028713094,0.0013701753,0.00039437794,0.019964704],"genre_scores_gemma":[0.65237564,0.0048428425,0.31823862,0.00038708316,0.00046623778,0.0019609025,0.0022168045,0.00029793635,0.0192139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978599,0.0011323587,0.00010975106,0.00027849403,0.00036976786,0.00024968854],"domain_scores_gemma":[0.99504316,0.0035505532,0.00049654505,0.00019019627,0.0005008601,0.00021867502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035956227,0.0026167338,0.0022757072,0.0017890383,0.0009428059,0.00435608,0.0034452854,0.003850735,0.00814967],"category_scores_gemma":[0.01047288,0.0012238958,0.0016053718,0.0027871614,0.0018377091,0.0040740864,0.002133834,0.0027869444,0.0007897689],"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.0000095888045,0.000012952203,0.00016540823,0.00004237102,0.000021831876,0.000033299544,0.000025822997,0.9477713,0.00004996056,0.048401196,0.0007915817,0.002674706],"study_design_scores_gemma":[0.000011631812,0.000010593855,0.000058432925,0.000015986468,0.000010799668,0.000009492152,0.000024906996,0.9571862,0.000044539185,0.040985275,0.0016340681,0.000007955228],"about_ca_topic_score_codex":0.018132338,"about_ca_topic_score_gemma":0.017949643,"teacher_disagreement_score":0.018132338,"about_ca_system_score_codex":0.0053205364,"about_ca_system_score_gemma":0.003150274,"threshold_uncertainty_score":0.038603365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008983225,0.00098965,0.9779889,0.00022784612,0.00010131063,0.00022093272,0.00029625167,0.0017723762,0.009419561],"genre_scores_gemma":[0.06337054,0.0005983866,0.92974967,0.00014197551,0.000043992706,0.00043882648,0.0006018922,0.00034066814,0.004713966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994844,0.00019893484,0.00002092926,0.000069831556,0.00016662893,0.0000591783],"domain_scores_gemma":[0.99963605,0.00017848771,0.000033543947,0.000042039286,0.00009229334,0.000017680633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065057,0.000990817,0.0010001303,0.001122452,0.00093657,0.0010249531,0.0013056981,0.001205682,0.00801649],"category_scores_gemma":[0.002062394,0.00051861384,0.0007391861,0.0021357578,0.00059786794,0.0010354745,0.0008725617,0.0012693928,0.0024853756],"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.00010908632,0.00015445291,0.00046719934,0.0002491245,0.00007884741,0.000111798545,0.00015699233,0.5209718,0.0035498224,0.032342177,0.017148407,0.4246604],"study_design_scores_gemma":[0.00008952298,0.00010643241,0.00022787166,0.000038202008,0.00003192388,0.00015710187,0.000049842543,0.9586847,0.0014907905,0.020151105,0.01894943,0.000023088216],"about_ca_topic_score_codex":0.0045452532,"about_ca_topic_score_gemma":0.004394821,"teacher_disagreement_score":0.00801649,"about_ca_system_score_codex":0.0007121965,"about_ca_system_score_gemma":0.0013036137,"threshold_uncertainty_score":0.026817858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039326593,0.00048505433,0.9514977,0.00035932948,0.000040287938,0.00017174044,0.00015642305,0.00021551063,0.0077474364],"genre_scores_gemma":[0.72697085,0.0004402542,0.2673175,0.00011249904,0.000044236713,0.00052050914,0.000170705,0.000058274414,0.004365274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944144,0.00026158342,0.000013913202,0.000085925654,0.000091972004,0.00010513174],"domain_scores_gemma":[0.9994273,0.0003669275,0.00007083728,0.00003146661,0.00006335097,0.00004007199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011380966,0.0011025775,0.0015281041,0.00063957565,0.00049465697,0.0015335995,0.0012080278,0.0016967594,0.0032291752],"category_scores_gemma":[0.0016281256,0.0010389433,0.0008553003,0.0009652679,0.0006322438,0.001008799,0.0010764078,0.0012969293,0.0002831068],"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.000011267421,0.0000133403855,0.000060183324,0.000016546359,0.000006299731,0.000018652212,0.000008255679,0.9957573,0.00010221295,0.0016011044,0.00008922964,0.002315579],"study_design_scores_gemma":[0.000014820918,0.000019412531,0.000028892444,0.000004795403,0.000006158512,0.00000599222,0.00000965297,0.99787617,0.00011762776,0.0016408031,0.00027294634,0.0000026449543],"about_ca_topic_score_codex":0.008215108,"about_ca_topic_score_gemma":0.007997069,"teacher_disagreement_score":0.008215108,"about_ca_system_score_codex":0.0018637611,"about_ca_system_score_gemma":0.0028461558,"threshold_uncertainty_score":0.016334593},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005315169,0.00013696848,0.99268264,0.00007888914,0.0000212173,0.00003477751,0.00001893007,0.00024775855,0.0014636196],"genre_scores_gemma":[0.1537185,0.00024667208,0.8423845,0.00015655032,0.00005550855,0.00032338427,0.00015165549,0.00015152669,0.0028116712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930406,0.00025256083,0.000022915503,0.00009490543,0.00025793447,0.00006765989],"domain_scores_gemma":[0.99896455,0.000687767,0.000077763965,0.00005812699,0.00013033561,0.00008153605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013896114,0.0006067745,0.0009978375,0.000638487,0.0005111171,0.00079970894,0.0015367036,0.0010417288,0.0028024416],"category_scores_gemma":[0.0027392402,0.00046779314,0.0005825981,0.00095120975,0.0007007201,0.0010036401,0.0011695275,0.0015733466,0.0005009097],"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.00011125332,0.00011860306,0.0006232374,0.00006351247,0.000053410782,0.00007015936,0.00007661964,0.83128697,0.0029443866,0.03931674,0.0022835147,0.123051666],"study_design_scores_gemma":[0.00001926684,0.000017946171,0.00003644823,0.0000033552633,0.0000041448056,0.000016555854,0.000003012513,0.99564004,0.00026664964,0.003383039,0.00060534925,0.000004157795],"about_ca_topic_score_codex":0.003923069,"about_ca_topic_score_gemma":0.0047971536,"teacher_disagreement_score":0.003923069,"about_ca_system_score_codex":0.0009063412,"about_ca_system_score_gemma":0.0015208182,"threshold_uncertainty_score":0.009375095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03641493,0.00026539736,0.95788676,0.0003250171,0.00004249972,0.00012730516,0.000072104966,0.00019688961,0.0046691345],"genre_scores_gemma":[0.891538,0.0003185697,0.102933,0.00009197664,0.000039753046,0.00027264177,0.00008621407,0.000056054472,0.0046637906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985668,0.0005744765,0.000043683092,0.00023400223,0.0003058118,0.00027525018],"domain_scores_gemma":[0.99891436,0.00054859236,0.00013400683,0.000056639175,0.00024734822,0.00009911689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016667879,0.0012553481,0.0014868502,0.00047260075,0.00078955747,0.0018030197,0.001587872,0.0012272642,0.0026710897],"category_scores_gemma":[0.0027385226,0.00082206004,0.0006389502,0.0008375803,0.0012082567,0.0013504719,0.001237856,0.0012080928,0.00037914194],"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.000029489058,0.000019393658,0.00010350493,0.000033178243,0.000007870677,0.00004539523,0.000031926105,0.9869468,0.00048191636,0.008390983,0.00018994218,0.0037195985],"study_design_scores_gemma":[0.000015255611,0.000025344376,0.000021417502,0.0000023935722,0.0000045549036,0.000009902658,0.000011606687,0.9954639,0.00013344883,0.003979507,0.0003296757,0.0000029524333],"about_ca_topic_score_codex":0.006320225,"about_ca_topic_score_gemma":0.005236362,"teacher_disagreement_score":0.006320225,"about_ca_system_score_codex":0.0029938307,"about_ca_system_score_gemma":0.0027437638,"threshold_uncertainty_score":0.0217219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69464195,0.00067362865,0.29429305,0.0009055613,0.000030106501,0.00014305675,0.0009910235,0.00031397122,0.008007572],"genre_scores_gemma":[0.9822075,0.0004834944,0.010238964,0.000045579887,0.000049826373,0.00008704895,0.00038094952,0.00006052375,0.006446042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779105,0.0010320194,0.000096478354,0.00044943969,0.00022209149,0.0004089698],"domain_scores_gemma":[0.9829692,0.0116285365,0.0033888798,0.00057542126,0.00061241037,0.0008255155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003546089,0.0013594532,0.0020279277,0.0019725037,0.0008314529,0.0024460647,0.0024767218,0.0019134122,0.0074483096],"category_scores_gemma":[0.0145820035,0.0013797903,0.0012021975,0.001989187,0.0026416227,0.004764323,0.0017241333,0.0015720063,0.0006584815],"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.00040315738,0.00007466674,0.0025302495,0.00006597529,0.000051339044,0.00030732976,0.00013154482,0.92713255,0.00051719625,0.06316419,0.0007199601,0.004901858],"study_design_scores_gemma":[0.000047930804,0.00006174277,0.0009322819,0.0000096218355,0.000024081637,0.00006572823,0.00006275421,0.9718554,0.00021424444,0.026417954,0.0002836554,0.000024500323],"about_ca_topic_score_codex":0.011091846,"about_ca_topic_score_gemma":0.009350133,"teacher_disagreement_score":0.011091846,"about_ca_system_score_codex":0.003073591,"about_ca_system_score_gemma":0.0009358418,"threshold_uncertainty_score":0.024917126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052715966,0.0004800248,0.99429375,0.00023671934,0.00005421989,0.00005145945,0.000094994575,0.00008746813,0.0041742763],"genre_scores_gemma":[0.08324745,0.0042788223,0.89511484,0.00024914477,0.0003976984,0.0011959422,0.0007055147,0.00029511598,0.014515413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998522,0.00056708226,0.00008238673,0.000211981,0.00048049638,0.00013603979],"domain_scores_gemma":[0.99835145,0.0010528798,0.00021034817,0.00014373654,0.00018211253,0.000059513277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026962892,0.002222123,0.0011756737,0.0018795308,0.0009859632,0.0027224077,0.003575376,0.0020291351,0.009859669],"category_scores_gemma":[0.0057395287,0.0011059132,0.0024464699,0.0024180962,0.0012270556,0.004101082,0.0020668278,0.0037377472,0.002582379],"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.000013441666,0.000052001087,0.00015459205,0.00014428473,0.000036486945,0.000048985417,0.00010492313,0.4946284,0.0002717295,0.47101274,0.004006824,0.029525595],"study_design_scores_gemma":[0.000011413713,0.000012022344,0.000034894067,0.000042588617,0.000013253771,0.00003450162,0.000028469742,0.79918134,0.00019391482,0.18729651,0.0131384,0.000012668612],"about_ca_topic_score_codex":0.005789107,"about_ca_topic_score_gemma":0.0051624365,"teacher_disagreement_score":0.009859669,"about_ca_system_score_codex":0.0019476551,"about_ca_system_score_gemma":0.0021207905,"threshold_uncertainty_score":0.0329839},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20096225,0.0054777744,0.7705454,0.0013595234,0.0001558945,0.000087074564,0.000044581448,0.00025496265,0.021112658],"genre_scores_gemma":[0.96319824,0.0010964609,0.03179807,0.00008866586,0.00007733899,0.000040073646,0.000027790677,0.000038655795,0.003634654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917454,0.00048072648,0.00002598079,0.00006076671,0.00017701965,0.00008099682],"domain_scores_gemma":[0.99852186,0.0010019668,0.00020693659,0.00007274958,0.00013002279,0.0000665956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017528106,0.00053390244,0.00047565773,0.00049801485,0.00059706613,0.001193327,0.0006667341,0.00075494254,0.0021068607],"category_scores_gemma":[0.0035994586,0.00030729952,0.00025762073,0.00083916803,0.0012067413,0.0016674425,0.00082189986,0.00083717535,0.00018874831],"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.00009761817,0.000027006256,0.00057160633,0.00006379022,0.000018009236,0.0001397136,0.00013679481,0.9244711,0.0012404239,0.025625573,0.0006962345,0.046912223],"study_design_scores_gemma":[0.000016200573,0.00008514462,0.00028887653,0.000020600086,0.000008750337,0.00011505211,0.00011920578,0.95731056,0.0012777073,0.038060952,0.0026826244,0.000014304742],"about_ca_topic_score_codex":0.0015281563,"about_ca_topic_score_gemma":0.0011212864,"teacher_disagreement_score":0.0021068607,"about_ca_system_score_codex":0.00078373484,"about_ca_system_score_gemma":0.00053468114,"threshold_uncertainty_score":0.009269834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7510451,0.0010786417,0.22110173,0.0013745293,0.000041551666,0.00010809046,0.00031585907,0.00009238327,0.024842154],"genre_scores_gemma":[0.9905434,0.00034580758,0.006331785,0.00002691691,0.000015426156,0.000039563824,0.000039146547,0.00003221397,0.0026257962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895084,0.0004905195,0.000030723586,0.00015613696,0.00016741516,0.00020430295],"domain_scores_gemma":[0.9966223,0.002251535,0.0005311667,0.00016261723,0.00019661098,0.00023570065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357603,0.0005893753,0.00074945536,0.0008877089,0.00080730347,0.0019750316,0.000961298,0.0010222056,0.0043645096],"category_scores_gemma":[0.006666803,0.0006528607,0.0009425773,0.0012423445,0.0023331451,0.003925765,0.0014728367,0.0007978315,0.00020157764],"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.000050675015,0.000024171699,0.0015803102,0.000036800786,0.000031280084,0.00021935799,0.00008309074,0.9308306,0.00037549494,0.062958695,0.00036524414,0.0034442141],"study_design_scores_gemma":[0.000042311174,0.00007344524,0.0025405644,0.000021763979,0.00003283484,0.000110646,0.00037469668,0.87330264,0.0003346116,0.121405914,0.0017306642,0.000029923393],"about_ca_topic_score_codex":0.0118604675,"about_ca_topic_score_gemma":0.012256806,"teacher_disagreement_score":0.0118604675,"about_ca_system_score_codex":0.003141105,"about_ca_system_score_gemma":0.00073941436,"threshold_uncertainty_score":0.023582876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068111187,0.00015488786,0.9871946,0.00034692255,0.00006709507,0.00009178429,0.00035196598,0.00018939721,0.004792275],"genre_scores_gemma":[0.29197207,0.0008559996,0.6858393,0.00033613684,0.00018648873,0.0008297131,0.0014085831,0.0002868421,0.01828486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991358,0.00029159966,0.000037245354,0.00017676564,0.00024809368,0.000110532856],"domain_scores_gemma":[0.99941146,0.00033510948,0.000075391334,0.00005371189,0.000070284514,0.00005395925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010915779,0.0011364488,0.0010471372,0.0007460578,0.00064088625,0.0013320645,0.0024265782,0.0014447469,0.0046968763],"category_scores_gemma":[0.0018523135,0.0007825278,0.0011826324,0.0017780159,0.00086409145,0.0022858111,0.0010064945,0.0018946924,0.0006737043],"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.00002664698,0.000036329482,0.00011638145,0.000051284544,0.000017415721,0.00006822499,0.000030435636,0.9526304,0.0007167264,0.037833903,0.0015224426,0.0069497926],"study_design_scores_gemma":[0.000011456274,0.00001411276,0.00003277149,0.000004091703,0.0000056404247,0.00001612501,0.000006156219,0.9867318,0.0001508422,0.010305545,0.0027162982,0.0000050246417],"about_ca_topic_score_codex":0.0073573235,"about_ca_topic_score_gemma":0.007982612,"teacher_disagreement_score":0.0073573235,"about_ca_system_score_codex":0.0017783093,"about_ca_system_score_gemma":0.0022124588,"threshold_uncertainty_score":0.015712619},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07458626,0.000875031,0.88055915,0.002357387,0.00011368404,0.00008434055,0.00016951979,0.00009181977,0.041162778],"genre_scores_gemma":[0.8823691,0.0018514713,0.10042888,0.00044477914,0.00017620412,0.00033736115,0.00023919875,0.00011160562,0.0140413465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990264,0.00046437664,0.000030723862,0.00016718116,0.00017140186,0.00013988199],"domain_scores_gemma":[0.99442047,0.0044491873,0.00030678915,0.000115808354,0.00053679215,0.0001709967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020477136,0.0008074678,0.0007839533,0.00067621394,0.0009714395,0.0020778102,0.001135608,0.002062292,0.0059062014],"category_scores_gemma":[0.014056,0.0003897151,0.00051816885,0.00084600126,0.002385737,0.003377017,0.0020425995,0.0016119159,0.0005142233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000098191325,0.000056249573,0.00027802694,0.00011687684,0.000020117857,0.00012042212,0.00026151488,0.079625756,0.0014715993,0.903999,0.0019070418,0.012045325],"study_design_scores_gemma":[0.00005370176,0.00009899993,0.00018760495,0.00007365207,0.00001291453,0.00009918675,0.00027068635,0.46054468,0.00090073305,0.53336734,0.004361948,0.000028524786],"about_ca_topic_score_codex":0.0023366583,"about_ca_topic_score_gemma":0.0010248462,"teacher_disagreement_score":0.0059062014,"about_ca_system_score_codex":0.0008142235,"about_ca_system_score_gemma":0.0014438116,"threshold_uncertainty_score":0.019758165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052445143,0.0002006192,0.9410711,0.0001716324,0.000055555814,0.00023040731,0.0003465354,0.00046848695,0.0050105606],"genre_scores_gemma":[0.53017384,0.0002327974,0.4644206,0.00008966443,0.00006416314,0.00040702254,0.00081998436,0.00011743341,0.0036744697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987464,0.00046414594,0.00004702964,0.00023698638,0.0003223116,0.00018318424],"domain_scores_gemma":[0.9989219,0.00041940942,0.00017598642,0.00026653006,0.00014488777,0.00007133635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134731,0.0010091426,0.0013175957,0.00085019664,0.0006344688,0.0015383931,0.0013802266,0.0008703429,0.0031082397],"category_scores_gemma":[0.0024595815,0.0007357162,0.0012886102,0.0028131746,0.00044074928,0.0017017089,0.0012851511,0.0012483924,0.00037600216],"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.000053351552,0.00008305304,0.0007422393,0.00004172455,0.00004444072,0.000063607964,0.000036411373,0.9547495,0.001100863,0.0053105815,0.0010590344,0.036715224],"study_design_scores_gemma":[0.000012011552,0.000037670314,0.00026484655,0.0000035192027,0.000013513249,0.00002269724,0.000018836332,0.9947872,0.0005622222,0.0029838972,0.0012867873,0.0000068262584],"about_ca_topic_score_codex":0.01741805,"about_ca_topic_score_gemma":0.018093606,"teacher_disagreement_score":0.01741805,"about_ca_system_score_codex":0.0010729097,"about_ca_system_score_gemma":0.0023065722,"threshold_uncertainty_score":0.03463334},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020936161,0.0035184068,0.8682029,0.008558266,0.0016365427,0.00018373069,0.00079570874,0.00023027744,0.09593804],"genre_scores_gemma":[0.62077135,0.013688393,0.3169011,0.0040594325,0.004468673,0.0004229662,0.0009245897,0.00030203882,0.038461514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986731,0.00049295503,0.00004967988,0.00022025485,0.00036357564,0.00020051489],"domain_scores_gemma":[0.9975545,0.0017858847,0.00020967053,0.00017757263,0.00016568661,0.00010672841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019980131,0.0015053643,0.001091215,0.00076606864,0.0011865044,0.0021674526,0.0021572453,0.0025691153,0.014841462],"category_scores_gemma":[0.0050909757,0.0005678599,0.0018018048,0.0012769562,0.0015153721,0.005072884,0.0029954966,0.0053253886,0.0014759789],"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.00014006771,0.00023008976,0.0006092846,0.0003672335,0.000065215354,0.0004108655,0.00017425226,0.19646357,0.0018789475,0.71295637,0.024804309,0.0618999],"study_design_scores_gemma":[0.00009865567,0.00033994945,0.0011532456,0.00019378151,0.00008058648,0.0003476106,0.00019077648,0.39160705,0.0011683172,0.5643448,0.04040566,0.00006948618],"about_ca_topic_score_codex":0.005605051,"about_ca_topic_score_gemma":0.0045450004,"teacher_disagreement_score":0.014841462,"about_ca_system_score_codex":0.001728152,"about_ca_system_score_gemma":0.0020684325,"threshold_uncertainty_score":0.049649656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8565379,0.0008285606,0.0020271733,0.0002919323,0.00007752414,0.00011107553,0.12495311,0.000095146665,0.01507771],"genre_scores_gemma":[0.8140461,0.00060775474,0.0019472536,0.00012309098,0.000048978607,0.00018236903,0.17929801,0.000029009372,0.0037174376],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9959403,0.0009100592,0.00088029105,0.00065292587,0.001257656,0.0003586583],"domain_scores_gemma":[0.9734176,0.009644432,0.009028493,0.003103527,0.0043521095,0.00045384673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029283743,0.00018164796,0.00029592888,0.004817752,0.0003907003,0.0008483463,0.0005767783,0.00037140757,0.006165675],"category_scores_gemma":[0.01770481,0.00017787924,0.00040045165,0.00699333,0.00018280988,0.00071654306,0.0011034034,0.0004927001,0.0019150841],"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.00014687666,0.000085289816,0.97105026,0.00014756546,0.00029066578,0.00011965143,0.0005826879,0.0006978328,0.00039655715,0.0007938786,0.006271963,0.019416636],"study_design_scores_gemma":[0.000003019333,0.000030244062,0.9916025,0.00002389062,0.000035125242,0.0001687139,0.00043792912,0.0004359517,0.00031291146,0.000100571655,0.0068368153,0.0000122489455],"about_ca_topic_score_codex":0.018790947,"about_ca_topic_score_gemma":0.027143037,"teacher_disagreement_score":0.018790947,"about_ca_system_score_codex":0.0006157294,"about_ca_system_score_gemma":0.0005692746,"threshold_uncertainty_score":0.03736317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03203605,0.0016296513,0.87186843,0.0025428045,0.0005363247,0.000410297,0.0037447487,0.00090013345,0.08633152],"genre_scores_gemma":[0.60445774,0.003459233,0.28888795,0.0007410501,0.0007534124,0.00066613697,0.007379524,0.00059257785,0.09306235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879646,0.0004097537,0.000051585033,0.00034468673,0.00018250449,0.00021500775],"domain_scores_gemma":[0.99915755,0.00042734406,0.000101190155,0.00009263054,0.00012899376,0.000092224975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079735124,0.0013136675,0.0011708596,0.0008134417,0.0009726648,0.002520224,0.0021281505,0.002960791,0.032574467],"category_scores_gemma":[0.0023428581,0.00052597345,0.0008481155,0.0017155707,0.0008174735,0.002778275,0.0017097831,0.0016945687,0.0043214923],"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.0003192325,0.00027180513,0.0012386584,0.000859058,0.00012761891,0.0010285345,0.00019899897,0.42241117,0.0024622192,0.3609698,0.072865985,0.13724682],"study_design_scores_gemma":[0.0001848634,0.00023655484,0.00071047887,0.00017094331,0.00009694277,0.0010131345,0.00056733383,0.6177192,0.0032232555,0.23988014,0.1361297,0.00006741105],"about_ca_topic_score_codex":0.002129671,"about_ca_topic_score_gemma":0.0020226412,"teacher_disagreement_score":0.032574467,"about_ca_system_score_codex":0.001002951,"about_ca_system_score_gemma":0.0015641073,"threshold_uncertainty_score":0.10897249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04615073,0.00053319463,0.948655,0.00019959144,0.00006177278,0.00009004119,0.000051594343,0.00021809689,0.0040399274],"genre_scores_gemma":[0.614056,0.00031609533,0.38148603,0.000092355804,0.000042245523,0.0002910362,0.00018641802,0.000105414016,0.00342438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960166,0.00018432393,0.000016908025,0.000055921642,0.00009231843,0.00004883982],"domain_scores_gemma":[0.9990231,0.0007176493,0.00006985907,0.00003881492,0.00008655871,0.00006392368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087612827,0.0005082912,0.0008887457,0.00074974715,0.00043335918,0.00050258695,0.0012525873,0.001207348,0.0017962056],"category_scores_gemma":[0.0027298203,0.0004211192,0.0006124907,0.0008951584,0.000697334,0.0010856352,0.0008700146,0.0006845956,0.0002153833],"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.00006324143,0.00004169131,0.0001949263,0.000035979865,0.000019779713,0.000042613778,0.00004721785,0.9664003,0.000573229,0.0077223,0.0007059531,0.024152754],"study_design_scores_gemma":[0.000017909526,0.000026481392,0.000042928685,0.0000045956444,0.0000038005023,0.000012533092,0.000010923981,0.9960995,0.00013739629,0.0032625333,0.00037653424,0.000004933389],"about_ca_topic_score_codex":0.0043842886,"about_ca_topic_score_gemma":0.006156559,"teacher_disagreement_score":0.0043842886,"about_ca_system_score_codex":0.00090359664,"about_ca_system_score_gemma":0.00092007115,"threshold_uncertainty_score":0.008717537},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026029369,0.0007032398,0.96863425,0.00023894559,0.00004536858,0.000109502056,0.000048877308,0.00021703048,0.003973462],"genre_scores_gemma":[0.45720956,0.00059328857,0.53796864,0.00016473127,0.00006297237,0.0005060084,0.0002607591,0.00011759426,0.0031165802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995074,0.00027786315,0.000016234337,0.00007316025,0.00008769606,0.000037641392],"domain_scores_gemma":[0.9988651,0.0008857664,0.00009511603,0.00003681434,0.000081673614,0.000035460635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010886245,0.00064977905,0.0010791755,0.0006971592,0.00051231746,0.0005268445,0.00094480003,0.0008741715,0.0017180624],"category_scores_gemma":[0.0027973547,0.00040469517,0.0004571054,0.0009032553,0.0005832293,0.0009222179,0.00065780943,0.00085880817,0.00022841454],"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.000032047534,0.000034885612,0.0001646341,0.000029092116,0.000013925854,0.000028742052,0.000016662741,0.9795958,0.0003175355,0.004339445,0.00063237705,0.01479486],"study_design_scores_gemma":[0.000009629697,0.000013902263,0.00002799729,0.0000027171109,0.0000024694505,0.0000068515888,0.0000045054435,0.9977399,0.0000812255,0.0018574317,0.00025144583,0.000001889726],"about_ca_topic_score_codex":0.0053616785,"about_ca_topic_score_gemma":0.00610383,"teacher_disagreement_score":0.0053616785,"about_ca_system_score_codex":0.00080242223,"about_ca_system_score_gemma":0.001029518,"threshold_uncertainty_score":0.010660946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01474734,0.016558584,0.9463648,0.0010954798,0.00047307898,0.0002264256,0.00030025138,0.0003987324,0.019835288],"genre_scores_gemma":[0.3238566,0.030479688,0.6104713,0.0007431524,0.0012202894,0.00078888476,0.0007587948,0.0005366235,0.03114469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954754,0.0001615892,0.00003091797,0.00007643548,0.00011389732,0.000069582085],"domain_scores_gemma":[0.9996296,0.00021000794,0.000067630375,0.0000384315,0.000031745854,0.00002255835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006777043,0.0012401728,0.0011215237,0.0007549576,0.00044855927,0.002201799,0.0010946253,0.0014582375,0.0029799133],"category_scores_gemma":[0.0014979857,0.00046312818,0.0011194923,0.002394651,0.00061522,0.0020454885,0.00067674037,0.0014758362,0.00072971435],"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.000095949035,0.00011662012,0.00035965574,0.0004931364,0.00013606242,0.00012115638,0.000077027034,0.74262005,0.0032333352,0.08553803,0.007893762,0.15931521],"study_design_scores_gemma":[0.000066880835,0.00017828106,0.00042278072,0.00013919463,0.00006183013,0.00026826042,0.00008670207,0.85443014,0.0041632894,0.09145794,0.048691858,0.00003280327],"about_ca_topic_score_codex":0.0025111064,"about_ca_topic_score_gemma":0.0017955763,"teacher_disagreement_score":0.0029799133,"about_ca_system_score_codex":0.0010569517,"about_ca_system_score_gemma":0.0011949001,"threshold_uncertainty_score":0.009968758},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008364656,0.000649143,0.98081505,0.0003611163,0.000096364,0.00015895725,0.0001088732,0.00015284278,0.00929307],"genre_scores_gemma":[0.23622207,0.0022680496,0.74387634,0.00023067527,0.00023078024,0.0012269353,0.00052673643,0.00029357223,0.015124859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916255,0.00044033007,0.000021502083,0.000083374376,0.00018249756,0.00010975651],"domain_scores_gemma":[0.9981933,0.0014228057,0.00009697256,0.00004481275,0.00015630345,0.00008566977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023310636,0.0016745398,0.001652719,0.0016195317,0.0008014579,0.0017516612,0.0011288659,0.0015812011,0.015736466],"category_scores_gemma":[0.005442774,0.0008959472,0.00092024874,0.0028738885,0.0009610568,0.0019921218,0.0011448719,0.0021210124,0.0013913765],"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.000098920835,0.0000788204,0.00036900633,0.0001690198,0.00003663462,0.00009174264,0.000064196756,0.8434949,0.0004915308,0.08225295,0.0047012926,0.068151005],"study_design_scores_gemma":[0.000020575573,0.000028253697,0.000028980647,0.00001134694,0.00000763179,0.000013614249,0.000007476902,0.97498655,0.00013361199,0.022640714,0.00211759,0.0000036729405],"about_ca_topic_score_codex":0.0047636363,"about_ca_topic_score_gemma":0.005437328,"teacher_disagreement_score":0.015736466,"about_ca_system_score_codex":0.0017843082,"about_ca_system_score_gemma":0.002525994,"threshold_uncertainty_score":0.052643716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014884392,0.0008208994,0.978522,0.000441834,0.000072226576,0.00016087896,0.00010709615,0.00020532626,0.0047853654],"genre_scores_gemma":[0.1844822,0.0018714991,0.8043836,0.00018817495,0.00015480164,0.0005467353,0.0005857067,0.00029517076,0.0074922247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988907,0.00047928732,0.000042202046,0.0001386231,0.00029334647,0.00015586513],"domain_scores_gemma":[0.99732816,0.002217482,0.00013807113,0.000083191546,0.00014788691,0.00008519931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027616262,0.0015109486,0.0014540926,0.0010724815,0.00096325454,0.002171499,0.0012219307,0.001568153,0.008339729],"category_scores_gemma":[0.0057711476,0.0010079963,0.0009848014,0.0021212343,0.0011836591,0.0032664263,0.0011768271,0.003376141,0.0009445466],"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.0003486796,0.00016547905,0.0005905412,0.0002982766,0.000071961585,0.0001956714,0.00014577871,0.6558555,0.0021240646,0.18400696,0.006503978,0.14969315],"study_design_scores_gemma":[0.000045611712,0.00007508999,0.00011951483,0.00002154668,0.000020381027,0.000047158872,0.000024353845,0.93026525,0.0007401511,0.06610714,0.002522007,0.000011861172],"about_ca_topic_score_codex":0.005807045,"about_ca_topic_score_gemma":0.0056617414,"teacher_disagreement_score":0.008339729,"about_ca_system_score_codex":0.0019867094,"about_ca_system_score_gemma":0.0023685102,"threshold_uncertainty_score":0.027899206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013580336,0.00041246595,0.97894645,0.00037474558,0.00007399452,0.00019095847,0.00016611704,0.00029933677,0.0059556323],"genre_scores_gemma":[0.18492311,0.0006612069,0.80473036,0.00015026827,0.00010412215,0.00054883066,0.00042820984,0.00020075985,0.00825306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952304,0.00021444289,0.000016695994,0.00007588886,0.000102042715,0.00006790072],"domain_scores_gemma":[0.99914134,0.00063502975,0.00004715294,0.000025966452,0.000097297016,0.00005316048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014079082,0.0010741164,0.0013341481,0.00088297355,0.0006083081,0.001260125,0.0013479571,0.001582043,0.010199721],"category_scores_gemma":[0.0020545784,0.0006567943,0.0007811949,0.0014305012,0.0005307624,0.0011983481,0.0007163501,0.0014793384,0.0009374396],"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.000087795124,0.00008366067,0.00025677233,0.00013375812,0.000033793425,0.00011868013,0.00005511296,0.914592,0.00085868436,0.0155706685,0.0031409236,0.06506807],"study_design_scores_gemma":[0.000028082683,0.00002536108,0.000028919903,0.0000063572356,0.0000059376216,0.000012741923,0.000008846002,0.9941168,0.00014960964,0.0047280625,0.0008857512,0.0000036296783],"about_ca_topic_score_codex":0.0064431923,"about_ca_topic_score_gemma":0.0068980544,"teacher_disagreement_score":0.010199721,"about_ca_system_score_codex":0.0011709717,"about_ca_system_score_gemma":0.0019415905,"threshold_uncertainty_score":0.034121454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09429652,0.00030018485,0.90057707,0.00035001326,0.000037220503,0.00015643451,0.00012944064,0.00018768721,0.0039653303],"genre_scores_gemma":[0.7317626,0.00018911886,0.26520115,0.00010510622,0.000038134967,0.00031588555,0.00021380286,0.0000525949,0.0021215838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942386,0.00030211196,0.00002342157,0.00009917879,0.0000688387,0.00008254391],"domain_scores_gemma":[0.9981592,0.0014273473,0.00013606068,0.000074662756,0.00011053925,0.00009218142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018790691,0.0008365083,0.0013632092,0.0007185582,0.00034937463,0.00094974943,0.0013132015,0.0016509041,0.0025352754],"category_scores_gemma":[0.0028556488,0.0008664763,0.0007306865,0.0009938793,0.00081127585,0.0011201756,0.00077767164,0.0010252559,0.00016131092],"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.000025626197,0.000021874435,0.00011653316,0.000014175242,0.000013927316,0.000020968098,0.00001016225,0.9932066,0.000106400636,0.0026400143,0.00015253271,0.0036712037],"study_design_scores_gemma":[0.000011609759,0.000016662963,0.000033603275,0.0000019427516,0.000003924466,0.000004306407,0.000006428269,0.9978472,0.00006182734,0.0019238839,0.000086250446,0.000002355687],"about_ca_topic_score_codex":0.005138972,"about_ca_topic_score_gemma":0.00437988,"teacher_disagreement_score":0.005138972,"about_ca_system_score_codex":0.0010217831,"about_ca_system_score_gemma":0.0015712455,"threshold_uncertainty_score":0.010218084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82182986,0.0005130869,0.15889414,0.00053047907,0.00008640813,0.0006765837,0.013527751,0.0009805963,0.0029610991],"genre_scores_gemma":[0.854436,0.00024767057,0.11641199,0.00008955051,0.000032363154,0.00044308294,0.026557231,0.00011216383,0.0016699195],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998995,0.00025643798,0.00008795658,0.00029087093,0.00028719168,0.0000823973],"domain_scores_gemma":[0.9977017,0.00076166267,0.0002734882,0.0004232545,0.0007756336,0.0000643645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012925583,0.0004620333,0.00029787637,0.0015615552,0.00057108974,0.0009017882,0.00077483774,0.00037346277,0.0005552235],"category_scores_gemma":[0.006486087,0.00022008574,0.0004238114,0.0021349876,0.00025779396,0.0004958785,0.00063749036,0.00039744322,0.00024363042],"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.000473943,0.00036125616,0.47904682,0.0006605743,0.00051008683,0.001202373,0.0016340845,0.1039774,0.011808208,0.005506981,0.014082132,0.3807362],"study_design_scores_gemma":[0.00006036594,0.00017138076,0.40485334,0.0001216242,0.00014543094,0.00053621264,0.0018646467,0.54707056,0.009148666,0.00307888,0.032841217,0.00010758191],"about_ca_topic_score_codex":0.22055644,"about_ca_topic_score_gemma":0.3139761,"teacher_disagreement_score":0.77944356,"about_ca_system_score_codex":0.0012360811,"about_ca_system_score_gemma":0.0018250047,"threshold_uncertainty_score":0.4385453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02012994,0.0008638652,0.96150047,0.0003124666,0.00011502934,0.0002755292,0.00034693987,0.0032776904,0.013178027],"genre_scores_gemma":[0.09944912,0.00037988552,0.89443004,0.00017426354,0.000041637715,0.0004989229,0.00066029065,0.00048337298,0.0038824095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934727,0.0003022372,0.00002367413,0.000084635074,0.00016145904,0.00008066622],"domain_scores_gemma":[0.9991793,0.00049435976,0.000063741725,0.0000725594,0.00016242114,0.00002760068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982203,0.0010928118,0.0011268095,0.001349825,0.0012861823,0.0014184909,0.0013648974,0.0017560591,0.0076359054],"category_scores_gemma":[0.0033371544,0.0006538049,0.00076150795,0.002842076,0.00070960587,0.0011424626,0.0008388798,0.0012647416,0.002276864],"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.00016850325,0.00019100732,0.000646781,0.00019854763,0.000086340166,0.00010741263,0.00016533444,0.6205952,0.0026043449,0.02608142,0.014543296,0.33461177],"study_design_scores_gemma":[0.0000661987,0.00007690865,0.00018734264,0.000027814944,0.000026116493,0.00007823207,0.000044778055,0.9830898,0.0011139939,0.008182419,0.007089355,0.000016985578],"about_ca_topic_score_codex":0.007160286,"about_ca_topic_score_gemma":0.006328925,"teacher_disagreement_score":0.0076359054,"about_ca_system_score_codex":0.001077711,"about_ca_system_score_gemma":0.001967238,"threshold_uncertainty_score":0.025544584},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006220654,0.46308333,0.17178531,0.046194393,0.016233344,0.00021673093,0.0013102836,0.00054821605,0.29440767],"genre_scores_gemma":[0.15579163,0.5691098,0.11103665,0.01305533,0.013672732,0.0003773102,0.0022873404,0.0004316627,0.13423754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99703777,0.0007950347,0.00023509676,0.00058149814,0.0011287065,0.00022192573],"domain_scores_gemma":[0.9974942,0.0010006325,0.00018265734,0.00037784764,0.00074027677,0.00020443196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032493297,0.0012175987,0.0010725367,0.0018514637,0.0016483042,0.0057666595,0.0019391277,0.0023442195,0.01530325],"category_scores_gemma":[0.008189115,0.0007156514,0.00089297665,0.0041943653,0.0032209696,0.006879554,0.0033030643,0.0036976545,0.0064468714],"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.00010298618,0.000058514066,0.0008135488,0.00065260637,0.00004902975,0.00013244814,0.00035244878,0.010977281,0.00033647454,0.6141763,0.056361858,0.31598657],"study_design_scores_gemma":[0.0000098379005,0.000041065363,0.0002557306,0.00061812665,0.000012723009,0.00015514232,0.00015853238,0.0027363128,0.00017905748,0.18953209,0.8062677,0.000033639444],"about_ca_topic_score_codex":0.004946911,"about_ca_topic_score_gemma":0.004037347,"teacher_disagreement_score":0.01530325,"about_ca_system_score_codex":0.004417795,"about_ca_system_score_gemma":0.0036598588,"threshold_uncertainty_score":0.05119449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082851,0.0005073605,0.9083697,0.0012313534,0.00004483827,0.000026361899,0.00007320439,0.000043781925,0.006852399],"genre_scores_gemma":[0.97197515,0.00047254472,0.025851,0.0001014081,0.00006442302,0.000036587673,0.000046167064,0.000030754305,0.0014218925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998569,0.0008125019,0.000044799013,0.000137932,0.00029736114,0.00013837022],"domain_scores_gemma":[0.9938571,0.004822352,0.00052355573,0.00019833747,0.0004147655,0.0001838788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029449696,0.0005763535,0.0006603899,0.00043740365,0.00048494712,0.0011499625,0.00074925856,0.0010238156,0.0016736647],"category_scores_gemma":[0.01028551,0.0007150747,0.000628592,0.0006804798,0.0014200323,0.0021776792,0.001051892,0.0014891897,0.00009119914],"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.000032995336,0.000022000457,0.0007848235,0.000056826593,0.000021832724,0.000065196575,0.00008660906,0.84933263,0.0008673503,0.14409067,0.00027617172,0.0043628844],"study_design_scores_gemma":[0.000008411245,0.00003590296,0.00024886985,0.000012309353,0.000008182189,0.000028447195,0.0000369971,0.9241416,0.00027159852,0.07434262,0.00085744687,0.000007608506],"about_ca_topic_score_codex":0.0029127807,"about_ca_topic_score_gemma":0.0019304107,"teacher_disagreement_score":0.0029449696,"about_ca_system_score_codex":0.0017397692,"about_ca_system_score_gemma":0.0009575622,"threshold_uncertainty_score":0.015574694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06741732,0.00093449705,0.9174399,0.00137025,0.00010850652,0.00011914882,0.0006712849,0.00018791994,0.01175112],"genre_scores_gemma":[0.8525875,0.001262436,0.13803753,0.00018360262,0.0001439166,0.00025993903,0.0009032502,0.00008368531,0.0065381182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878937,0.0006701816,0.000042478343,0.00018316033,0.00016899579,0.00014589814],"domain_scores_gemma":[0.998938,0.00064616976,0.00017635823,0.00005569245,0.00008100754,0.000102777754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011622875,0.00060392317,0.0007583726,0.00043823794,0.00058774464,0.0010169322,0.0008515546,0.0012294416,0.0022990347],"category_scores_gemma":[0.0020301763,0.00042791935,0.00079629273,0.00091052783,0.00069511816,0.0012929289,0.0008454742,0.0007832144,0.00030024286],"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.000058094116,0.000046658926,0.0006214851,0.00011128617,0.00004944788,0.00026537263,0.00005459832,0.9127121,0.00084635697,0.06952144,0.0020102232,0.013702907],"study_design_scores_gemma":[0.000031106403,0.00005165949,0.0003570748,0.000015715546,0.000018226528,0.00021682997,0.00005621238,0.9474509,0.00035273944,0.045749098,0.0056847613,0.000015686095],"about_ca_topic_score_codex":0.0039148964,"about_ca_topic_score_gemma":0.0036689253,"teacher_disagreement_score":0.0039148964,"about_ca_system_score_codex":0.0011960189,"about_ca_system_score_gemma":0.0018703617,"threshold_uncertainty_score":0.008677721},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24435998,0.00033898192,0.743993,0.00023539535,0.000083924075,0.00016184288,0.00024482707,0.0002059717,0.010376176],"genre_scores_gemma":[0.85733134,0.00029289717,0.137374,0.00005929448,0.000043798966,0.00014397468,0.00027471225,0.000075707205,0.004404182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994068,0.00027201168,0.000024492258,0.00007353359,0.000099778,0.0001234312],"domain_scores_gemma":[0.99913764,0.00040182823,0.00019406318,0.00011448177,0.00009103707,0.00006097071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000932759,0.00046116803,0.00044501454,0.00027873163,0.0006114411,0.0010668326,0.0010721383,0.0006472687,0.0015576895],"category_scores_gemma":[0.002247384,0.0003768115,0.00052678527,0.000822908,0.00067777955,0.0011050554,0.00045520088,0.0006749192,0.00019192055],"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.000046166624,0.00003701899,0.00066967774,0.000028055976,0.000020265976,0.00006011268,0.00005218777,0.9739933,0.0009725762,0.010307903,0.00041648667,0.013396264],"study_design_scores_gemma":[0.00001503314,0.000054613593,0.00051592314,0.000005546493,0.000010246393,0.000033057284,0.00009224648,0.9812044,0.0011816302,0.015329503,0.0015476787,0.000010090164],"about_ca_topic_score_codex":0.00720658,"about_ca_topic_score_gemma":0.008441958,"teacher_disagreement_score":0.00720658,"about_ca_system_score_codex":0.00076387945,"about_ca_system_score_gemma":0.0014003469,"threshold_uncertainty_score":0.014329255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014030613,0.043467343,0.9259491,0.0018639243,0.0002997875,0.000096826734,0.00052591146,0.00021536474,0.013551146],"genre_scores_gemma":[0.42629585,0.16282669,0.38377684,0.0007143793,0.004167335,0.0005016574,0.0015978913,0.00052276225,0.019596586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990375,0.000421487,0.00007063632,0.00020191696,0.00018441398,0.00008409641],"domain_scores_gemma":[0.9985843,0.0009448911,0.00018415741,0.00009639882,0.0001329525,0.000057389483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014066517,0.0023218808,0.002382287,0.0012131284,0.00059940584,0.0032316088,0.0029854293,0.002673367,0.002837763],"category_scores_gemma":[0.002927827,0.0012477344,0.0018508118,0.0030756812,0.0014115095,0.0046088565,0.0014607301,0.002395559,0.0008107616],"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.000046726447,0.0001225958,0.001108821,0.0008975355,0.000112445414,0.00017123639,0.00019763339,0.8038344,0.00052443927,0.14870553,0.003983509,0.040295117],"study_design_scores_gemma":[0.000017245073,0.000058590005,0.00023835464,0.00014821909,0.000060336566,0.000096135765,0.00009290017,0.9069547,0.00016087893,0.07615664,0.015990969,0.000025054416],"about_ca_topic_score_codex":0.005689904,"about_ca_topic_score_gemma":0.006348152,"teacher_disagreement_score":0.005689904,"about_ca_system_score_codex":0.0014925842,"about_ca_system_score_gemma":0.00150977,"threshold_uncertainty_score":0.011313617},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055573706,0.0014650073,0.91330385,0.0016194022,0.00015980426,0.00012397236,0.00045646678,0.0002088871,0.027088897],"genre_scores_gemma":[0.88071734,0.0026884973,0.09168971,0.00034660893,0.00022809538,0.00047096098,0.00045224995,0.00010894068,0.023297526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945587,0.00022331251,0.000019502355,0.00007839328,0.00011735275,0.00010549935],"domain_scores_gemma":[0.99898094,0.0006109574,0.00017100891,0.00004240508,0.00010907932,0.000085556945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009630403,0.0012108098,0.0011704804,0.00094961596,0.0007954983,0.0015625138,0.0020273256,0.0018594655,0.006316908],"category_scores_gemma":[0.0028481907,0.00049843016,0.0014740938,0.0011746208,0.001373314,0.001723408,0.0013536252,0.0019458568,0.00057090446],"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.000013892183,0.000021414853,0.00020471189,0.000028410193,0.000015653612,0.00004433517,0.000059890594,0.8937762,0.00015583776,0.102534786,0.0009662093,0.002178651],"study_design_scores_gemma":[0.000010454139,0.00001903342,0.000113925955,0.000008654173,0.000011417682,0.000022220192,0.000027528753,0.9156139,0.000045439432,0.083015926,0.0011019817,0.000009576511],"about_ca_topic_score_codex":0.008660513,"about_ca_topic_score_gemma":0.009270798,"teacher_disagreement_score":0.008660513,"about_ca_system_score_codex":0.0017927651,"about_ca_system_score_gemma":0.0011719977,"threshold_uncertainty_score":0.021132112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47964972,0.0014874863,0.48555794,0.0015537243,0.00016338157,0.00038328403,0.0005386147,0.00051776785,0.030148033],"genre_scores_gemma":[0.978002,0.00038379652,0.016677674,0.000084477884,0.000036735906,0.00009230114,0.00009480755,0.00004426947,0.0045839227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987626,0.0005622351,0.000039034516,0.00020122924,0.00012279692,0.00031212234],"domain_scores_gemma":[0.99836093,0.0008418485,0.00029700363,0.00009799362,0.00018238575,0.00021982282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018807864,0.0013622735,0.0017888953,0.0008397611,0.00065802573,0.0020617063,0.0017918079,0.002544304,0.006982044],"category_scores_gemma":[0.0050857957,0.0008868061,0.0007803816,0.00096882985,0.0012541888,0.004498946,0.0010612246,0.0015303515,0.00072898937],"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.00036239892,0.0001469865,0.0009476086,0.00011814437,0.00005812633,0.00018265258,0.00007800285,0.9470346,0.002084881,0.03486802,0.0016524333,0.012466087],"study_design_scores_gemma":[0.000076363925,0.00023259573,0.0013065736,0.00003196714,0.000049218237,0.000086403685,0.00014219365,0.9693899,0.0011824397,0.025833901,0.0016217055,0.00004677686],"about_ca_topic_score_codex":0.0067642606,"about_ca_topic_score_gemma":0.0043232944,"teacher_disagreement_score":0.006982044,"about_ca_system_score_codex":0.002916902,"about_ca_system_score_gemma":0.0014405141,"threshold_uncertainty_score":0.023357332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22956032,0.0020661938,0.74038297,0.0045193806,0.0001565496,0.000797863,0.0014780582,0.00037676428,0.020661851],"genre_scores_gemma":[0.62585336,0.0023211085,0.362059,0.00044192985,0.00033351648,0.00084002345,0.0021456028,0.0002257189,0.0057797874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655414,0.0012902203,0.0001566245,0.0005806875,0.00081747153,0.00060094614],"domain_scores_gemma":[0.97088575,0.026654014,0.00087540597,0.0005909346,0.00071849785,0.00027540303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036709565,0.0014400306,0.0014990745,0.0012346208,0.0010430212,0.003256041,0.0018252408,0.0019477672,0.0058930237],"category_scores_gemma":[0.02275747,0.0010058015,0.0030977938,0.0016593892,0.001761028,0.0056879967,0.0018562963,0.0037730825,0.000324434],"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.0009121014,0.0005039973,0.0034117359,0.0011690835,0.00021583613,0.0005859586,0.00051419396,0.7998813,0.0050468324,0.117788404,0.0064365095,0.06353402],"study_design_scores_gemma":[0.00013524058,0.00015785493,0.0010099078,0.00006610085,0.00009007084,0.0002990057,0.00022486152,0.90728563,0.0019109685,0.08574419,0.0030307812,0.000045414723],"about_ca_topic_score_codex":0.0057858806,"about_ca_topic_score_gemma":0.0039161607,"teacher_disagreement_score":0.0058930237,"about_ca_system_score_codex":0.0026019723,"about_ca_system_score_gemma":0.002872498,"threshold_uncertainty_score":0.019714117},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20906705,0.0009569975,0.761265,0.001753745,0.0000824338,0.00011085467,0.00018942269,0.00016102487,0.026413517],"genre_scores_gemma":[0.9513852,0.00075571064,0.0408187,0.00018996921,0.00006337856,0.00021982493,0.00008524403,0.00008063657,0.0064011454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828005,0.0007651301,0.00004281976,0.00026931023,0.0002016569,0.0004409379],"domain_scores_gemma":[0.99111605,0.006393007,0.00085103465,0.0003388438,0.00079146447,0.00050956686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039054279,0.0008367754,0.0020194328,0.0013674385,0.0016825349,0.002101412,0.0022583727,0.002146554,0.007121587],"category_scores_gemma":[0.014627184,0.0008874468,0.0015148044,0.0008331291,0.0047758548,0.0047998047,0.0033160155,0.0020578376,0.000644608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00012270709,0.00008371824,0.0010511165,0.0001310175,0.00006246178,0.00019296602,0.0002818926,0.23605682,0.0012696999,0.7547045,0.0010223617,0.0050207786],"study_design_scores_gemma":[0.000053023854,0.00008385877,0.00028287925,0.000052808922,0.000030191834,0.00007567849,0.00019544308,0.65451825,0.00039539763,0.34305066,0.0012218059,0.00004004669],"about_ca_topic_score_codex":0.0052791876,"about_ca_topic_score_gemma":0.0030342226,"teacher_disagreement_score":0.007121587,"about_ca_system_score_codex":0.0021768266,"about_ca_system_score_gemma":0.0029505333,"threshold_uncertainty_score":0.023824096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007567392,0.00020355039,0.987153,0.00027461554,0.000047413097,0.00016463635,0.0001321478,0.0004946046,0.003962667],"genre_scores_gemma":[0.0937363,0.00026780515,0.90181184,0.00014911301,0.000047731977,0.00032920242,0.0005147049,0.00022051034,0.0029226334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993625,0.00021417158,0.000027629812,0.00012105323,0.00014797758,0.00012671179],"domain_scores_gemma":[0.99891233,0.0007450871,0.00007726374,0.00007767821,0.00011758864,0.00007011769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010830087,0.0012169216,0.0012482491,0.0009313245,0.0008756016,0.001338474,0.0015819097,0.00160118,0.009493888],"category_scores_gemma":[0.002512362,0.00072976167,0.00091923046,0.0015017443,0.00058907736,0.0017924509,0.001159348,0.002231617,0.0015794331],"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.00015358464,0.00025054233,0.00063416903,0.00017696411,0.00005198668,0.00012048883,0.000110070396,0.75699437,0.0020143753,0.0380303,0.010667906,0.19079518],"study_design_scores_gemma":[0.00005348944,0.000052428855,0.000084817744,0.000010084664,0.00000996151,0.000036339894,0.000023970691,0.98336756,0.0005331321,0.013647491,0.0021725749,0.000008205187],"about_ca_topic_score_codex":0.0060261404,"about_ca_topic_score_gemma":0.0078067123,"teacher_disagreement_score":0.009493888,"about_ca_system_score_codex":0.0014178029,"about_ca_system_score_gemma":0.002127115,"threshold_uncertainty_score":0.031760216},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057720836,0.0001593291,0.919227,0.00049598,0.00005042162,0.00045149613,0.0002848535,0.00038118666,0.021228943],"genre_scores_gemma":[0.5269989,0.0005354995,0.45814526,0.00006710105,0.00002148015,0.00064240425,0.00041807024,0.00011580806,0.013055491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990552,0.00039283704,0.000030891042,0.00018297232,0.0001752796,0.00016284826],"domain_scores_gemma":[0.9991553,0.00024662344,0.00011355897,0.000055473578,0.00031640573,0.00011269943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010028506,0.0007046923,0.0005514688,0.0019745163,0.001639286,0.0014596871,0.0013573562,0.0014582096,0.006630275],"category_scores_gemma":[0.0026521701,0.00060301844,0.00062468665,0.0015789166,0.00090141024,0.0018567152,0.0014549473,0.00058505737,0.0010554509],"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.00007844138,0.00008538956,0.0014879314,0.00012831517,0.000027095743,0.00021863478,0.0002035985,0.9013855,0.00634742,0.047993902,0.0018040863,0.04023968],"study_design_scores_gemma":[0.000037493122,0.00012104199,0.00060453994,0.000030315057,0.00004401167,0.000095642754,0.00044689968,0.9587766,0.0032507295,0.022594461,0.013966767,0.000031570264],"about_ca_topic_score_codex":0.026161596,"about_ca_topic_score_gemma":0.048342198,"teacher_disagreement_score":0.026161596,"about_ca_system_score_codex":0.002900469,"about_ca_system_score_gemma":0.00372545,"threshold_uncertainty_score":0.052018642},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0908509,0.002650295,0.8796239,0.0011040026,0.00013114607,0.00024411958,0.00068754464,0.00035270044,0.024355324],"genre_scores_gemma":[0.55584306,0.0026708632,0.43312472,0.0004038009,0.0002250433,0.00057834695,0.001314114,0.00024591712,0.005594268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990096,0.00048584375,0.00003105744,0.0000975019,0.00021503231,0.00016088305],"domain_scores_gemma":[0.99741745,0.001969033,0.00030673313,0.00012491245,0.00012064675,0.00006119259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015089931,0.0014215668,0.00096184225,0.0011200992,0.000595175,0.0014117676,0.001522246,0.0010375081,0.0045161615],"category_scores_gemma":[0.006394053,0.0005059646,0.0010740064,0.0026814535,0.0015153432,0.0018873124,0.0010662738,0.0024618683,0.0003799711],"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.00013838014,0.00009248943,0.00062293396,0.00028422763,0.00007658741,0.0000995233,0.00009799285,0.825759,0.0008936346,0.12414849,0.003517582,0.044269294],"study_design_scores_gemma":[0.00003882135,0.00007792945,0.00030675952,0.00004095955,0.000022806684,0.00004063568,0.000032654178,0.9305932,0.00075241574,0.06581043,0.0022669868,0.000016350456],"about_ca_topic_score_codex":0.007191292,"about_ca_topic_score_gemma":0.008210295,"teacher_disagreement_score":0.007191292,"about_ca_system_score_codex":0.0015348654,"about_ca_system_score_gemma":0.0019726935,"threshold_uncertainty_score":0.015108049},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10397761,0.0004751849,0.88405216,0.00026292203,0.00003843413,0.00018951185,0.00015929349,0.00094195065,0.009902953],"genre_scores_gemma":[0.5816013,0.00026076747,0.41492495,0.00011786464,0.000026959333,0.00041284852,0.0003113197,0.00012222321,0.0022216733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932075,0.00031880083,0.00002171214,0.0000792129,0.00014395858,0.00011562179],"domain_scores_gemma":[0.9993686,0.00037604503,0.000085941036,0.00008097409,0.00005411592,0.000034400633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011334518,0.0008051686,0.0010213709,0.0010233783,0.0005338847,0.0012155581,0.0016721674,0.0012643954,0.002647427],"category_scores_gemma":[0.0019772414,0.0006608,0.0007428936,0.0018903221,0.0006208204,0.0009570121,0.0008012983,0.0007616233,0.0004102292],"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.000067998284,0.00006222504,0.00029124945,0.000045438843,0.000026486478,0.000045009278,0.000053210348,0.96831435,0.0006685,0.00574737,0.0008142503,0.023863876],"study_design_scores_gemma":[0.000026558797,0.000024283238,0.000057494566,0.000006423945,0.000009067979,0.000014159006,0.000023351513,0.9968432,0.00024077577,0.0023103377,0.00044072274,0.0000036387025],"about_ca_topic_score_codex":0.007916004,"about_ca_topic_score_gemma":0.0072450903,"teacher_disagreement_score":0.007916004,"about_ca_system_score_codex":0.00096985634,"about_ca_system_score_gemma":0.0016631711,"threshold_uncertainty_score":0.015739858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4217841,0.00029600048,0.56173116,0.00042872116,0.00007691687,0.00031265532,0.0007856437,0.00075819157,0.013826654],"genre_scores_gemma":[0.8427993,0.0004072713,0.14318717,0.000063928535,0.000021463224,0.00020469564,0.0007388796,0.00013517459,0.012442058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996917,0.00009232639,0.000016691838,0.000066576285,0.0000581,0.00007451911],"domain_scores_gemma":[0.9996094,0.00011852282,0.000089198125,0.00007296425,0.000040496085,0.00006934776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003294726,0.0005847305,0.0006518172,0.00030641453,0.0003921552,0.0009582069,0.0008164898,0.0006286866,0.0054421676],"category_scores_gemma":[0.0008520891,0.00049349916,0.0004834037,0.00096142764,0.00034839712,0.0015256092,0.00066825515,0.00054669473,0.00079133466],"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.00044130927,0.000122571,0.0019098717,0.00013945017,0.000053042557,0.00026563802,0.00013662495,0.91875994,0.008710053,0.032903355,0.0020722577,0.034485955],"study_design_scores_gemma":[0.000060002025,0.00016762587,0.0005201116,0.000007913016,0.000015309603,0.0000699891,0.000072354866,0.9755039,0.0023195297,0.015625253,0.005624389,0.000013636472],"about_ca_topic_score_codex":0.00819703,"about_ca_topic_score_gemma":0.01071904,"teacher_disagreement_score":0.00819703,"about_ca_system_score_codex":0.00067902834,"about_ca_system_score_gemma":0.0010725096,"threshold_uncertainty_score":0.018205881},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039135415,0.0014688617,0.9465962,0.0006137228,0.0002351618,0.00032970734,0.0007107115,0.0002445403,0.010665743],"genre_scores_gemma":[0.37077668,0.0042872145,0.6031479,0.00027258758,0.0005606945,0.00082748244,0.0015480592,0.00023560721,0.018343816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833566,0.00069945713,0.00009597859,0.00035374897,0.00030991223,0.00020529964],"domain_scores_gemma":[0.9988446,0.0007915874,0.00015668746,0.00007802695,0.000075050666,0.00005403032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001366149,0.0022500043,0.001987272,0.0008166303,0.0008375411,0.0023916252,0.002466794,0.0021134024,0.0044666096],"category_scores_gemma":[0.0035931587,0.0011555733,0.0014866416,0.0028127625,0.0009219092,0.00335759,0.0010086534,0.0022080524,0.0005709006],"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.00009731771,0.00013349103,0.00038444487,0.0003239367,0.000090427464,0.00023245155,0.00005294989,0.9039403,0.00078890746,0.053459477,0.002338624,0.038157642],"study_design_scores_gemma":[0.000042091167,0.00009785986,0.00028386715,0.000020912208,0.00005535904,0.00014759328,0.000051073457,0.9563344,0.00062170625,0.03733673,0.004981972,0.00002639631],"about_ca_topic_score_codex":0.006641736,"about_ca_topic_score_gemma":0.00540027,"teacher_disagreement_score":0.006641736,"about_ca_system_score_codex":0.0015266496,"about_ca_system_score_gemma":0.0027934771,"threshold_uncertainty_score":0.014942348},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01940219,0.00039857475,0.9725762,0.0005686253,0.000052888987,0.0002767355,0.00035807796,0.00055731926,0.005809417],"genre_scores_gemma":[0.115865074,0.00036087085,0.8791915,0.00014822869,0.000046972018,0.000544472,0.00078749086,0.00015821295,0.0028971084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912196,0.00038779783,0.000036796846,0.00015676087,0.00015430401,0.00014230656],"domain_scores_gemma":[0.99831426,0.0012788739,0.00010487274,0.00005510407,0.00015512956,0.00009177773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018915172,0.0016834403,0.0017472793,0.0011275617,0.000991624,0.0017356316,0.001971448,0.0025996554,0.008339256],"category_scores_gemma":[0.0032504515,0.0010637272,0.00092675426,0.0019651074,0.00069852854,0.0016581188,0.0012302638,0.0020687475,0.0009955794],"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.00012315801,0.00017799667,0.0003482532,0.00012330046,0.000037975533,0.00009222465,0.000065671244,0.9254643,0.0005134252,0.01371935,0.0035014565,0.055833034],"study_design_scores_gemma":[0.00005681417,0.000032842534,0.00004194819,0.000010195541,0.000008926593,0.000015176816,0.000017554816,0.9910942,0.0001617004,0.0077117723,0.00084428495,0.000004549277],"about_ca_topic_score_codex":0.007885685,"about_ca_topic_score_gemma":0.007389176,"teacher_disagreement_score":0.008339256,"about_ca_system_score_codex":0.0017624157,"about_ca_system_score_gemma":0.0025737223,"threshold_uncertainty_score":0.027897596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11733418,0.0020606327,0.8250027,0.0009351343,0.0002412033,0.00022859569,0.00063284405,0.00033932205,0.05322549],"genre_scores_gemma":[0.66960514,0.001639905,0.3059762,0.00016555634,0.00009429742,0.00026993948,0.000654458,0.00020009786,0.021394465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985077,0.00074923853,0.00007388396,0.00022169024,0.0002879979,0.0001593565],"domain_scores_gemma":[0.998976,0.0006289361,0.00014157071,0.00011185299,0.00009853977,0.000043146658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016982154,0.0005183319,0.00045240813,0.0004982974,0.00057500263,0.0016752478,0.0011562962,0.0010468579,0.0033045954],"category_scores_gemma":[0.0039024707,0.0004786585,0.00083808164,0.0009305616,0.000754767,0.0016478804,0.00092026143,0.00093525613,0.00047843883],"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.00017038181,0.000063108164,0.001183562,0.00013335368,0.00004811838,0.00029605292,0.00019515565,0.6316243,0.001613168,0.28966358,0.0046934653,0.07031573],"study_design_scores_gemma":[0.000067699104,0.00007932298,0.0008529849,0.00005912901,0.00004476268,0.00021001157,0.00019031389,0.7914799,0.0035694954,0.16493943,0.038457382,0.000049538132],"about_ca_topic_score_codex":0.010452856,"about_ca_topic_score_gemma":0.00980784,"teacher_disagreement_score":0.010452856,"about_ca_system_score_codex":0.0009281045,"about_ca_system_score_gemma":0.0015700894,"threshold_uncertainty_score":0.02078402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89612305,0.0013736391,0.083070524,0.00048181272,0.000055367975,0.00016709909,0.00046982593,0.00018536428,0.018073399],"genre_scores_gemma":[0.9802101,0.0005891814,0.017805079,0.000031469204,0.000016469252,0.000066633955,0.0005350823,0.000037538233,0.00070836645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914753,0.00039482277,0.0000394783,0.00011254669,0.00020856991,0.00009709647],"domain_scores_gemma":[0.9985165,0.00078912685,0.00026512519,0.00012427257,0.00024814974,0.000056838428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023490398,0.0010470324,0.000763893,0.0015435184,0.00043718642,0.0012833024,0.0007993577,0.00095667073,0.0007010848],"category_scores_gemma":[0.0030188793,0.00028680512,0.0010020884,0.0017031392,0.00079318165,0.0012676338,0.00072552654,0.00060897757,0.000079839876],"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.000048337857,0.000070026515,0.0028790424,0.000028076303,0.000028478162,0.000018280196,0.000016205213,0.9879544,0.00020293999,0.0012106365,0.00028326007,0.0072602695],"study_design_scores_gemma":[0.000009257189,0.00011601083,0.005647205,0.000011594263,0.000035682715,0.000014885215,0.00007966467,0.9920786,0.00063676847,0.000712341,0.0006451654,0.000012746967],"about_ca_topic_score_codex":0.030215664,"about_ca_topic_score_gemma":0.017925343,"teacher_disagreement_score":0.030215664,"about_ca_system_score_codex":0.0025432862,"about_ca_system_score_gemma":0.001028937,"threshold_uncertainty_score":0.060079575},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062067214,0.00027989614,0.9244603,0.00051041757,0.000031353862,0.00008449476,0.00017844877,0.00016324095,0.012224738],"genre_scores_gemma":[0.91566384,0.00038349218,0.08033663,0.00006684218,0.000024154071,0.00011571651,0.00011159689,0.000040146617,0.0032574802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989222,0.00056094036,0.000027870188,0.0001716318,0.00012456042,0.00019275946],"domain_scores_gemma":[0.9986078,0.0008349653,0.00017529787,0.00008678635,0.00015241098,0.00014270304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014292614,0.0005632865,0.00066060957,0.0006343016,0.00064392795,0.0012121899,0.001141346,0.00089372444,0.004101111],"category_scores_gemma":[0.0036502522,0.00045820107,0.00054889737,0.00096850033,0.0010901022,0.0020766489,0.0013705128,0.0008336433,0.00026535045],"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.00006474261,0.000029947088,0.0005241722,0.00007202641,0.000015107391,0.00006676993,0.000072902265,0.90283924,0.0008680246,0.080220036,0.0009424281,0.014284587],"study_design_scores_gemma":[0.000017578086,0.000044161814,0.0001727594,0.000014091493,0.0000104864785,0.000046343986,0.00008319355,0.92115694,0.00058504177,0.07495142,0.0029095893,0.000008314575],"about_ca_topic_score_codex":0.0045822607,"about_ca_topic_score_gemma":0.0053700614,"teacher_disagreement_score":0.0045822607,"about_ca_system_score_codex":0.0024108067,"about_ca_system_score_gemma":0.0015462296,"threshold_uncertainty_score":0.017491758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004553008,0.0001313509,0.9915257,0.00009039746,0.000026155585,0.000045637822,0.000063119034,0.00011523537,0.003449449],"genre_scores_gemma":[0.11535299,0.00030588565,0.879892,0.0000965893,0.000048656326,0.00020328007,0.00022473796,0.000093453964,0.0037824064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991328,0.00031459812,0.000034546756,0.00012087084,0.0002939696,0.00010326304],"domain_scores_gemma":[0.9993197,0.00036618274,0.000057716385,0.00011217385,0.00011397924,0.000030316545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049489,0.0007751915,0.0008190821,0.0006643998,0.0005854649,0.00089592114,0.001269639,0.00074058183,0.0074470188],"category_scores_gemma":[0.0030717975,0.0005238503,0.0006952553,0.0013408598,0.0005347915,0.0014531424,0.0010751161,0.0011430569,0.0008703567],"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.000043317785,0.00007959188,0.0004225106,0.00015533139,0.000023872646,0.000070681745,0.00007604306,0.8203013,0.0010418531,0.05649786,0.003434956,0.117852665],"study_design_scores_gemma":[0.000019348327,0.00003831645,0.00008624441,0.000012559544,0.000008259476,0.000051232993,0.0000311941,0.958761,0.00034870527,0.036981903,0.0036535952,0.000007702856],"about_ca_topic_score_codex":0.0062694717,"about_ca_topic_score_gemma":0.0092163645,"teacher_disagreement_score":0.0074470188,"about_ca_system_score_codex":0.0008902988,"about_ca_system_score_gemma":0.0025121504,"threshold_uncertainty_score":0.024912715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018878262,0.0002971157,0.9667331,0.00054785545,0.000084515734,0.00012985163,0.0003055624,0.00021772826,0.012806056],"genre_scores_gemma":[0.5397736,0.0011480282,0.44326246,0.0003859528,0.00010763585,0.00050091685,0.0006778426,0.00022529051,0.013918269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992569,0.00031786307,0.000020075164,0.000089680485,0.00019136492,0.0001240849],"domain_scores_gemma":[0.99943024,0.00028386578,0.000052645973,0.000042298478,0.00013851147,0.000052303923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007930986,0.001038639,0.0006767197,0.0005192836,0.00047725,0.0013256182,0.0009377023,0.0010862905,0.0050620707],"category_scores_gemma":[0.0019078909,0.00052755786,0.00066232425,0.0011551705,0.00073622784,0.0011236238,0.0008689661,0.0010446477,0.00058588246],"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.000021776817,0.000017929187,0.00014021732,0.000054316413,0.000010779854,0.000058420293,0.000019685389,0.96213865,0.0007932327,0.026125599,0.0015427364,0.0090766],"study_design_scores_gemma":[0.000009044805,0.000015792437,0.000026298134,0.0000062784798,0.000004723128,0.000018723227,0.00001448582,0.98767823,0.00033893672,0.009280297,0.0026038534,0.0000033697293],"about_ca_topic_score_codex":0.01036085,"about_ca_topic_score_gemma":0.0095495125,"teacher_disagreement_score":0.01036085,"about_ca_system_score_codex":0.0017017826,"about_ca_system_score_gemma":0.0024698137,"threshold_uncertainty_score":0.020601034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030402133,0.02167135,0.78950775,0.017958995,0.008501929,0.000071329734,0.00036365903,0.00027938883,0.1312435],"genre_scores_gemma":[0.6573772,0.04368865,0.19591601,0.0058031636,0.023613216,0.00024127099,0.0005254126,0.0006268203,0.072208196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995931,0.00014271773,0.000023327842,0.000041319374,0.00016853955,0.000031062125],"domain_scores_gemma":[0.9990402,0.00065614877,0.00006891,0.00007489074,0.00010771932,0.00005210755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010019481,0.00076359237,0.00062511396,0.0007134785,0.00086774165,0.0011802657,0.00072781666,0.0010730042,0.0031872308],"category_scores_gemma":[0.0030638594,0.00030966548,0.0009786027,0.00049272896,0.0024731783,0.0027938825,0.0014950011,0.0029296833,0.0006853042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000013043504,0.00001082049,0.00012610342,0.000094022376,0.000011485532,0.00016371917,0.00009657452,0.0132864015,0.0009065171,0.97002643,0.00628159,0.008983276],"study_design_scores_gemma":[0.0000070632195,0.000047169866,0.00018025465,0.00004461705,0.000010123686,0.0001357792,0.000026028021,0.04423174,0.00067007676,0.9205288,0.034095384,0.000022924698],"about_ca_topic_score_codex":0.0013692186,"about_ca_topic_score_gemma":0.0011572256,"teacher_disagreement_score":0.0031872308,"about_ca_system_score_codex":0.00060535525,"about_ca_system_score_gemma":0.0007560332,"threshold_uncertainty_score":0.010662377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02829832,0.00016424416,0.9707252,0.00016609134,0.000014136516,0.000047513822,0.000060238115,0.00007693045,0.0004472691],"genre_scores_gemma":[0.70227855,0.0005089093,0.2938214,0.00008426031,0.000087381624,0.0005700875,0.00037600187,0.00007537826,0.0021979935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910424,0.007553147,0.00019224701,0.0005384915,0.00043826632,0.00023541212],"domain_scores_gemma":[0.9385372,0.054908626,0.0027231942,0.0025423954,0.001039489,0.0002491026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0146078775,0.001018858,0.0018512214,0.0018313254,0.0005378641,0.0020967487,0.0026205336,0.0020280965,0.0017494073],"category_scores_gemma":[0.05949177,0.0009325306,0.0021059536,0.0023143322,0.0021863885,0.0027401717,0.0022995982,0.0022407304,0.00020999399],"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.00007760842,0.0000788833,0.0025275245,0.00005861259,0.00011297925,0.00021211914,0.00016970745,0.88269657,0.00018996275,0.09647682,0.00023117791,0.017168066],"study_design_scores_gemma":[0.000010801741,0.000018021186,0.00030373136,0.0000066463117,0.000008834724,0.000029087481,0.00002385089,0.9647709,0.00006980826,0.03455912,0.00018627167,0.000012950474],"about_ca_topic_score_codex":0.005561638,"about_ca_topic_score_gemma":0.0032948582,"teacher_disagreement_score":0.0146078775,"about_ca_system_score_codex":0.00147476,"about_ca_system_score_gemma":0.0008242897,"threshold_uncertainty_score":0.07725477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005578133,0.00050937035,0.98995274,0.00022055158,0.000047067897,0.0001462296,0.00012360855,0.00035650714,0.0030659216],"genre_scores_gemma":[0.09561758,0.0010969148,0.89692914,0.00014374196,0.00009409367,0.0006593252,0.00065083767,0.00035411865,0.0044541475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864405,0.0005139497,0.000066154804,0.00023427088,0.00029902812,0.00024252482],"domain_scores_gemma":[0.99699116,0.0022917686,0.00022735217,0.00017342008,0.0001937244,0.00012253414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025803114,0.0025827903,0.0025777258,0.0015208566,0.001384879,0.0024146284,0.00348727,0.0026540349,0.009694532],"category_scores_gemma":[0.0062053455,0.0017619987,0.0019706215,0.0027179567,0.0011856142,0.0039828997,0.0016026138,0.003972036,0.0014913105],"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.000091767964,0.00013554448,0.00025187468,0.00011859912,0.000040003604,0.00003981099,0.00006742974,0.9020604,0.0003429694,0.03457502,0.0025979334,0.059678722],"study_design_scores_gemma":[0.000028323459,0.000024980065,0.000035269524,0.000011376682,0.000009109308,0.000012136081,0.000012004213,0.98095644,0.00015747033,0.017915223,0.00083154085,0.000006025698],"about_ca_topic_score_codex":0.010581586,"about_ca_topic_score_gemma":0.011854897,"teacher_disagreement_score":0.010581586,"about_ca_system_score_codex":0.003564497,"about_ca_system_score_gemma":0.003582945,"threshold_uncertainty_score":0.032431483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09170386,0.00066241564,0.8876516,0.0018410316,0.0001374331,0.00019848358,0.0010699612,0.00035577235,0.016379472],"genre_scores_gemma":[0.7527009,0.0014109279,0.22685853,0.00047132827,0.00020544311,0.00043288717,0.0021047997,0.00030789882,0.01550726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862635,0.0006004493,0.00006945388,0.00024995708,0.00024117035,0.00021262474],"domain_scores_gemma":[0.9965276,0.0024201614,0.00036441066,0.00021790375,0.00021229651,0.00025760668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014880487,0.00074231543,0.0009706133,0.00054845464,0.0006997932,0.0011819206,0.0011044946,0.0012279599,0.005447735],"category_scores_gemma":[0.0070359465,0.00050618674,0.0007608645,0.0009733379,0.0013103724,0.002835485,0.0012864567,0.0016197283,0.00048115116],"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.00017291389,0.000061841725,0.0009418571,0.00017637543,0.000068775145,0.00017317595,0.00017671435,0.6483518,0.0011839803,0.31857914,0.0072171725,0.022896284],"study_design_scores_gemma":[0.00003833679,0.000066705215,0.00033941414,0.00002805478,0.000014001388,0.00015591453,0.000069218,0.7448514,0.0006092151,0.24678238,0.007025026,0.000020302521],"about_ca_topic_score_codex":0.0023303463,"about_ca_topic_score_gemma":0.0023898317,"teacher_disagreement_score":0.005447735,"about_ca_system_score_codex":0.0016365048,"about_ca_system_score_gemma":0.001954955,"threshold_uncertainty_score":0.018224537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05824637,0.00017828046,0.9324199,0.0008051037,0.000031270265,0.00069228275,0.00008865026,0.00012400925,0.0074141272],"genre_scores_gemma":[0.4706475,0.00063222647,0.52232814,0.00016197865,0.00004059342,0.0010772792,0.00019157646,0.000122305,0.00479834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99315953,0.0044151023,0.0003232489,0.00052666065,0.00087134825,0.0007041174],"domain_scores_gemma":[0.9940368,0.0028139455,0.00086941035,0.00072416844,0.0008017736,0.0007538768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009743789,0.0013120782,0.0011972038,0.00068982784,0.0019493094,0.0028181027,0.0022606214,0.0023198558,0.005179806],"category_scores_gemma":[0.014222506,0.0013090464,0.0009013381,0.0020338634,0.0019438945,0.007380183,0.0034689312,0.0014951903,0.0008239151],"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.00044977458,0.00029173814,0.0035554387,0.00037785058,0.00006724448,0.0006946949,0.001263322,0.651705,0.004635692,0.25917062,0.0025230176,0.075265646],"study_design_scores_gemma":[0.00019376342,0.00048215734,0.0006520746,0.000120276476,0.00006808661,0.0003659417,0.0015929443,0.8711576,0.0056650196,0.10300318,0.01663793,0.000061025745],"about_ca_topic_score_codex":0.0033810267,"about_ca_topic_score_gemma":0.0020660108,"teacher_disagreement_score":0.009743789,"about_ca_system_score_codex":0.0018912859,"about_ca_system_score_gemma":0.007196189,"threshold_uncertainty_score":0.05153072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020302986,0.00033150637,0.9936092,0.00014260942,0.00004961215,0.00008010329,0.00009597848,0.00011135079,0.003549376],"genre_scores_gemma":[0.050666228,0.0013627863,0.94016045,0.00014962693,0.00012767108,0.00043162348,0.0005328192,0.00011263303,0.0064560957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990036,0.00041656077,0.000042291307,0.00018699543,0.00024286633,0.00010782597],"domain_scores_gemma":[0.99956864,0.00023858555,0.000052981173,0.000033198306,0.000067673995,0.00003886246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013910639,0.002671767,0.0015225688,0.0015641944,0.000752868,0.0013285246,0.0011424517,0.0017880277,0.006606546],"category_scores_gemma":[0.0018673463,0.0011146548,0.0020337203,0.001999393,0.0006854505,0.0016446592,0.0011620893,0.002926039,0.0014381628],"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.00007237577,0.00013263406,0.00027505305,0.000289774,0.00010890065,0.00013080199,0.00011036386,0.8152722,0.003233144,0.07094666,0.006243726,0.1031844],"study_design_scores_gemma":[0.000038477516,0.00008461023,0.00016299827,0.000045931512,0.0000360236,0.00011800424,0.0000445845,0.93502307,0.0009155512,0.05091731,0.012589106,0.000024357845],"about_ca_topic_score_codex":0.0037891008,"about_ca_topic_score_gemma":0.004288601,"teacher_disagreement_score":0.006606546,"about_ca_system_score_codex":0.001110634,"about_ca_system_score_gemma":0.0019681042,"threshold_uncertainty_score":0.022101104},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23393612,0.0013682363,0.71579796,0.002410265,0.00017604585,0.00017281511,0.0006144622,0.000336502,0.045187555],"genre_scores_gemma":[0.9309435,0.0019910596,0.060674746,0.00026961617,0.0004808208,0.0003386217,0.00031048406,0.00030009003,0.0046910476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977149,0.00093493034,0.00010073808,0.0003113222,0.00063270115,0.0003054192],"domain_scores_gemma":[0.9844231,0.008325241,0.0031810747,0.003033834,0.0006552841,0.00038146076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005614616,0.0008843725,0.0013900984,0.0032521884,0.0005970044,0.0023159247,0.0022578086,0.0014879969,0.004188723],"category_scores_gemma":[0.039780878,0.0005254253,0.0015909667,0.0033438522,0.004468488,0.013089818,0.0024938069,0.0017934948,0.0008449511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00005236618,0.000054994867,0.01477798,0.00014538299,0.0001341243,0.0004049991,0.00027794566,0.12305445,0.0009826575,0.81847,0.002072487,0.03957254],"study_design_scores_gemma":[0.0000211509,0.00011235306,0.013340844,0.00006849527,0.000047924328,0.00031304546,0.00036695093,0.19900416,0.00074945414,0.77936566,0.0065580425,0.000051942785],"about_ca_topic_score_codex":0.0019786684,"about_ca_topic_score_gemma":0.0019309768,"teacher_disagreement_score":0.005614616,"about_ca_system_score_codex":0.0010400579,"about_ca_system_score_gemma":0.0006735316,"threshold_uncertainty_score":0.029693305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01861703,0.0005924116,0.9695013,0.0005558546,0.00006472685,0.00022421511,0.0002588667,0.0006797677,0.009505817],"genre_scores_gemma":[0.13852811,0.0007019668,0.8540403,0.00018006554,0.00011087403,0.0005185584,0.0010628098,0.00038378115,0.0044734855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987293,0.00040821207,0.000058933165,0.00020133174,0.00035463966,0.00024758818],"domain_scores_gemma":[0.99762636,0.0016976659,0.00016387402,0.00012771216,0.00028821,0.000096224736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020691433,0.0017775317,0.0016907622,0.0017398926,0.0011506316,0.002431711,0.0023090257,0.0016077,0.008574202],"category_scores_gemma":[0.0055800313,0.00087901513,0.0014067963,0.0025426126,0.0009120643,0.0024633855,0.0013760339,0.0031302094,0.0013012859],"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.00022575115,0.0003228787,0.0007943417,0.0002551347,0.000078700454,0.00012920021,0.00015125517,0.7663187,0.0021368423,0.08008197,0.00892004,0.1405852],"study_design_scores_gemma":[0.000027938784,0.000025955847,0.0000744937,0.000012980913,0.00001409866,0.000016083404,0.000017532651,0.9749634,0.00032716966,0.023481127,0.0010332596,0.000005882826],"about_ca_topic_score_codex":0.012346975,"about_ca_topic_score_gemma":0.010129451,"teacher_disagreement_score":0.012346975,"about_ca_system_score_codex":0.002989517,"about_ca_system_score_gemma":0.0045880848,"threshold_uncertainty_score":0.028683543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005914673,0.0002079285,0.984783,0.0006240643,0.00014072945,0.00014374437,0.00036344046,0.00011607196,0.007706383],"genre_scores_gemma":[0.12226743,0.0008387876,0.86458176,0.00038180593,0.00028433502,0.0006223479,0.0008926463,0.000199949,0.009930976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874216,0.0005046728,0.00006237094,0.0002287491,0.00033855028,0.00012342301],"domain_scores_gemma":[0.9989613,0.0005566829,0.00014014872,0.00008765568,0.00018147475,0.000072728035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015444984,0.0013602497,0.00086793175,0.00078946527,0.00041172167,0.0017196343,0.0017389761,0.001493182,0.006788337],"category_scores_gemma":[0.0030045072,0.0007294863,0.00092906837,0.0019026877,0.0005067446,0.0022520272,0.0010135922,0.0024147239,0.0009151302],"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.00008390978,0.00016691239,0.0006366384,0.00030301188,0.000051194296,0.00021662451,0.00009814248,0.77045345,0.0023452735,0.13963275,0.013611882,0.07240016],"study_design_scores_gemma":[0.00002586681,0.00005102576,0.000108200715,0.000026565795,0.000013603903,0.00011200938,0.00003087749,0.964351,0.0004795946,0.026841866,0.007949347,0.000009935719],"about_ca_topic_score_codex":0.0027166826,"about_ca_topic_score_gemma":0.0035791784,"teacher_disagreement_score":0.006788337,"about_ca_system_score_codex":0.0012022852,"about_ca_system_score_gemma":0.001922533,"threshold_uncertainty_score":0.02270925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8412131,0.0014004875,0.07989016,0.0044019637,0.000084906154,0.0000621365,0.00034239347,0.000085938635,0.07251886],"genre_scores_gemma":[0.99428695,0.00046208542,0.001344033,0.00007693935,0.000026637881,0.000014060918,0.000045894463,0.000006300077,0.0037370357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932134,0.00029085856,0.000023515153,0.000076956225,0.00008267071,0.00020473103],"domain_scores_gemma":[0.9957008,0.0030564142,0.00055992726,0.00018222586,0.0002526151,0.00024802788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001771952,0.00046905383,0.0006183131,0.0008631155,0.0005043441,0.0029340938,0.00066801475,0.0013872577,0.0059636915],"category_scores_gemma":[0.008968711,0.00032123772,0.0005382631,0.0007515376,0.0019236909,0.0024768077,0.0010142757,0.0012969706,0.00042822215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00025669186,0.00023771812,0.008521558,0.00009181681,0.00011203005,0.00033600844,0.0003405632,0.15143363,0.0011690845,0.8158947,0.0021823905,0.019423692],"study_design_scores_gemma":[0.000046266174,0.000094803734,0.004018376,0.000040232953,0.000039028153,0.00011083996,0.0003359759,0.111229144,0.000263811,0.8820886,0.0016883468,0.00004455255],"about_ca_topic_score_codex":0.0028752142,"about_ca_topic_score_gemma":0.0017136673,"teacher_disagreement_score":0.0059636915,"about_ca_system_score_codex":0.0016547826,"about_ca_system_score_gemma":0.00066650065,"threshold_uncertainty_score":0.01995051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014223624,0.00042843944,0.9824532,0.00011162078,0.000042487773,0.00007316968,0.000047480968,0.000103177525,0.0025168422],"genre_scores_gemma":[0.24421301,0.0008014123,0.7495729,0.000101971054,0.00009327543,0.00026894544,0.00024507093,0.00014309974,0.004560358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990037,0.0004298167,0.000029690715,0.00009387114,0.00033494562,0.000108008964],"domain_scores_gemma":[0.99835485,0.0011838936,0.00012496584,0.000115389805,0.00015983084,0.00006098339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019080552,0.0009346855,0.0011361522,0.0006481196,0.0005201307,0.0010163616,0.0012031627,0.0008722213,0.0036931653],"category_scores_gemma":[0.0048151556,0.00063898345,0.0008425223,0.0014167359,0.000822663,0.002311423,0.0010151515,0.0023383219,0.00053187076],"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.00016870118,0.00010414353,0.0004289246,0.00015233601,0.00005678728,0.000097496806,0.00007085668,0.83180195,0.0019611232,0.06833604,0.0019327496,0.09488893],"study_design_scores_gemma":[0.000015834656,0.0000357383,0.000065656175,0.0000057420084,0.000007799113,0.000022078579,0.0000063951984,0.9813757,0.0004629701,0.017045612,0.00095266243,0.0000038133358],"about_ca_topic_score_codex":0.002666356,"about_ca_topic_score_gemma":0.0027821378,"teacher_disagreement_score":0.0036931653,"about_ca_system_score_codex":0.00087781035,"about_ca_system_score_gemma":0.0014827746,"threshold_uncertainty_score":0.012354851},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05969798,0.0013530633,0.9008796,0.0013838985,0.000252074,0.00015037348,0.0010953642,0.0003253164,0.03486222],"genre_scores_gemma":[0.8333916,0.001979332,0.13705646,0.00021445812,0.00022156011,0.00028346726,0.0015364982,0.0001698263,0.025146822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948585,0.00015202363,0.000018746212,0.00014728145,0.00009225624,0.00010394403],"domain_scores_gemma":[0.999567,0.00024307142,0.00006130214,0.000035474728,0.000043337805,0.00004986491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048761192,0.0009039553,0.0008217205,0.00048370313,0.0005904594,0.0013489575,0.0017649612,0.001295976,0.0057267756],"category_scores_gemma":[0.0012239459,0.00050825387,0.0004879271,0.0012278815,0.0006764883,0.0016820064,0.0010182831,0.0010912659,0.000548537],"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.000104559185,0.00009163737,0.00040406283,0.00022907846,0.000048707705,0.0003575977,0.000052623316,0.88301295,0.001242585,0.06698503,0.006483343,0.0409878],"study_design_scores_gemma":[0.000041527794,0.000060260994,0.00031274994,0.000026441596,0.000026294436,0.00021007152,0.00007856795,0.9454519,0.001041618,0.041020926,0.011710052,0.000019691557],"about_ca_topic_score_codex":0.0033590407,"about_ca_topic_score_gemma":0.0033979558,"teacher_disagreement_score":0.0057267756,"about_ca_system_score_codex":0.001033202,"about_ca_system_score_gemma":0.0013231516,"threshold_uncertainty_score":0.019158006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037064306,0.00088929886,0.9408734,0.00068813405,0.000089009176,0.0002098368,0.00042164678,0.0004541375,0.0193103],"genre_scores_gemma":[0.67329985,0.0022828823,0.29115307,0.00019641183,0.00012702629,0.00043464432,0.0010121157,0.00041719602,0.031076808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993781,0.00025808005,0.000018270714,0.00007892336,0.00013310488,0.00013363757],"domain_scores_gemma":[0.99952507,0.00023914828,0.00006513305,0.000027973174,0.000069125876,0.0000734895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091495324,0.0023141163,0.0016554326,0.0011376739,0.0009566821,0.001922308,0.0021887566,0.001711502,0.0071561453],"category_scores_gemma":[0.0014993637,0.0012867018,0.0006549922,0.0024969012,0.0010948573,0.0020627426,0.0011588725,0.0012261044,0.001265607],"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.000087492,0.00005113062,0.00022725273,0.000121125755,0.000021478103,0.000080144484,0.00004521678,0.9699836,0.00042518147,0.008193127,0.0018706131,0.018893743],"study_design_scores_gemma":[0.000020555452,0.00004060818,0.00008410857,0.00001629678,0.00001416633,0.000026831616,0.000047785248,0.98741686,0.0006099823,0.009724077,0.001988682,0.0000100322395],"about_ca_topic_score_codex":0.019360682,"about_ca_topic_score_gemma":0.018213253,"teacher_disagreement_score":0.019360682,"about_ca_system_score_codex":0.002179993,"about_ca_system_score_gemma":0.0023638771,"threshold_uncertainty_score":0.038496017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010834661,0.0024902793,0.9481102,0.009486483,0.00041570255,0.00003570506,0.00011318383,0.000111087415,0.028402682],"genre_scores_gemma":[0.41028687,0.005512849,0.5302586,0.0036540045,0.002522022,0.00023408655,0.00028184708,0.00035882575,0.04689093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990907,0.0003240219,0.000026688629,0.00025301048,0.00021957855,0.000086043656],"domain_scores_gemma":[0.9987043,0.00079910154,0.000087554596,0.00014459947,0.00016464324,0.00009975808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017347537,0.0006599995,0.0009409918,0.00076819083,0.000927975,0.0022938617,0.0015188298,0.002516057,0.010199914],"category_scores_gemma":[0.0045837094,0.00035685068,0.00091993314,0.0009648744,0.0024375536,0.00766775,0.0019364874,0.0055384915,0.0007231585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000020661128,0.000033497712,0.00015100265,0.0000652375,0.000018077071,0.00006919552,0.000090327194,0.016912287,0.0004928568,0.9612669,0.0039087147,0.016971258],"study_design_scores_gemma":[0.000012826466,0.000020774427,0.0001014493,0.000032374035,0.000008022304,0.000100133504,0.000082237835,0.113864295,0.0003513145,0.8673052,0.01810954,0.000011900909],"about_ca_topic_score_codex":0.0018277132,"about_ca_topic_score_gemma":0.0017182335,"teacher_disagreement_score":0.010199914,"about_ca_system_score_codex":0.0012115141,"about_ca_system_score_gemma":0.0009917897,"threshold_uncertainty_score":0.03412211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15959178,0.0016454004,0.8168447,0.0041690194,0.00023816562,0.00027142052,0.0024847293,0.000548827,0.014205972],"genre_scores_gemma":[0.9511282,0.0011796348,0.034910385,0.0003165493,0.00015786197,0.00033037455,0.0008853824,0.000060887745,0.011030748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988477,0.00047605063,0.00003674828,0.00021002906,0.00012643861,0.0003028754],"domain_scores_gemma":[0.997042,0.0021898916,0.00032945946,0.00007052347,0.0001605233,0.00020755338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183696,0.0011805923,0.001534118,0.00075573823,0.00090452953,0.0024820005,0.0019177949,0.0024730524,0.0062610614],"category_scores_gemma":[0.0041661393,0.00094408996,0.0011260638,0.00095564855,0.0015258371,0.0021736224,0.0009642214,0.0026002254,0.00087478646],"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.00018727314,0.00006906846,0.0008828698,0.00004194071,0.000036389272,0.00014151576,0.00007491585,0.9479778,0.00039381432,0.046245266,0.0010625927,0.0028865812],"study_design_scores_gemma":[0.00002855814,0.000027089043,0.00019371533,0.0000069563584,0.000011401384,0.000013855418,0.000014704129,0.9880784,0.000060424554,0.011138924,0.00041308856,0.000012820816],"about_ca_topic_score_codex":0.040902555,"about_ca_topic_score_gemma":0.029037546,"teacher_disagreement_score":0.040902555,"about_ca_system_score_codex":0.0029532237,"about_ca_system_score_gemma":0.002618305,"threshold_uncertainty_score":0.08132893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48919016,0.0003072112,0.4979082,0.000692499,0.00001872721,0.00010736062,0.0004265632,0.00015410308,0.011195123],"genre_scores_gemma":[0.98365074,0.0001901171,0.013351863,0.0000334022,0.000017278733,0.0001248895,0.00010653431,0.000026765578,0.00249835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988519,0.00040521027,0.00003801459,0.00019333686,0.00015622487,0.00035535698],"domain_scores_gemma":[0.9940399,0.0035899358,0.00090455275,0.00030641275,0.00073623157,0.00042305852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002442995,0.0005985824,0.0015264432,0.0011674812,0.000876958,0.0015520591,0.0019781524,0.0012396672,0.007585525],"category_scores_gemma":[0.011291065,0.00061700714,0.0011525106,0.0008571388,0.0016027099,0.0035634162,0.0016252208,0.0012070385,0.0005764691],"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.0005741164,0.000249721,0.0098375715,0.00020056232,0.00015021753,0.0005459331,0.0006832714,0.5368451,0.0042181956,0.42554608,0.0021801593,0.018968988],"study_design_scores_gemma":[0.00003980313,0.000090013935,0.0019538424,0.000023330287,0.000043232307,0.00021468378,0.00035663048,0.909267,0.00066088646,0.08659411,0.0007085157,0.000048012516],"about_ca_topic_score_codex":0.0063070743,"about_ca_topic_score_gemma":0.003750534,"teacher_disagreement_score":0.007585525,"about_ca_system_score_codex":0.0015992398,"about_ca_system_score_gemma":0.0013614667,"threshold_uncertainty_score":0.025376081},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020254342,0.0005892739,0.9745798,0.00013310384,0.000052643412,0.00011745208,0.000051819494,0.00026285707,0.003958751],"genre_scores_gemma":[0.27755865,0.000550257,0.7169963,0.000143451,0.000050116687,0.0004375019,0.00018078169,0.00013135589,0.0039515467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956685,0.00017248758,0.000020672773,0.0000701172,0.00012105362,0.000048796264],"domain_scores_gemma":[0.9997137,0.00015438275,0.00004959571,0.000029565907,0.000032405223,0.000020370002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073104026,0.0008326811,0.0009988144,0.00067769527,0.0004358528,0.0006926721,0.0011527045,0.0012249454,0.0016589842],"category_scores_gemma":[0.0012211336,0.0005358942,0.0011635548,0.0006022471,0.00042188464,0.0007711492,0.00063838385,0.0009592231,0.00029968977],"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.000062224884,0.000081920705,0.00034220918,0.00010223178,0.00006909766,0.00006375776,0.00006649127,0.9191781,0.0039589345,0.013488086,0.0010478813,0.06153892],"study_design_scores_gemma":[0.00002552717,0.00006544972,0.00012905187,0.000012470242,0.00002402075,0.000038391823,0.000010271888,0.993148,0.0012011589,0.0026555543,0.00268125,0.000008853788],"about_ca_topic_score_codex":0.0020906786,"about_ca_topic_score_gemma":0.0028828995,"teacher_disagreement_score":0.0020906786,"about_ca_system_score_codex":0.0007740038,"about_ca_system_score_gemma":0.0009754335,"threshold_uncertainty_score":0.00561589},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007724381,0.32246187,0.123262614,0.0624905,0.021926232,0.00015065102,0.0012311765,0.00052233716,0.46023026],"genre_scores_gemma":[0.21199697,0.44240606,0.068257466,0.020738577,0.015373439,0.00036021706,0.0019814596,0.00056327175,0.23832269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99827385,0.00049336214,0.00009077205,0.0003765583,0.00058776245,0.0001776407],"domain_scores_gemma":[0.99849653,0.000640352,0.00009089765,0.00024684286,0.0003934938,0.00013182365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020395138,0.0008693169,0.00084519107,0.0012446062,0.0016467575,0.004226537,0.0015057492,0.0022561303,0.020331375],"category_scores_gemma":[0.006019369,0.00047947955,0.00060100394,0.002548692,0.0038093426,0.0058954153,0.0029920891,0.0032637399,0.007691697],"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.000057666955,0.000036474645,0.00042987207,0.0003187198,0.000022465847,0.00009079105,0.0003476184,0.004759351,0.00021436214,0.7631709,0.06584596,0.16470575],"study_design_scores_gemma":[0.0000064310925,0.000025773727,0.00018464685,0.00038299363,0.0000059006406,0.00009051956,0.00014201205,0.0010986303,0.000103883875,0.1577395,0.8402022,0.000017478937],"about_ca_topic_score_codex":0.0039217467,"about_ca_topic_score_gemma":0.0030042,"teacher_disagreement_score":0.020331375,"about_ca_system_score_codex":0.002986957,"about_ca_system_score_gemma":0.002220466,"threshold_uncertainty_score":0.06801528},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22217132,0.00045807136,0.76867604,0.00022098895,0.000040424173,0.00016181532,0.00017920755,0.000424267,0.0076678037],"genre_scores_gemma":[0.90398264,0.00022777692,0.09225532,0.00002863606,0.000031387095,0.00009371449,0.00014076316,0.00004261429,0.0031972444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954766,0.00019580718,0.00001044677,0.000062009945,0.00010413492,0.00007983472],"domain_scores_gemma":[0.9995547,0.0002955034,0.000056382643,0.00003128112,0.000029393546,0.000032657892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005190102,0.0005901457,0.0005920079,0.00048500465,0.0005336603,0.0007793598,0.0007632032,0.00065983593,0.0020331368],"category_scores_gemma":[0.0013030656,0.0005101677,0.00039207414,0.0008756696,0.00054469507,0.0007352746,0.000653114,0.00041900636,0.00019587648],"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.00007251973,0.00003356105,0.0003617093,0.00004723379,0.000017456716,0.00009795913,0.00004948893,0.96973497,0.0015547306,0.006294996,0.0004484087,0.02128705],"study_design_scores_gemma":[0.000017328879,0.00004143418,0.00020441179,0.0000025962859,0.0000057524985,0.000025982838,0.00002809053,0.9950368,0.0007247835,0.0031864136,0.00072293007,0.0000034195136],"about_ca_topic_score_codex":0.0106496215,"about_ca_topic_score_gemma":0.0138134835,"teacher_disagreement_score":0.0106496215,"about_ca_system_score_codex":0.00062826887,"about_ca_system_score_gemma":0.001049465,"threshold_uncertainty_score":0.021175265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13176742,0.00043618362,0.8561762,0.00045120815,0.00006589261,0.00045738273,0.000434579,0.000395445,0.009815676],"genre_scores_gemma":[0.86456233,0.00040415814,0.12996821,0.00008253023,0.000038905295,0.00046643967,0.00033494591,0.00007213815,0.004070381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989693,0.00037904788,0.000045627487,0.00023790101,0.00013971294,0.0002284407],"domain_scores_gemma":[0.9987356,0.00070996396,0.00022159773,0.00006953133,0.00013610549,0.0001272116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015385066,0.0015084055,0.0016913401,0.0010206889,0.0009463022,0.0025084396,0.0018488748,0.0020539274,0.0049455776],"category_scores_gemma":[0.0034304825,0.0014754407,0.0009570235,0.0018770234,0.0011460934,0.0017696426,0.00228511,0.0011540118,0.00066700863],"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.000024855382,0.000025706595,0.00017607323,0.000034163735,0.00001146847,0.00004825925,0.000017478293,0.9951565,0.00039659135,0.0021369837,0.00011180374,0.0018601404],"study_design_scores_gemma":[0.000019081757,0.000041201034,0.00006819528,0.000005238349,0.0000075465537,0.0000092868195,0.000020553118,0.997276,0.00023257961,0.0020397725,0.00027504723,0.0000055709093],"about_ca_topic_score_codex":0.00851472,"about_ca_topic_score_gemma":0.008514044,"teacher_disagreement_score":0.00851472,"about_ca_system_score_codex":0.0023552768,"about_ca_system_score_gemma":0.0022570633,"threshold_uncertainty_score":0.01708883},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08209178,0.0016519122,0.89952135,0.0012846367,0.00022204375,0.0002068661,0.0006758296,0.00031141975,0.014034038],"genre_scores_gemma":[0.6841705,0.002669708,0.2932985,0.00019026981,0.00030892267,0.00039628835,0.0009671029,0.00023023091,0.017768497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989222,0.0004075283,0.00005259373,0.00022265816,0.000180894,0.00021414072],"domain_scores_gemma":[0.99840397,0.0010796951,0.00018111475,0.00008918756,0.000120921206,0.00012509967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009786059,0.0011878659,0.0010070158,0.00043023523,0.00065745844,0.0014526697,0.0015184663,0.001427774,0.006719112],"category_scores_gemma":[0.0038725757,0.00047174038,0.00073569344,0.001433081,0.00084494706,0.0042527188,0.0010545051,0.0017078943,0.00047693646],"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.00020196052,0.00012829229,0.00038590323,0.0003884565,0.00007522462,0.00030866603,0.00014240289,0.7294325,0.0023734777,0.21175559,0.004436563,0.050370988],"study_design_scores_gemma":[0.0000927518,0.00016071883,0.0003118093,0.000034739824,0.000053436164,0.00025471364,0.00014165408,0.83671945,0.0013487915,0.14774662,0.013093142,0.00004217718],"about_ca_topic_score_codex":0.0055302586,"about_ca_topic_score_gemma":0.003285546,"teacher_disagreement_score":0.006719112,"about_ca_system_score_codex":0.0012952263,"about_ca_system_score_gemma":0.0024578318,"threshold_uncertainty_score":0.022477686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5883322,0.00023218013,0.4029156,0.0005340086,0.000027065713,0.00009218043,0.00053448934,0.00019440184,0.007137918],"genre_scores_gemma":[0.98921645,0.00008311864,0.009632446,0.000018374552,0.0000066258945,0.000036613153,0.000093819726,0.000013376942,0.000899182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992785,0.0003009119,0.000025297391,0.00010738577,0.00010489599,0.00018298827],"domain_scores_gemma":[0.9980599,0.0013307208,0.00025403357,0.000095647294,0.00013832709,0.00012128855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013485723,0.0007447774,0.00067965436,0.00046585183,0.00042032267,0.0016204995,0.001042746,0.0012290505,0.0014365955],"category_scores_gemma":[0.0038994835,0.0006309045,0.00056959485,0.0011803905,0.00094967795,0.0014761363,0.001036459,0.0010609952,0.000105320854],"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.00001029203,0.000005778032,0.0002436981,0.0000030786266,0.0000028829706,0.0000121726625,0.000008748163,0.9979011,0.000058727044,0.0013266245,0.000018176488,0.00040872555],"study_design_scores_gemma":[0.000002053014,0.000009027578,0.0001463764,9.314175e-7,0.0000018512712,0.0000030539597,0.0000133501435,0.99864143,0.00004346619,0.0010985269,0.00003686486,0.0000030916979],"about_ca_topic_score_codex":0.028717658,"about_ca_topic_score_gemma":0.015662016,"teacher_disagreement_score":0.028717658,"about_ca_system_score_codex":0.0021789395,"about_ca_system_score_gemma":0.0013094249,"threshold_uncertainty_score":0.05710101},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023996615,0.97691864,0.00012761993,0.0031812596,0.016364753,0.000007721251,0.000057019734,0.000014266125,0.0030887653],"genre_scores_gemma":[0.00225874,0.9665571,0.00021234433,0.002577297,0.02373482,0.000014603268,0.000152125,0.000012175171,0.004480728],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944025,0.000081109974,0.00008958238,0.00012631505,0.00019988239,0.00006277737],"domain_scores_gemma":[0.9973711,0.00087439764,0.00033690684,0.0000588184,0.0010418714,0.0003169076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348368,0.0009728756,0.0015232575,0.004616802,0.0004036718,0.0023401892,0.0013927586,0.0023084932,0.01615194],"category_scores_gemma":[0.002913821,0.00039454928,0.00081149966,0.0046730004,0.00066342636,0.0035600387,0.0016454041,0.0025137842,0.007722639],"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.00022502948,0.0001716829,0.00070676877,0.022602519,0.00017927488,0.00052769814,0.00015683677,0.00047914352,0.0019324011,0.0043831742,0.52383614,0.4447993],"study_design_scores_gemma":[0.000009513935,0.00010012794,0.0011435865,0.0048354985,0.00012623519,0.00059741415,0.000083416555,0.000086512555,0.00031152286,0.000904001,0.9917779,0.000024155835],"about_ca_topic_score_codex":0.00159167,"about_ca_topic_score_gemma":0.0023360837,"teacher_disagreement_score":0.01615194,"about_ca_system_score_codex":0.0010191245,"about_ca_system_score_gemma":0.0013710642,"threshold_uncertainty_score":0.054033577},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17941748,0.0011354003,0.8070298,0.0009985545,0.00013111981,0.00045174884,0.0010694857,0.00023120805,0.009535187],"genre_scores_gemma":[0.6793312,0.0008192379,0.30974606,0.00015424029,0.00013952042,0.0004925941,0.000807451,0.00009654348,0.008413095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870765,0.0006099247,0.000053605007,0.00029887696,0.00015830995,0.00017160703],"domain_scores_gemma":[0.9986187,0.0010651448,0.00014699783,0.000048997383,0.00005320528,0.00006693113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013994044,0.00151673,0.0017970719,0.0009445642,0.0010320427,0.002098765,0.0018739589,0.003612514,0.0038332755],"category_scores_gemma":[0.0030005435,0.0011913134,0.0016070909,0.0019531623,0.0010460333,0.001917021,0.001056936,0.0015439505,0.0002745664],"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.00005611717,0.000056948506,0.0004096187,0.00009315567,0.000038966056,0.00024338462,0.000045946832,0.9817036,0.0004948681,0.009679151,0.00059839705,0.0065798797],"study_design_scores_gemma":[0.00003709135,0.00006597717,0.0003469567,0.000011926197,0.00003392617,0.00012903579,0.00008847052,0.9884919,0.0004205561,0.00894743,0.0014110699,0.000015818898],"about_ca_topic_score_codex":0.010951233,"about_ca_topic_score_gemma":0.011131121,"teacher_disagreement_score":0.010951233,"about_ca_system_score_codex":0.0020791246,"about_ca_system_score_gemma":0.0017519023,"threshold_uncertainty_score":0.021774948},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005920002,0.042100143,0.0017318081,0.026841834,0.77557,0.00013554857,0.0011455081,0.00031033932,0.1515729],"genre_scores_gemma":[0.006051898,0.051947642,0.0012597874,0.01158638,0.59252673,0.00018444014,0.0026469878,0.0006487911,0.33314726],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986603,0.00012546495,0.00010110392,0.00020329133,0.00074184436,0.00016808804],"domain_scores_gemma":[0.99657935,0.0005926696,0.00029013213,0.00026953273,0.0017898447,0.00047841435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013725942,0.0026136679,0.0024942672,0.006135518,0.0018502489,0.006392732,0.00187569,0.0038402905,0.08726811],"category_scores_gemma":[0.0032165714,0.00054919487,0.0016864184,0.0054797498,0.0014179803,0.0032353667,0.0017639457,0.003204417,0.044899724],"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.000019175635,0.00001547351,0.00007444304,0.00019877109,0.000007816349,0.000021657985,0.0000065902104,0.000070256916,0.00022109436,0.0012949493,0.9852448,0.012824915],"study_design_scores_gemma":[0.0000055188893,0.000041097806,0.0011616449,0.00023778,0.000016478041,0.00009056529,0.000027942842,0.00020930747,0.00025435345,0.0017489188,0.9961947,0.00001170403],"about_ca_topic_score_codex":0.005211926,"about_ca_topic_score_gemma":0.012433676,"teacher_disagreement_score":0.08726811,"about_ca_system_score_codex":0.0029530341,"about_ca_system_score_gemma":0.00322074,"threshold_uncertainty_score":0.29194093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074437032,0.00012732325,0.9859783,0.0002265036,0.00002716728,0.00010211215,0.00009210815,0.0004955495,0.0055072326],"genre_scores_gemma":[0.12673816,0.00020976564,0.869019,0.00015466294,0.000033281947,0.00036647278,0.00045407185,0.00021146671,0.0028131397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944943,0.00016167834,0.000019643945,0.00009461052,0.00014481242,0.0001299107],"domain_scores_gemma":[0.99907446,0.00054678175,0.00007868995,0.000085263884,0.00013254568,0.0000822034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058756,0.0011099576,0.0014626678,0.0009021771,0.00071511656,0.0013473898,0.0017287731,0.0014159441,0.0072056083],"category_scores_gemma":[0.003215853,0.0006391725,0.00072485855,0.0013130627,0.0006644616,0.00114843,0.001423107,0.0020048383,0.0013123745],"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.00006258072,0.00013842073,0.00027806722,0.0000928813,0.000027783248,0.000077007324,0.00007501734,0.892291,0.0012372675,0.02186304,0.004509699,0.0793473],"study_design_scores_gemma":[0.000023813533,0.000015239802,0.000031680098,0.0000066435314,0.000004208621,0.000010066806,0.000009838992,0.99444085,0.00022608155,0.004510524,0.0007178224,0.0000031424106],"about_ca_topic_score_codex":0.0061256546,"about_ca_topic_score_gemma":0.007318596,"teacher_disagreement_score":0.0072056083,"about_ca_system_score_codex":0.0017216483,"about_ca_system_score_gemma":0.0026827625,"threshold_uncertainty_score":0.024105132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065780696,0.000205857,0.98904943,0.00012533984,0.000022790084,0.000051253002,0.00008487569,0.0000900227,0.0037923101],"genre_scores_gemma":[0.18884687,0.00088457594,0.80324537,0.00009938771,0.00006997682,0.00026085376,0.00031848534,0.0001596265,0.006114854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965155,0.00011882299,0.000016814796,0.000053219435,0.00011537144,0.00004426156],"domain_scores_gemma":[0.9997359,0.00012255479,0.000042800246,0.000032190175,0.000042830095,0.00002374354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066053495,0.001189898,0.0006838604,0.0007425797,0.00043710976,0.0009992816,0.0007394419,0.0008542463,0.0058620363],"category_scores_gemma":[0.0010564644,0.0007406997,0.0012899173,0.0008955435,0.00050856575,0.0009334895,0.00087862235,0.0013958233,0.0006230818],"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.000027259584,0.000043497887,0.00016169024,0.00011245079,0.000023422579,0.000084064304,0.00006443762,0.91564435,0.0029279955,0.046228398,0.0012267873,0.033455547],"study_design_scores_gemma":[0.000013717492,0.000033708635,0.000067607754,0.000021549507,0.000011387265,0.00003466138,0.000028649458,0.9687109,0.00090997084,0.02650616,0.0036552139,0.000006470169],"about_ca_topic_score_codex":0.0031539071,"about_ca_topic_score_gemma":0.0041842684,"teacher_disagreement_score":0.0058620363,"about_ca_system_score_codex":0.0008695862,"about_ca_system_score_gemma":0.0012881556,"threshold_uncertainty_score":0.019610465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011366446,0.0003414836,0.9802229,0.00034352724,0.000054676057,0.000088515546,0.00021320848,0.0001119537,0.0072572706],"genre_scores_gemma":[0.33115572,0.001017657,0.66123194,0.00022580044,0.000110265806,0.00055458193,0.0006893464,0.0001691298,0.0048455875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989942,0.0005386972,0.000039539907,0.00009680052,0.00023752378,0.000093362694],"domain_scores_gemma":[0.9977962,0.0016760963,0.0001429015,0.00016164102,0.00016957485,0.0000536059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018775557,0.00093204173,0.0008336417,0.0006227113,0.00042343122,0.0012511214,0.0010097865,0.00093540683,0.003957433],"category_scores_gemma":[0.0053400006,0.0005751256,0.0009972987,0.0010431465,0.00087359204,0.0015898432,0.0010001108,0.0023003074,0.00043987916],"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.000023390901,0.00003618037,0.00020081592,0.00008823938,0.000011246905,0.000064939224,0.000057912028,0.9252147,0.0005383489,0.05976378,0.0012429741,0.012757542],"study_design_scores_gemma":[0.000010945671,0.0000136309445,0.000033613524,0.0000184188,0.0000037771317,0.0000127602025,0.000026872312,0.9792069,0.00022031163,0.018699858,0.0017495388,0.000003352195],"about_ca_topic_score_codex":0.004274426,"about_ca_topic_score_gemma":0.003988698,"teacher_disagreement_score":0.004274426,"about_ca_system_score_codex":0.0013138796,"about_ca_system_score_gemma":0.001048226,"threshold_uncertainty_score":0.013238907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98115736,0.000077861754,0.015301085,0.00016180682,0.0000076271244,0.00003495862,0.0013242578,0.000051544233,0.001883476],"genre_scores_gemma":[0.9923969,0.00007550144,0.0055445805,0.000008680533,0.000007169556,0.000028740591,0.0011558173,0.000004808746,0.0007776644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998271,0.00005697146,0.000012363977,0.000047085152,0.000034070054,0.000022359334],"domain_scores_gemma":[0.99749506,0.0019398042,0.00020056947,0.00010887159,0.00018048834,0.00007513498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074625976,0.0002809659,0.0002632338,0.00075578544,0.00011351329,0.00053795916,0.00036290547,0.00067904,0.0032398505],"category_scores_gemma":[0.0040415484,0.00021315728,0.0004014864,0.00059913774,0.0001146092,0.0011720245,0.00021925259,0.00039481436,0.0007360184],"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.0005914947,0.00051583926,0.28734323,0.00015800817,0.00013319931,0.0001990578,0.00015585564,0.597639,0.0076448116,0.0064459746,0.0024756864,0.09669781],"study_design_scores_gemma":[0.000012693705,0.00014713184,0.043840513,0.000009421616,0.000017142736,0.000031666103,0.00016235364,0.9499539,0.0018431998,0.0031867493,0.00077749876,0.000017671664],"about_ca_topic_score_codex":0.0038443513,"about_ca_topic_score_gemma":0.0038831867,"teacher_disagreement_score":0.0038443513,"about_ca_system_score_codex":0.00038070604,"about_ca_system_score_gemma":0.00019899006,"threshold_uncertainty_score":0.01083833},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33605805,0.00080285117,0.63504225,0.002051096,0.00010047332,0.00014347368,0.00030638967,0.000101243,0.025394171],"genre_scores_gemma":[0.97911686,0.0002737803,0.016801676,0.00009408452,0.000075193,0.000055109307,0.000047601156,0.000023221617,0.0035124815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832505,0.0009133198,0.000032306925,0.00017278318,0.00025750956,0.00029902696],"domain_scores_gemma":[0.99566025,0.0032701872,0.00044926582,0.00018053746,0.00022472921,0.00021509478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021996985,0.0008639482,0.00094871805,0.00071730546,0.0005711295,0.001670018,0.0019014549,0.0019317655,0.0030837948],"category_scores_gemma":[0.011575709,0.0006052973,0.0008101796,0.00089701155,0.0017330494,0.002773039,0.0013209531,0.0013723008,0.000176027],"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.00006508583,0.00005468486,0.00052034186,0.00005788809,0.000022402846,0.0002180257,0.000040579314,0.9519736,0.0004127076,0.043265827,0.0003505085,0.0030182975],"study_design_scores_gemma":[0.00000967741,0.000014623215,0.00012356762,0.0000034695772,0.000005134152,0.00003437408,0.000021866297,0.9864006,0.0000786664,0.0131741315,0.00012756074,0.000006335685],"about_ca_topic_score_codex":0.0048118643,"about_ca_topic_score_gemma":0.0025784762,"teacher_disagreement_score":0.0048118643,"about_ca_system_score_codex":0.0012793032,"about_ca_system_score_gemma":0.0006407489,"threshold_uncertainty_score":0.011633217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147284465,0.00024789898,0.98019844,0.0001692783,0.000045213623,0.00006925959,0.00010833036,0.000090708694,0.0043424624],"genre_scores_gemma":[0.36379647,0.000633065,0.6317199,0.00015030547,0.00008012906,0.00031950834,0.00039700177,0.00011441935,0.0027892713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980558,0.00072839553,0.000085239604,0.00016162265,0.00076281495,0.00020628724],"domain_scores_gemma":[0.9975553,0.001538155,0.00028853875,0.0003243494,0.0002264233,0.00006728805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021319625,0.0015274959,0.0006964085,0.0010515292,0.00053260126,0.002311777,0.001856147,0.0011246959,0.003403887],"category_scores_gemma":[0.008822761,0.00075743656,0.0012211151,0.0020276187,0.00093472254,0.0032830562,0.0015970379,0.0029607506,0.00043516012],"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.00007854364,0.00010922149,0.00047072917,0.00011622532,0.000029868263,0.00008541767,0.0000773882,0.7901668,0.0021340258,0.13906436,0.0014358755,0.06623159],"study_design_scores_gemma":[0.000011123105,0.000045731987,0.00009424544,0.000025691343,0.000011671976,0.00002743324,0.000016390386,0.94642216,0.0013571733,0.050357353,0.0016207739,0.000010150561],"about_ca_topic_score_codex":0.002103574,"about_ca_topic_score_gemma":0.0029626994,"teacher_disagreement_score":0.003403887,"about_ca_system_score_codex":0.0014743501,"about_ca_system_score_gemma":0.0013601526,"threshold_uncertainty_score":0.01138711},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02949051,0.00021761376,0.9661695,0.0006194677,0.000043010983,0.00007685303,0.0001502153,0.0002608625,0.002972029],"genre_scores_gemma":[0.7556361,0.00027501959,0.23657373,0.00027830244,0.00011628632,0.000499792,0.0005863362,0.00014185887,0.0058925953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986105,0.0006396298,0.0000566132,0.0003917824,0.0001765395,0.00012487071],"domain_scores_gemma":[0.98876846,0.009243838,0.00074429694,0.00036776141,0.0005993783,0.0002761418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029935546,0.001852823,0.0018036101,0.0013711818,0.0009796027,0.0016237722,0.002183052,0.0024023454,0.0038258773],"category_scores_gemma":[0.01444769,0.0011691955,0.0013223932,0.0010058878,0.0020642555,0.0029970163,0.0024735713,0.0033538071,0.00037898836],"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.000019916142,0.000016412567,0.00043707553,0.000021076423,0.000016634925,0.000029306399,0.000030230398,0.98482555,0.000049976483,0.009200133,0.00027724908,0.0050764424],"study_design_scores_gemma":[0.0000037245063,0.000003467737,0.00002568917,0.000001696755,0.0000013696061,0.0000025236075,0.000005543352,0.99308974,0.000024769153,0.006760806,0.00007903613,0.0000016602974],"about_ca_topic_score_codex":0.0150899105,"about_ca_topic_score_gemma":0.01139699,"teacher_disagreement_score":0.0150899105,"about_ca_system_score_codex":0.0025733663,"about_ca_system_score_gemma":0.0015470226,"threshold_uncertainty_score":0.030004144},"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":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051749726,0.44565132,0.07401817,0.14203227,0.1987063,0.00010616034,0.00074163725,0.00090185186,0.13266732],"genre_scores_gemma":[0.064848214,0.45409876,0.057464812,0.01735264,0.17979813,0.00018989932,0.0019204757,0.0006202453,0.22370686],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988279,0.00034046787,0.00006344601,0.00022623807,0.00038837752,0.00015354938],"domain_scores_gemma":[0.99591136,0.0017236307,0.00017541238,0.00023943881,0.0012662122,0.0006839567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039375834,0.00090957317,0.0009573067,0.0016800945,0.0007390294,0.003763048,0.0016666909,0.0027958215,0.036481477],"category_scores_gemma":[0.006003482,0.0003798811,0.0009186141,0.0017140672,0.00096631,0.0048309136,0.0018478797,0.0036415828,0.012430041],"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.00016655393,0.00012986321,0.00059832865,0.00090324687,0.000054176573,0.00020058517,0.00008703169,0.006871957,0.0010513626,0.10145102,0.5623961,0.32608974],"study_design_scores_gemma":[0.00001504062,0.00011855314,0.00045488187,0.00048359553,0.00002577483,0.00019114348,0.00010208074,0.0057741473,0.00035605906,0.047359735,0.9450837,0.000035230823],"about_ca_topic_score_codex":0.0013631735,"about_ca_topic_score_gemma":0.0020330604,"teacher_disagreement_score":0.036481477,"about_ca_system_score_codex":0.0019223768,"about_ca_system_score_gemma":0.0012069443,"threshold_uncertainty_score":0.122042656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01347575,0.00022521472,0.98283076,0.00025202532,0.000022431348,0.00006921859,0.000044783803,0.00008432595,0.0029955348],"genre_scores_gemma":[0.42564395,0.0004055407,0.56978863,0.0002663651,0.00007431287,0.00064854964,0.0001764711,0.000111517154,0.0028846166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867284,0.0006846844,0.000051854102,0.00017587429,0.00026160796,0.00015311716],"domain_scores_gemma":[0.99594504,0.0034194216,0.00028815842,0.00006450375,0.00021197359,0.00007100686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025280807,0.0015082195,0.0014190382,0.00102782,0.00055959757,0.0014890643,0.0018543571,0.0017793289,0.0018767972],"category_scores_gemma":[0.0050773914,0.0008591265,0.0012893726,0.00098028,0.0009804112,0.0012133064,0.0015303909,0.001568976,0.0002101899],"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.000015058171,0.00001983293,0.00015526045,0.00003795395,0.000023002174,0.000038101916,0.000028971235,0.9891005,0.00019608875,0.004835456,0.00012497725,0.0054247896],"study_design_scores_gemma":[0.0000055746145,0.000016436647,0.000027596963,0.0000063214575,0.0000055071887,0.000008198428,0.000011704125,0.9966343,0.00011472807,0.0030087263,0.00015815663,0.0000027631422],"about_ca_topic_score_codex":0.004837001,"about_ca_topic_score_gemma":0.0035172459,"teacher_disagreement_score":0.004837001,"about_ca_system_score_codex":0.0010383852,"about_ca_system_score_gemma":0.0018557522,"threshold_uncertainty_score":0.0133699775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2131369,0.00035691325,0.7799017,0.00021784529,0.00010275045,0.00013894631,0.00021029927,0.00039837862,0.0055362377],"genre_scores_gemma":[0.92253006,0.00017535682,0.07077805,0.00005007606,0.000050255283,0.000101760495,0.00023819978,0.000086810236,0.005989438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993647,0.00016447832,0.000017203389,0.00012626116,0.00013608944,0.00019140306],"domain_scores_gemma":[0.99963176,0.00014488927,0.00006550931,0.00002502654,0.0000544932,0.0000782561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071743573,0.00092015584,0.0011736372,0.000526839,0.0005515634,0.0009284631,0.0011809792,0.00095908873,0.003918537],"category_scores_gemma":[0.0010380445,0.00057106174,0.00089737144,0.00077490386,0.0004030291,0.00078114384,0.0009726542,0.0010154161,0.00037456254],"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.00019223154,0.00018173529,0.00056522357,0.000062259176,0.00006039882,0.00012589913,0.0000687148,0.9735136,0.0025987246,0.0027616834,0.00083615177,0.019033428],"study_design_scores_gemma":[0.00002234532,0.00010556516,0.00034932815,0.0000034804373,0.00001630039,0.000023195273,0.000043905748,0.9969008,0.0005426541,0.0014514892,0.00053413835,0.000006801744],"about_ca_topic_score_codex":0.009685325,"about_ca_topic_score_gemma":0.008080343,"teacher_disagreement_score":0.009685325,"about_ca_system_score_codex":0.0011709102,"about_ca_system_score_gemma":0.0014254432,"threshold_uncertainty_score":0.019257903},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055965506,0.0012685761,0.9327501,0.0017318508,0.000090702124,0.000049755912,0.00014882405,0.00014408298,0.007850644],"genre_scores_gemma":[0.91483384,0.00066433655,0.082658514,0.00015227079,0.00010563627,0.00007697063,0.00008925667,0.0000790541,0.0013401083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965114,0.0023015398,0.000103638755,0.0003340278,0.00046454667,0.00028489696],"domain_scores_gemma":[0.98067963,0.016413162,0.0011112776,0.0010900475,0.0003807112,0.00032515015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051724818,0.0014316508,0.0016484265,0.00074121484,0.0010751099,0.002345116,0.001956582,0.0020589463,0.0020686896],"category_scores_gemma":[0.024356816,0.00096844044,0.0013954452,0.0012455271,0.002696298,0.0037881231,0.002331788,0.0030620482,0.00023505557],"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.000071502356,0.000013721226,0.0002364129,0.00004626985,0.000027071817,0.00008007991,0.000037376958,0.96041673,0.00031860865,0.034153387,0.00026015443,0.0043386864],"study_design_scores_gemma":[0.000014062879,0.00004581252,0.00009113959,0.000020833479,0.000013188875,0.000036062447,0.000026078158,0.9529358,0.00028770018,0.046014734,0.00050126016,0.000013313731],"about_ca_topic_score_codex":0.0024129406,"about_ca_topic_score_gemma":0.0015945088,"teacher_disagreement_score":0.0051724818,"about_ca_system_score_codex":0.0014954936,"about_ca_system_score_gemma":0.00091219984,"threshold_uncertainty_score":0.027355015},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005441984,0.00008083266,0.9928423,0.000063525105,0.000024099436,0.00007476383,0.00006421614,0.00021282863,0.001195353],"genre_scores_gemma":[0.12133236,0.00018422553,0.8749391,0.00012202267,0.000056042132,0.00038016852,0.00053850317,0.00020724947,0.0022402955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903786,0.00046473637,0.000038088845,0.0001480523,0.00018396313,0.00012720838],"domain_scores_gemma":[0.998073,0.001273537,0.00016586982,0.00017484512,0.0002270363,0.000085685024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002029756,0.0020631342,0.0016208768,0.0014090382,0.0006859821,0.0010683959,0.0012923637,0.0014093234,0.004175553],"category_scores_gemma":[0.0036209596,0.001041084,0.001782596,0.0018293399,0.0007295909,0.0013483827,0.0012566055,0.002109522,0.00073862495],"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.000028892888,0.00007340124,0.00035549045,0.000047311383,0.00003107201,0.000037148162,0.000030115278,0.9629174,0.0007256128,0.006983546,0.0010500074,0.027720045],"study_design_scores_gemma":[0.0000069133694,0.000020187023,0.000038077822,0.0000035874812,0.000004865782,0.0000075067896,0.0000072667945,0.99536836,0.00021293614,0.0038259756,0.0005002053,0.0000041561293],"about_ca_topic_score_codex":0.008620347,"about_ca_topic_score_gemma":0.010585835,"teacher_disagreement_score":0.008620347,"about_ca_system_score_codex":0.0010331041,"about_ca_system_score_gemma":0.0016827857,"threshold_uncertainty_score":0.017140329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002998733,0.9933435,0.0022553958,0.00038114417,0.00033581848,0.000015278485,0.000058827212,0.000022542807,0.0032876225],"genre_scores_gemma":[0.0016903109,0.9959578,0.0012463732,0.00011672865,0.00026022035,0.000011930667,0.00008593177,0.000006153834,0.0006245484],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994425,0.00010328885,0.000069742775,0.00013922103,0.00019946085,0.00004577613],"domain_scores_gemma":[0.99819285,0.0011894836,0.00016396222,0.000048716458,0.0003514845,0.00005346345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009847906,0.001520069,0.0015692262,0.003439225,0.00046561565,0.0020393974,0.0017130343,0.001863197,0.006564934],"category_scores_gemma":[0.0025913268,0.00076109404,0.0010259867,0.0075917384,0.000550705,0.0032245126,0.00081261015,0.0016433625,0.0027512265],"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.000052776235,0.00012416435,0.0004404091,0.043656748,0.00015583874,0.00018107201,0.00008674543,0.0067406017,0.0006857448,0.020089367,0.03886787,0.88891864],"study_design_scores_gemma":[0.000014466034,0.00014441396,0.00092186726,0.01392191,0.0003283768,0.00077992945,0.00019359104,0.0018925844,0.00050652766,0.010626997,0.97061723,0.000052134445],"about_ca_topic_score_codex":0.0029814865,"about_ca_topic_score_gemma":0.0030101559,"teacher_disagreement_score":0.006564934,"about_ca_system_score_codex":0.0009792639,"about_ca_system_score_gemma":0.0025415958,"threshold_uncertainty_score":0.021961927},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011442231,0.0013315332,0.97535545,0.00058842264,0.00011623074,0.00033122126,0.00044812972,0.00029138563,0.01009551],"genre_scores_gemma":[0.194708,0.002435016,0.78651583,0.00018100376,0.00022944149,0.0012125735,0.0013988882,0.00037468033,0.012944538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904567,0.00041111064,0.000043747285,0.00015066893,0.00018965459,0.0001592325],"domain_scores_gemma":[0.9982835,0.0013754637,0.00010499281,0.000047790112,0.0000976446,0.00009063193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029360503,0.0017795508,0.0019424721,0.0011587953,0.00097137893,0.0020538932,0.0015857551,0.0018301742,0.01352672],"category_scores_gemma":[0.0048280354,0.0009980962,0.0012853992,0.0027538852,0.0007974302,0.0018883608,0.0012175691,0.0029396787,0.0016665958],"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.0002011796,0.00018238838,0.000664083,0.00044180293,0.0000632604,0.00017818103,0.000098478275,0.85645384,0.0007736071,0.06395966,0.0082286,0.068754934],"study_design_scores_gemma":[0.000054145803,0.000046369223,0.00012712226,0.000027310945,0.00001596909,0.000034308072,0.000023077764,0.972607,0.00022837534,0.023987615,0.002840653,0.000008050527],"about_ca_topic_score_codex":0.009019103,"about_ca_topic_score_gemma":0.009851693,"teacher_disagreement_score":0.01352672,"about_ca_system_score_codex":0.0018120498,"about_ca_system_score_gemma":0.0035722142,"threshold_uncertainty_score":0.04525137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07822338,0.0009891466,0.88960963,0.0021974759,0.0004003825,0.0003860313,0.0010127741,0.0002299203,0.026951233],"genre_scores_gemma":[0.5624243,0.0016004619,0.39598078,0.000474333,0.00037015887,0.00074190414,0.0009851193,0.0002493331,0.037173606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915314,0.00026852536,0.0000417055,0.00019425672,0.00015378612,0.00018860339],"domain_scores_gemma":[0.9985927,0.00087749894,0.00017620565,0.00010441044,0.00012444454,0.00012482656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013558135,0.0013876422,0.0014221267,0.0005915522,0.0009486122,0.0016299635,0.0023435515,0.0020113871,0.00877984],"category_scores_gemma":[0.0030701929,0.0005631362,0.0011017292,0.0014597519,0.0014295406,0.0037265262,0.0014883216,0.0019471694,0.0006135935],"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.00018840973,0.00014710776,0.00059531786,0.0003340007,0.00006588754,0.0004895378,0.00015065048,0.677334,0.0021095609,0.27295575,0.008847616,0.036782045],"study_design_scores_gemma":[0.0000933153,0.00016529705,0.00038371922,0.000033205455,0.000039400576,0.0002034395,0.00009370733,0.8122032,0.0017388585,0.17313728,0.011868241,0.00004026921],"about_ca_topic_score_codex":0.0047245985,"about_ca_topic_score_gemma":0.004218147,"teacher_disagreement_score":0.00877984,"about_ca_system_score_codex":0.0016903019,"about_ca_system_score_gemma":0.0033645174,"threshold_uncertainty_score":0.02937156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024098048,0.0015940974,0.9341713,0.0009895745,0.00018281306,0.00018794014,0.0005566215,0.00039278046,0.03782688],"genre_scores_gemma":[0.41438937,0.0017241519,0.56194884,0.00035581883,0.0002460037,0.00052321545,0.0013172164,0.0003382075,0.019157184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993523,0.0002248049,0.00002647272,0.000116833195,0.00015045062,0.00012916184],"domain_scores_gemma":[0.99792117,0.0015689129,0.0001487573,0.000077600555,0.0002128762,0.000070814225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012587892,0.0013521146,0.0012339607,0.0009332511,0.0007422422,0.0018234026,0.0014127265,0.0020194144,0.013086049],"category_scores_gemma":[0.0054729637,0.0005733083,0.0008252626,0.0015999409,0.0007555118,0.0014649873,0.0010192397,0.0016447151,0.0014337655],"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.000044836972,0.00008096395,0.00034609583,0.00016782217,0.000026104135,0.000076804994,0.000051434872,0.9115151,0.00021503179,0.04972392,0.006480691,0.031271104],"study_design_scores_gemma":[0.00001208322,0.000015326274,0.000055585304,0.000012414674,0.000005265263,0.000013793522,0.00002741948,0.9763782,0.00007643212,0.021916125,0.0014828425,0.0000044089356],"about_ca_topic_score_codex":0.011953408,"about_ca_topic_score_gemma":0.011705978,"teacher_disagreement_score":0.013086049,"about_ca_system_score_codex":0.0015895911,"about_ca_system_score_gemma":0.0024786415,"threshold_uncertainty_score":0.043777227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012711019,0.00028599423,0.9783197,0.00028777454,0.000056631914,0.00024578537,0.00021878601,0.00043438567,0.007439945],"genre_scores_gemma":[0.080028005,0.00028985625,0.9137589,0.00012014155,0.00003559244,0.0003241427,0.00058471045,0.00018588839,0.0046727546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944896,0.00016786021,0.000021317655,0.00011957398,0.00013281975,0.00010939207],"domain_scores_gemma":[0.99939585,0.00037060853,0.000055679357,0.00004124717,0.0000853617,0.00005133656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007810095,0.0011006219,0.0011339919,0.00087504275,0.0010395626,0.0011632589,0.0015726613,0.0016042596,0.00906171],"category_scores_gemma":[0.0018027802,0.00069538027,0.000689353,0.0015011387,0.0005053978,0.001653103,0.0011851292,0.0017507575,0.0012032269],"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.00022959668,0.00035381396,0.0006501316,0.00027682394,0.0000617835,0.00018686561,0.00013262956,0.6397,0.002572201,0.039243158,0.012716457,0.30387658],"study_design_scores_gemma":[0.00007941601,0.00010043625,0.00017084161,0.000023342183,0.000017626293,0.000074437,0.000056234843,0.97159374,0.0009784143,0.020627562,0.0062670344,0.0000109651],"about_ca_topic_score_codex":0.004860424,"about_ca_topic_score_gemma":0.0066647977,"teacher_disagreement_score":0.00906171,"about_ca_system_score_codex":0.0010876915,"about_ca_system_score_gemma":0.0022243995,"threshold_uncertainty_score":0.030314505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028173434,0.0001448206,0.964225,0.00016087932,0.000040830415,0.00018279423,0.0003062369,0.0005401828,0.006225851],"genre_scores_gemma":[0.4282092,0.00036788435,0.5627419,0.00015922521,0.00006148481,0.0003939214,0.0009931428,0.0003105914,0.006762807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991541,0.0003259523,0.000028844925,0.00023643668,0.00013011703,0.00012466303],"domain_scores_gemma":[0.9991073,0.00043503905,0.00014734139,0.00011541138,0.00012416432,0.00007075183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011088828,0.001416705,0.0010790131,0.0007230293,0.0003361513,0.0011251705,0.0015028279,0.0010591504,0.007871611],"category_scores_gemma":[0.0020865153,0.00066114083,0.0010989483,0.0011632977,0.00050498365,0.0014275619,0.0011710994,0.0011366106,0.00093475904],"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.00003395467,0.000039082595,0.00020916683,0.000057169014,0.000016127477,0.000051513463,0.000020066682,0.97861826,0.0010367215,0.0037673018,0.00069742394,0.015453311],"study_design_scores_gemma":[0.000008573653,0.000036757327,0.000052863506,0.0000036913173,0.0000065377985,0.000015882284,0.000010081242,0.996512,0.00045072712,0.0021083755,0.00079124316,0.0000032663704],"about_ca_topic_score_codex":0.004072477,"about_ca_topic_score_gemma":0.005048814,"teacher_disagreement_score":0.007871611,"about_ca_system_score_codex":0.0012403115,"about_ca_system_score_gemma":0.0014917374,"threshold_uncertainty_score":0.026333094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049300357,0.00016567357,0.9903858,0.0001275589,0.000054122072,0.000085874366,0.000053636297,0.00026237642,0.0039350153],"genre_scores_gemma":[0.09010372,0.00030046556,0.90531754,0.00011287203,0.000058837915,0.0002847731,0.0002884659,0.00013791955,0.0033953323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942744,0.00020083443,0.000023977242,0.00011188412,0.00017086261,0.000065122964],"domain_scores_gemma":[0.9993438,0.00037360037,0.000058574282,0.00005403356,0.00012794923,0.000041993502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075772643,0.00096245046,0.0009959433,0.0011795615,0.0008408168,0.0011160929,0.0011327033,0.0011048854,0.005447691],"category_scores_gemma":[0.0024180147,0.00060453877,0.00068600435,0.0013566919,0.00059929676,0.0015526504,0.0016448074,0.0017394611,0.0011076755],"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.000091112684,0.00016285447,0.00039412387,0.00019227085,0.000037388756,0.000106053936,0.00016636307,0.71149397,0.0035189888,0.0739923,0.0071831164,0.20266141],"study_design_scores_gemma":[0.000020766063,0.00003806765,0.000043749667,0.000012663244,0.000006755475,0.00005212797,0.000022275057,0.98302436,0.00055859186,0.013145351,0.0030676003,0.000007760947],"about_ca_topic_score_codex":0.0026974448,"about_ca_topic_score_gemma":0.0026054506,"teacher_disagreement_score":0.005447691,"about_ca_system_score_codex":0.0007641671,"about_ca_system_score_gemma":0.0019624925,"threshold_uncertainty_score":0.018224299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020364376,0.00015717758,0.9928584,0.0002463002,0.000051534156,0.00014770932,0.00016365983,0.00030318217,0.0040354766],"genre_scores_gemma":[0.040323116,0.0003326351,0.9540697,0.000096603224,0.00004850969,0.00038173917,0.0005491636,0.0001836805,0.0040149563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915457,0.00023599256,0.000044441305,0.00020755011,0.0002569039,0.00010052551],"domain_scores_gemma":[0.99935645,0.00036143736,0.00004552032,0.00006389887,0.00012592235,0.000046734738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000937036,0.0014722596,0.0011898958,0.0008846013,0.0010819008,0.000981191,0.0020837667,0.0019532524,0.013937218],"category_scores_gemma":[0.004006427,0.0006302879,0.001194833,0.0019344294,0.00070857763,0.002035247,0.0020083245,0.0027562655,0.0025218655],"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.00008729333,0.00020975358,0.00053828687,0.00027319742,0.000074335774,0.00018743666,0.00018252876,0.64678484,0.0022111621,0.124280296,0.019757532,0.2054134],"study_design_scores_gemma":[0.00011058576,0.000069816364,0.00014124143,0.000033519158,0.000020304959,0.00013003845,0.000055229608,0.903355,0.0006545972,0.07829887,0.017106827,0.000023867815],"about_ca_topic_score_codex":0.006224259,"about_ca_topic_score_gemma":0.0072602206,"teacher_disagreement_score":0.013937218,"about_ca_system_score_codex":0.0012116388,"about_ca_system_score_gemma":0.0039228927,"threshold_uncertainty_score":0.0466246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035508163,0.00095235737,0.9532299,0.00041388645,0.00012870901,0.00023593698,0.0007422044,0.00038622267,0.008402649],"genre_scores_gemma":[0.5569316,0.0008978661,0.43238926,0.00027070433,0.00014203365,0.0004669839,0.0014690827,0.00022852237,0.007204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999281,0.0002705608,0.000018669476,0.00012829478,0.00015315037,0.00014823682],"domain_scores_gemma":[0.999138,0.0005307395,0.000100610734,0.00005540278,0.000104156294,0.000071112394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009630852,0.0013683419,0.0011831643,0.0007841165,0.00069008034,0.001303366,0.0010588221,0.0010179447,0.005943345],"category_scores_gemma":[0.0017302255,0.0005766277,0.0009762741,0.002162896,0.00064026355,0.00095580565,0.00086635613,0.0015474698,0.0006022425],"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.00008280838,0.00008473664,0.00040509203,0.00015249163,0.000034647273,0.00013110069,0.00003737146,0.95558256,0.0010560602,0.013560391,0.0031499804,0.025722807],"study_design_scores_gemma":[0.000017364067,0.000034455992,0.00014578436,0.000008079078,0.000011944931,0.000032589316,0.000017415845,0.99360967,0.0003842942,0.0046790615,0.0010524711,0.0000069905786],"about_ca_topic_score_codex":0.013819804,"about_ca_topic_score_gemma":0.015092299,"teacher_disagreement_score":0.013819804,"about_ca_system_score_codex":0.0013153928,"about_ca_system_score_gemma":0.002470212,"threshold_uncertainty_score":0.027478755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20907645,0.0008444106,0.7793434,0.00075154385,0.0000749054,0.00006367181,0.00029455323,0.00045061117,0.009100517],"genre_scores_gemma":[0.9830892,0.0002602368,0.014523891,0.000031745985,0.000024426836,0.0000378187,0.00012237192,0.000039306895,0.001871029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992011,0.00027293444,0.000029160186,0.000086810425,0.00020230317,0.00020766829],"domain_scores_gemma":[0.99685705,0.0018872125,0.00033541804,0.00021723163,0.0005715523,0.00013147548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020267486,0.0007750538,0.00082102703,0.0006005701,0.0004300956,0.0010922113,0.0011915313,0.00073168497,0.0017206594],"category_scores_gemma":[0.009028398,0.00034910414,0.00053868035,0.0006162593,0.0008208651,0.00075327675,0.0009922567,0.00095333555,0.0002117553],"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.000040464605,0.000008223541,0.00043182707,0.000017837014,0.000006986941,0.00002978297,0.00003556338,0.9905104,0.00042602085,0.006355776,0.0002123336,0.0019247653],"study_design_scores_gemma":[0.0000012720914,0.0000057451857,0.00008154345,0.000002163797,0.0000012854781,0.000004821837,0.000006782135,0.9988657,0.00005634808,0.00092032313,0.000052294326,0.0000016290977],"about_ca_topic_score_codex":0.016518753,"about_ca_topic_score_gemma":0.004409385,"teacher_disagreement_score":0.016518753,"about_ca_system_score_codex":0.0019250811,"about_ca_system_score_gemma":0.0014046924,"threshold_uncertainty_score":0.0328452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019114286,0.0021857906,0.9628103,0.00069791503,0.0002000413,0.00043653694,0.0003432398,0.0011241377,0.013087675],"genre_scores_gemma":[0.20481406,0.0020072036,0.7824369,0.0003151302,0.00022062393,0.00094750186,0.0012001952,0.00055246585,0.0075059286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877316,0.00046699782,0.00006150175,0.00021294011,0.00023289434,0.00025249165],"domain_scores_gemma":[0.99722254,0.0021001087,0.00020152419,0.00013092661,0.0001869553,0.00015795129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024102116,0.0026772693,0.002883127,0.0018728604,0.0012748678,0.0024891472,0.0029644095,0.0024984658,0.011273395],"category_scores_gemma":[0.005287229,0.0013131534,0.0014992601,0.0040109428,0.0009949517,0.0035925526,0.0018344879,0.0036637574,0.0018173271],"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.00015947733,0.00025377524,0.0003860189,0.00021202741,0.000095026946,0.00006249917,0.00008156708,0.86555064,0.00046219144,0.030825473,0.007258706,0.0946526],"study_design_scores_gemma":[0.000060099177,0.000044709435,0.00007060792,0.000017643413,0.000014631814,0.000017369464,0.000023328696,0.9810049,0.00017130919,0.017115293,0.0014518213,0.000008278977],"about_ca_topic_score_codex":0.009729735,"about_ca_topic_score_gemma":0.011263976,"teacher_disagreement_score":0.011273395,"about_ca_system_score_codex":0.00263999,"about_ca_system_score_gemma":0.0035372253,"threshold_uncertainty_score":0.03771323},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018681485,0.0038479045,0.9885273,0.00027305694,0.00012162406,0.000058090234,0.0001170184,0.00018761381,0.004999298],"genre_scores_gemma":[0.12374613,0.011670155,0.85494965,0.00034684714,0.00043434397,0.00042327895,0.00091941457,0.00035947582,0.007150725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976044,0.0008134281,0.00013223724,0.00038084123,0.00083960046,0.00022948104],"domain_scores_gemma":[0.99688137,0.0022233543,0.00020536552,0.00025805592,0.0003621163,0.00006978945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024588162,0.0020781523,0.0022967686,0.0012674882,0.0008374374,0.0024714626,0.0025054144,0.0022656552,0.0069970433],"category_scores_gemma":[0.00834533,0.0009358133,0.0013742003,0.004397824,0.0012171941,0.0034065698,0.0017428586,0.003678224,0.0019782928],"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.000055815573,0.00009790465,0.00030671,0.00041605765,0.0000818895,0.00004217389,0.000062813684,0.6856169,0.00039649,0.11203555,0.00828944,0.19259821],"study_design_scores_gemma":[0.000027099002,0.000033602875,0.00009767255,0.00006259078,0.000023022392,0.000044684246,0.000020254025,0.84706503,0.0003161505,0.14497109,0.0073271324,0.000011635014],"about_ca_topic_score_codex":0.0040573003,"about_ca_topic_score_gemma":0.0039251572,"teacher_disagreement_score":0.0069970433,"about_ca_system_score_codex":0.0017879622,"about_ca_system_score_gemma":0.0024183218,"threshold_uncertainty_score":0.02340746},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12331805,0.0011502549,0.8682125,0.0010168117,0.00014024289,0.00012522328,0.00031032588,0.00017838566,0.005548253],"genre_scores_gemma":[0.9590978,0.0005845653,0.03621905,0.00009716015,0.00005125285,0.00016770372,0.00024160603,0.00004610441,0.0034947558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991954,0.0003257287,0.000028407187,0.00017030664,0.00009210593,0.00018816633],"domain_scores_gemma":[0.996988,0.0023374,0.00030499912,0.00006531942,0.00017610616,0.00012818263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015081692,0.0019774684,0.001478114,0.0007804021,0.0005719308,0.0014035078,0.0014911338,0.0020418689,0.00199065],"category_scores_gemma":[0.004182482,0.0012249238,0.0010393774,0.0010138119,0.0012613072,0.0018370067,0.0012500975,0.0017438857,0.00011146236],"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.00003095043,0.000012569273,0.00012770078,0.000019691402,0.000011266443,0.0000226814,0.000009458506,0.9952684,0.00009627272,0.0029869925,0.0001364834,0.001277494],"study_design_scores_gemma":[0.000008551055,0.000022093533,0.000046954887,0.0000033166841,0.0000061063574,0.000005064743,0.000012294124,0.9961125,0.000070269096,0.0035904702,0.00011911108,0.0000032784155],"about_ca_topic_score_codex":0.013967054,"about_ca_topic_score_gemma":0.0075314073,"teacher_disagreement_score":0.013967054,"about_ca_system_score_codex":0.0017346208,"about_ca_system_score_gemma":0.0014027902,"threshold_uncertainty_score":0.027771533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34582144,0.0013794041,0.5891397,0.0032237824,0.0003055674,0.0011167421,0.0068327184,0.000926271,0.051254336],"genre_scores_gemma":[0.8697042,0.00070775824,0.108787335,0.00031203806,0.00012504225,0.00052044226,0.004318049,0.00021401278,0.01531117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989158,0.000351387,0.000055842942,0.00036356604,0.00012935438,0.00018412652],"domain_scores_gemma":[0.9991223,0.00046869306,0.00009363997,0.00010289097,0.00008017904,0.00013228557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000947281,0.0011030461,0.0014925885,0.00060200976,0.0008831628,0.0015620362,0.0017946792,0.0017515537,0.011655983],"category_scores_gemma":[0.0026372995,0.00048969325,0.0010388122,0.0014425472,0.000705535,0.0024994547,0.0015484175,0.0011541129,0.0008627299],"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.0003382842,0.00034981442,0.0022311592,0.00040652874,0.00018330869,0.00048611383,0.0002135496,0.85371935,0.0013166622,0.04648821,0.014776873,0.07949009],"study_design_scores_gemma":[0.00013139161,0.0002139429,0.0013479957,0.000041906704,0.00006530244,0.00048224366,0.00056892954,0.87251765,0.0014279309,0.10596148,0.017200567,0.000040685874],"about_ca_topic_score_codex":0.0055922237,"about_ca_topic_score_gemma":0.0033885255,"teacher_disagreement_score":0.011655983,"about_ca_system_score_codex":0.0010697427,"about_ca_system_score_gemma":0.0017109402,"threshold_uncertainty_score":0.03899318},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00725151,0.000143991,0.9878442,0.00013772002,0.000031609303,0.00007505473,0.00016356341,0.00069895154,0.0036534255],"genre_scores_gemma":[0.13198224,0.00015702624,0.8646066,0.0000905787,0.000033486933,0.00019205196,0.00053300045,0.00016120687,0.0022438047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941576,0.00013659362,0.00002700444,0.00013465187,0.00017686628,0.00010899907],"domain_scores_gemma":[0.99931705,0.00031516308,0.00008014795,0.00013560735,0.00011674543,0.000035225217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672556,0.00094795856,0.0010477968,0.00084084563,0.0005192962,0.0010594947,0.0017396118,0.001179625,0.0071799676],"category_scores_gemma":[0.0023910643,0.0005867866,0.00072567,0.0015017706,0.0005366374,0.0013947304,0.0012480047,0.0013955561,0.0013048465],"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.00008696892,0.00010805996,0.00036486346,0.00012869424,0.00003689822,0.00007410254,0.00005377134,0.8110418,0.0015509108,0.025358824,0.004460487,0.15673459],"study_design_scores_gemma":[0.00004006062,0.000029872283,0.000075011005,0.000008114992,0.000006582653,0.00002887988,0.0000144508995,0.98337007,0.00044859303,0.014595755,0.001376581,0.0000059569675],"about_ca_topic_score_codex":0.0050338586,"about_ca_topic_score_gemma":0.0067363027,"teacher_disagreement_score":0.0071799676,"about_ca_system_score_codex":0.001182784,"about_ca_system_score_gemma":0.0019791592,"threshold_uncertainty_score":0.02401942},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01760161,0.00038636426,0.97477424,0.00045476083,0.0000616639,0.0003093415,0.00033159213,0.0005517265,0.0055285604],"genre_scores_gemma":[0.10576738,0.00029939698,0.88901633,0.0001400637,0.000056118653,0.00056748843,0.0008350583,0.00015989324,0.0031583488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913424,0.0003138237,0.000040541043,0.00021737018,0.00015175086,0.0001422927],"domain_scores_gemma":[0.99847406,0.001133905,0.0001079794,0.00006073604,0.00013558396,0.000087748216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015601454,0.0016325434,0.001746856,0.0009653226,0.000895079,0.0015491763,0.0018191759,0.0020149183,0.0068125436],"category_scores_gemma":[0.0032037531,0.0008975998,0.0010678509,0.0019254468,0.0005845354,0.0017438353,0.0013808156,0.0021568686,0.00084719236],"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.0001212059,0.00019976293,0.00046350693,0.00014694448,0.000041674073,0.00010281463,0.00008544932,0.8987525,0.0006604589,0.015912326,0.0049280077,0.07858525],"study_design_scores_gemma":[0.00004601531,0.00003834218,0.000053199197,0.000008871091,0.000008234801,0.000018466895,0.000022695334,0.99112153,0.00016483432,0.00761906,0.00089436537,0.000004394877],"about_ca_topic_score_codex":0.010201251,"about_ca_topic_score_gemma":0.010130168,"teacher_disagreement_score":0.010201251,"about_ca_system_score_codex":0.0016638396,"about_ca_system_score_gemma":0.0029131435,"threshold_uncertainty_score":0.022790253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019327056,0.00037031743,0.97495484,0.00043342495,0.00007023346,0.000114297894,0.00012328061,0.00015277386,0.0044537303],"genre_scores_gemma":[0.64062685,0.0007516386,0.35022068,0.00028361444,0.00012721188,0.00036519062,0.00037065087,0.00011891027,0.0071352534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985813,0.00055159273,0.00006806744,0.00032008762,0.00030367982,0.00017529838],"domain_scores_gemma":[0.9979231,0.0012838806,0.00022979199,0.00013011991,0.00030285458,0.00013019987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018255849,0.00084278936,0.0012634655,0.0006280862,0.00042700738,0.0016785365,0.0020160829,0.0020259137,0.0026472367],"category_scores_gemma":[0.004786807,0.00057406945,0.00087578397,0.00080297334,0.0009674034,0.001489372,0.001126582,0.0019801096,0.00039858735],"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.000033643682,0.00004668687,0.00020605205,0.000051891544,0.000018041323,0.000080801496,0.000028306515,0.97700953,0.00035927325,0.013562001,0.00047076715,0.008132972],"study_design_scores_gemma":[0.0000119508595,0.000030908635,0.000039314164,0.00000964322,0.000004712274,0.000021704676,0.000008849116,0.99289,0.0001404977,0.00623519,0.00060214545,0.0000050445465],"about_ca_topic_score_codex":0.005877802,"about_ca_topic_score_gemma":0.004130273,"teacher_disagreement_score":0.005877802,"about_ca_system_score_codex":0.000926579,"about_ca_system_score_gemma":0.0019063106,"threshold_uncertainty_score":0.01168716},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07077488,0.0012663367,0.9066696,0.00078667665,0.000078501325,0.00013109227,0.0005247901,0.00026425763,0.019503877],"genre_scores_gemma":[0.6133684,0.0013381151,0.37611124,0.00017797024,0.00009563118,0.00029089267,0.00086193497,0.00013429148,0.0076215114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932265,0.0002604134,0.000029091123,0.00015760158,0.00011727782,0.000113046],"domain_scores_gemma":[0.9985695,0.0010319888,0.0001621167,0.000101732956,0.00008122911,0.000053475258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010775056,0.0010685842,0.0009901744,0.0007281205,0.00055838015,0.0011805311,0.0011664218,0.0020371277,0.005925637],"category_scores_gemma":[0.0033498902,0.0005816022,0.0010084213,0.0012207737,0.00075579627,0.0016904025,0.0009785603,0.0012482669,0.0003384442],"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.00002858797,0.00005207346,0.0004145862,0.000083403436,0.000020717758,0.00008899671,0.00004070259,0.956032,0.00033666857,0.0237602,0.0014118088,0.017730365],"study_design_scores_gemma":[0.000014958665,0.000023965918,0.00014956933,0.000012754572,0.0000074191853,0.0000500527,0.000030089368,0.97926223,0.00021920846,0.01887988,0.0013450864,0.0000047188273],"about_ca_topic_score_codex":0.0037572444,"about_ca_topic_score_gemma":0.0041364385,"teacher_disagreement_score":0.005925637,"about_ca_system_score_codex":0.0011045777,"about_ca_system_score_gemma":0.00088619196,"threshold_uncertainty_score":0.019823194},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017695712,0.0002157314,0.9787658,0.00011411053,0.000032406944,0.000089812034,0.00005845017,0.00051832426,0.0025097316],"genre_scores_gemma":[0.27238813,0.000499906,0.72196555,0.00011866192,0.000055070464,0.00041894117,0.0004085897,0.00038483768,0.0037603893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986915,0.0007087238,0.00003105839,0.00013970166,0.00024382486,0.00018524574],"domain_scores_gemma":[0.99751425,0.0018844287,0.0001825111,0.00020866291,0.00012583571,0.00008428622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034394339,0.0015735008,0.0013761838,0.001642883,0.000650181,0.0011142042,0.0019044037,0.0012917233,0.00587744],"category_scores_gemma":[0.006516474,0.0010524512,0.0014682317,0.0021519084,0.0010529191,0.0018962377,0.0013465829,0.003277863,0.00080798933],"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.00008886714,0.000096368276,0.00036725216,0.00007148578,0.000029616913,0.000053589116,0.000064848035,0.92093146,0.0008134561,0.03128553,0.0010285107,0.04516902],"study_design_scores_gemma":[0.000026274165,0.00005139642,0.0000524878,0.00001580182,0.000012059651,0.000015207162,0.000008952183,0.9831081,0.00044981702,0.015371321,0.00088239886,0.0000061084334],"about_ca_topic_score_codex":0.007034501,"about_ca_topic_score_gemma":0.0067287046,"teacher_disagreement_score":0.007034501,"about_ca_system_score_codex":0.0013836964,"about_ca_system_score_gemma":0.002067982,"threshold_uncertainty_score":0.019661963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022513901,0.00006487971,0.99651307,0.000056959758,0.000013498804,0.000034120414,0.000035333236,0.000088766945,0.000942049],"genre_scores_gemma":[0.15628435,0.0005171119,0.83806354,0.00008770759,0.000054724296,0.00045382636,0.00024214372,0.00019962221,0.0040969504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992925,0.0003073634,0.000026730042,0.00010994805,0.00018485358,0.000078581645],"domain_scores_gemma":[0.99902105,0.00058009353,0.00014622664,0.00007226665,0.0001340076,0.000046306708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019794775,0.0022325611,0.0012232543,0.0013178883,0.00067897973,0.0010238966,0.001004758,0.0012206702,0.005150609],"category_scores_gemma":[0.0033868882,0.0012975853,0.0017091257,0.0011741018,0.0006657864,0.0016336023,0.0010517406,0.0018688536,0.00066798256],"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.000013725107,0.000014132294,0.00011335283,0.000035424313,0.000019077897,0.00002040385,0.000022265685,0.97873884,0.0009135916,0.00782273,0.00037710246,0.011909346],"study_design_scores_gemma":[0.000004848808,0.00001659285,0.000026885607,0.0000070372075,0.0000072051203,0.000008433751,0.000007057356,0.993694,0.00023386026,0.0053075026,0.00068242545,0.0000041620497],"about_ca_topic_score_codex":0.0064855157,"about_ca_topic_score_gemma":0.0064785546,"teacher_disagreement_score":0.0064855157,"about_ca_system_score_codex":0.0014151252,"about_ca_system_score_gemma":0.002069036,"threshold_uncertainty_score":0.01723051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1580531,0.00043542634,0.78569573,0.0017743356,0.00025307306,0.00017879544,0.0011078969,0.0006883288,0.051813226],"genre_scores_gemma":[0.9049383,0.00031905627,0.069199435,0.00012847199,0.00007139913,0.00009613449,0.00058315723,0.00009604011,0.024567986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994481,0.0001402034,0.000016949338,0.00013985203,0.0000937681,0.0001611458],"domain_scores_gemma":[0.99958307,0.00012524564,0.000076447956,0.000082797866,0.000072431816,0.000059980204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004972045,0.00084639597,0.0006850104,0.00033132537,0.0005178156,0.0016819062,0.0013937638,0.0012005039,0.0076794387],"category_scores_gemma":[0.0013612871,0.0004323771,0.0007174662,0.00087483693,0.0006986717,0.0021179717,0.0013628218,0.0014321669,0.0007258948],"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.000077409444,0.00007742591,0.00045215292,0.000029762143,0.000020877413,0.000106476575,0.00002556632,0.9363375,0.00078614487,0.045455836,0.0026366883,0.013994212],"study_design_scores_gemma":[0.00002789975,0.000033324246,0.00015994892,0.000005734916,0.000010873042,0.000049313967,0.000050021426,0.95585334,0.00058091705,0.036812708,0.0064055854,0.0000103337725],"about_ca_topic_score_codex":0.0077516814,"about_ca_topic_score_gemma":0.008758245,"teacher_disagreement_score":0.0077516814,"about_ca_system_score_codex":0.0018943857,"about_ca_system_score_gemma":0.0017489111,"threshold_uncertainty_score":0.025690258},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19937952,0.00041953576,0.78964823,0.00036404404,0.00009111792,0.0003509321,0.00022694211,0.00052848435,0.008991173],"genre_scores_gemma":[0.7547672,0.00025892665,0.2405222,0.0001513177,0.000062915555,0.0003071713,0.00039011525,0.00015926342,0.0033808495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920565,0.00027218266,0.0000319762,0.00016750817,0.0001499127,0.000172806],"domain_scores_gemma":[0.9991874,0.000333446,0.00013968974,0.00011401677,0.0001007829,0.0001246843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011009135,0.0011636894,0.0012124435,0.0005898476,0.0004981846,0.00083927676,0.0011696585,0.0009493962,0.0047971564],"category_scores_gemma":[0.002544011,0.00045645385,0.00074462936,0.00088194804,0.00044934367,0.0015700221,0.0013050267,0.0014237528,0.00054943335],"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.00021296993,0.00035487593,0.002648153,0.00014870816,0.00006189184,0.0001923447,0.00013338686,0.89532757,0.0057140575,0.008397122,0.0023817439,0.08442709],"study_design_scores_gemma":[0.0000487107,0.00031322765,0.0010300168,0.000014679473,0.000032116594,0.00010682604,0.00010784651,0.9864196,0.0020755858,0.007264486,0.0025699316,0.000016985829],"about_ca_topic_score_codex":0.0019143423,"about_ca_topic_score_gemma":0.0019028526,"teacher_disagreement_score":0.0047971564,"about_ca_system_score_codex":0.00044352195,"about_ca_system_score_gemma":0.0009536131,"threshold_uncertainty_score":0.016048074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13877094,0.0018175825,0.80495375,0.0021179214,0.00036251923,0.0005159828,0.0023164044,0.000687414,0.048457462],"genre_scores_gemma":[0.72693825,0.0019504755,0.2441788,0.00035221406,0.00025353354,0.0004881998,0.0019459235,0.0002612537,0.023631355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884903,0.0004447831,0.000052611344,0.00026867006,0.00016990602,0.00021500676],"domain_scores_gemma":[0.99858236,0.0009804599,0.00016182887,0.00008087042,0.00009884046,0.00009578739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011010834,0.0021122582,0.0014108858,0.00088273553,0.0008707651,0.0026734597,0.0022784306,0.0030377673,0.0075775567],"category_scores_gemma":[0.003024397,0.0009033069,0.001499425,0.0025988717,0.0009344011,0.002595359,0.001182629,0.0017662974,0.0006649791],"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.00004464026,0.000057688463,0.00023540923,0.00007524072,0.000029578801,0.000095906275,0.000019752666,0.974113,0.0002356363,0.014424587,0.0015038161,0.009164711],"study_design_scores_gemma":[0.00005800067,0.000068380796,0.00015424774,0.000014397167,0.000025091342,0.00012084839,0.0000681833,0.9739314,0.00034060012,0.020466156,0.0047366633,0.00001606448],"about_ca_topic_score_codex":0.008702466,"about_ca_topic_score_gemma":0.007659526,"teacher_disagreement_score":0.008702466,"about_ca_system_score_codex":0.0018439043,"about_ca_system_score_gemma":0.0021040647,"threshold_uncertainty_score":0.025349498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10317261,0.00036007626,0.86894417,0.0006030654,0.00007574186,0.00021241054,0.00022754015,0.00014095209,0.026263416],"genre_scores_gemma":[0.91083753,0.00059158605,0.074776135,0.00015173365,0.000027650858,0.00018731994,0.00016155813,0.00007804874,0.013188399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.00033838136,0.000014961485,0.00012819204,0.00010914487,0.00013392887],"domain_scores_gemma":[0.99867415,0.00078829756,0.00018239755,0.000034274788,0.00021249586,0.00010837403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012391442,0.00091852085,0.0007482283,0.0007222064,0.0005995787,0.0016861206,0.0010224511,0.0010790521,0.007936815],"category_scores_gemma":[0.0027629805,0.0006108834,0.0007110755,0.0007389981,0.0009583932,0.0017659949,0.0011716662,0.0011810501,0.0005126677],"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.00003915112,0.00002497984,0.0003136228,0.000037750968,0.000011269641,0.000090566245,0.000041675554,0.9692964,0.0009935419,0.024545986,0.0004795503,0.004125528],"study_design_scores_gemma":[0.000009403265,0.00004573248,0.00007859461,0.000005338885,0.000006348668,0.000019684943,0.000054934528,0.99207956,0.00019875685,0.00669959,0.0007961606,0.000005904013],"about_ca_topic_score_codex":0.010186462,"about_ca_topic_score_gemma":0.010587648,"teacher_disagreement_score":0.010186462,"about_ca_system_score_codex":0.002961291,"about_ca_system_score_gemma":0.0014950858,"threshold_uncertainty_score":0.026551247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14869513,0.0006856489,0.84199005,0.0009247706,0.00014603925,0.00022664457,0.0011405869,0.00023565102,0.0059555266],"genre_scores_gemma":[0.85697836,0.00091912586,0.13043179,0.0002010277,0.00012811569,0.0004924829,0.0014324399,0.000118194206,0.00929861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981481,0.0007378311,0.00009776161,0.0004212477,0.00026992898,0.00032511464],"domain_scores_gemma":[0.9977895,0.0013648188,0.00033883916,0.00011121827,0.00017712003,0.0002184491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018673607,0.0015912554,0.00211502,0.0007822276,0.0006645252,0.001928049,0.0024483616,0.002306482,0.0030821462],"category_scores_gemma":[0.003809945,0.0012156687,0.001565095,0.0024090584,0.0014401877,0.001964335,0.0013591833,0.0016411305,0.00033221164],"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.00004389399,0.000034992434,0.0003316879,0.000048892438,0.000033112923,0.00013495682,0.00001936434,0.98328066,0.00036038214,0.012575167,0.00039564312,0.0027412234],"study_design_scores_gemma":[0.000024745257,0.00004755856,0.00014527903,0.0000058661126,0.000012911252,0.000047654583,0.000016819882,0.98947734,0.00022201451,0.00938588,0.0006014279,0.000012511545],"about_ca_topic_score_codex":0.008016581,"about_ca_topic_score_gemma":0.0052391547,"teacher_disagreement_score":0.008016581,"about_ca_system_score_codex":0.0021183768,"about_ca_system_score_gemma":0.0017312354,"threshold_uncertainty_score":0.015939832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8639297,0.00064792525,0.116457224,0.0021446228,0.00018682316,0.00017241151,0.0011565876,0.0006398895,0.014664806],"genre_scores_gemma":[0.9855055,0.000112980226,0.010765474,0.00008334844,0.000016694934,0.000044784054,0.00047446665,0.000033945696,0.0029628286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967027,0.00009700506,0.000009978531,0.00008463547,0.000035601122,0.00010244136],"domain_scores_gemma":[0.99851555,0.0009499008,0.00013858147,0.00009550288,0.00010861691,0.00019192595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000828659,0.0009777639,0.0008398492,0.0004373484,0.0005725924,0.0007603397,0.0015189811,0.0014661254,0.005606239],"category_scores_gemma":[0.0035910797,0.00041047295,0.0005687331,0.0005522207,0.001267938,0.0016485191,0.0008001026,0.0016702597,0.00035212206],"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.000111690664,0.00006273871,0.0009806604,0.000024047922,0.000015093692,0.00009439939,0.000013715769,0.9929041,0.00016823728,0.0017127715,0.0008409258,0.0030716138],"study_design_scores_gemma":[0.000021651495,0.00002447306,0.00027405325,0.000004146412,0.000003794623,0.000010105425,0.00002821666,0.99707794,0.00021027126,0.0019112251,0.00042984917,0.000004351482],"about_ca_topic_score_codex":0.035016164,"about_ca_topic_score_gemma":0.032644436,"teacher_disagreement_score":0.035016164,"about_ca_system_score_codex":0.001802237,"about_ca_system_score_gemma":0.0011218874,"threshold_uncertainty_score":0.06962472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009410804,0.00035121778,0.98636055,0.00012390528,0.00007852866,0.00016391084,0.00016417663,0.0019681505,0.0013787935],"genre_scores_gemma":[0.20930764,0.00034816412,0.78563595,0.00031538517,0.000114117625,0.00054385996,0.0011610816,0.00048267687,0.0020912143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936897,0.0002446275,0.00003133493,0.0001126785,0.00017021103,0.000072219744],"domain_scores_gemma":[0.99779224,0.0013831842,0.00014691903,0.00026175994,0.0003564276,0.000059436225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088478636,0.0014466248,0.0013408088,0.0011370361,0.0005401776,0.0007998846,0.0011464548,0.0007886242,0.0058309315],"category_scores_gemma":[0.0034470542,0.0005340055,0.0010493061,0.0014565963,0.00058306253,0.0009014257,0.0007651668,0.0017985805,0.0014772994],"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.00021890474,0.00026439034,0.001186736,0.0003054228,0.00011878903,0.00016053497,0.00007564009,0.6099419,0.012467605,0.010571439,0.012422318,0.3522663],"study_design_scores_gemma":[0.000030311172,0.00005758784,0.0000942902,0.000009148446,0.000013453105,0.000033023363,0.0000073587266,0.9916545,0.0034472332,0.0030494938,0.0015952435,0.000008289261],"about_ca_topic_score_codex":0.0027046145,"about_ca_topic_score_gemma":0.0044195973,"teacher_disagreement_score":0.0058309315,"about_ca_system_score_codex":0.00059242896,"about_ca_system_score_gemma":0.0015656919,"threshold_uncertainty_score":0.019506454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021677779,0.00021283035,0.9735893,0.00025341279,0.000037109086,0.00010774306,0.00003698631,0.000085329535,0.0039994884],"genre_scores_gemma":[0.7206046,0.00062859163,0.27343622,0.00011291942,0.000049394013,0.00034603875,0.00010390152,0.000097114156,0.0046211006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992042,0.00036795574,0.000035511024,0.00011815298,0.00015009787,0.00012412143],"domain_scores_gemma":[0.9993956,0.00035529025,0.00005843738,0.000039049126,0.000103735416,0.000047805126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012745758,0.0009380906,0.00078027195,0.0005003118,0.00077313103,0.0016756568,0.0011815003,0.001111522,0.0026580011],"category_scores_gemma":[0.0025853147,0.00050045294,0.00055220386,0.0006372001,0.00088785193,0.0017560015,0.0012854628,0.00088050764,0.00029336388],"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.000027014334,0.000021233218,0.00021131516,0.00005143099,0.000010661358,0.00003550751,0.00004698304,0.9746755,0.0012284684,0.013435854,0.00023711695,0.0100189205],"study_design_scores_gemma":[0.0000051311354,0.000021866748,0.000037543676,0.0000048053016,0.0000043351797,0.000010025286,0.00002709423,0.99357563,0.00034755905,0.0052461857,0.00071627373,0.000003557024],"about_ca_topic_score_codex":0.0071409666,"about_ca_topic_score_gemma":0.007859045,"teacher_disagreement_score":0.0071409666,"about_ca_system_score_codex":0.0019292305,"about_ca_system_score_gemma":0.00231433,"threshold_uncertainty_score":0.01419878},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030033797,0.049214523,0.0037994639,0.028249256,0.8696405,0.00007866112,0.00038176333,0.0002301999,0.048105292],"genre_scores_gemma":[0.002105054,0.045047075,0.0016024596,0.02327095,0.7556048,0.00011388787,0.0006642226,0.0003764425,0.17121515],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987871,0.00021868962,0.00016829337,0.00029526974,0.00041407274,0.00011660376],"domain_scores_gemma":[0.9949809,0.0016689947,0.00035677326,0.00026638186,0.0016918681,0.0010351535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018989877,0.0029850618,0.0025262896,0.0037273387,0.001781606,0.004404849,0.0021654717,0.00502379,0.0757647],"category_scores_gemma":[0.004257711,0.00062943244,0.0016434846,0.0024301577,0.0011946908,0.0042002387,0.0025640836,0.0071734986,0.059536606],"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.000013414736,0.000025491874,0.00010867693,0.00014853555,0.000005397672,0.00006347254,0.000017421273,0.00007652914,0.00019534575,0.0028518948,0.9782405,0.01825337],"study_design_scores_gemma":[0.0000029745786,0.00002913121,0.0004118814,0.00014076773,0.000005904704,0.00015435251,0.000026903093,0.00011105281,0.00004213502,0.0021314872,0.99693525,0.000008230944],"about_ca_topic_score_codex":0.0015594602,"about_ca_topic_score_gemma":0.0039949617,"teacher_disagreement_score":0.0757647,"about_ca_system_score_codex":0.0012475377,"about_ca_system_score_gemma":0.002020992,"threshold_uncertainty_score":0.2534582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01116028,0.0005172249,0.9840619,0.00032547815,0.00008248831,0.00008157294,0.0001931486,0.00012735653,0.0034506149],"genre_scores_gemma":[0.7040379,0.0013446879,0.28170034,0.0003003704,0.00024809633,0.00061971194,0.000641522,0.00016045991,0.010946873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984433,0.0007745851,0.000062597814,0.00021287506,0.00023186087,0.00027483792],"domain_scores_gemma":[0.9981567,0.0012989215,0.00020234202,0.00005801942,0.00012692175,0.00015701649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023702618,0.002212365,0.0016409375,0.0006231246,0.00050754636,0.0015708451,0.0014458748,0.0013741526,0.0053082863],"category_scores_gemma":[0.0034299202,0.0011101358,0.0019155863,0.0013073793,0.00086515094,0.0017754481,0.0014430885,0.0026349905,0.00052307174],"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.000051300227,0.000032912994,0.000220211,0.000059262486,0.000024992674,0.00006503121,0.000020576988,0.9726713,0.00036521337,0.020775577,0.000527651,0.0051860404],"study_design_scores_gemma":[0.000008302151,0.000036787405,0.00005715797,0.0000067534907,0.0000059526183,0.000009696872,0.0000055871274,0.99163884,0.00009910146,0.0077386308,0.00038720245,0.0000059811787],"about_ca_topic_score_codex":0.0041691493,"about_ca_topic_score_gemma":0.0044083614,"teacher_disagreement_score":0.0053082863,"about_ca_system_score_codex":0.0013878186,"about_ca_system_score_gemma":0.0020181262,"threshold_uncertainty_score":0.017758012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018619198,0.00086385274,0.97666126,0.0008679825,0.0000858193,0.000052188032,0.00013499959,0.00012956264,0.0025850625],"genre_scores_gemma":[0.65560275,0.0033802646,0.333159,0.0003987588,0.00029823105,0.00029144716,0.00049187994,0.0001973953,0.0061802804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988123,0.0005680267,0.000045965844,0.00026740154,0.00016235127,0.00014395478],"domain_scores_gemma":[0.9978934,0.0015828065,0.00025519886,0.00006486804,0.000106785235,0.000097001044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014599535,0.0012301637,0.0011172104,0.0005151788,0.0005022907,0.0011609917,0.0012011371,0.001534701,0.0025756801],"category_scores_gemma":[0.0035659536,0.0008706179,0.0014212346,0.0014851856,0.00084468664,0.0014710628,0.00096931774,0.0013433261,0.0002517423],"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.000026909289,0.000030257868,0.00040324597,0.00007533702,0.000034587025,0.000073491334,0.0000334116,0.9544542,0.00042829502,0.028988142,0.0010969624,0.01435516],"study_design_scores_gemma":[0.000017768734,0.000036513327,0.00020368198,0.000012542447,0.000015171469,0.000061416096,0.00004835915,0.96307313,0.0003043925,0.034125566,0.0020904117,0.000010987666],"about_ca_topic_score_codex":0.0065806755,"about_ca_topic_score_gemma":0.004908174,"teacher_disagreement_score":0.0065806755,"about_ca_system_score_codex":0.0017021869,"about_ca_system_score_gemma":0.0021970503,"threshold_uncertainty_score":0.013084769},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022781553,0.0002955144,0.96372694,0.0006226244,0.00006343474,0.00010977655,0.00062338903,0.0001660521,0.011610732],"genre_scores_gemma":[0.85814476,0.0008632312,0.11729956,0.00022780405,0.000092010705,0.00054661004,0.00077749137,0.00010430087,0.021944212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888057,0.00046130532,0.000036959173,0.00017122638,0.00022459275,0.00022546382],"domain_scores_gemma":[0.9990144,0.00047125688,0.00019862104,0.00006431318,0.00015025339,0.00010112318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015080114,0.0010961107,0.0012230212,0.00064050924,0.00036852024,0.0016020226,0.0020516864,0.0017832766,0.0061919717],"category_scores_gemma":[0.002252519,0.00079756934,0.0012318082,0.0013772662,0.0006941675,0.0013577421,0.0012875458,0.0017418077,0.0007368592],"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.000017579432,0.000011649785,0.00012412416,0.000014720531,0.000007734297,0.00004155339,0.000009920962,0.98312485,0.00019480818,0.014333726,0.0003630386,0.0017562918],"study_design_scores_gemma":[0.000005848232,0.000010282719,0.0000658223,0.0000030287845,0.0000036255572,0.00001468477,0.0000060487273,0.9964516,0.0000514709,0.0030237874,0.00035950713,0.000004170031],"about_ca_topic_score_codex":0.0073364656,"about_ca_topic_score_gemma":0.0045024776,"teacher_disagreement_score":0.0073364656,"about_ca_system_score_codex":0.0016269053,"about_ca_system_score_gemma":0.0016789977,"threshold_uncertainty_score":0.020714223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011882321,0.00020532357,0.9812397,0.00020802002,0.000030649117,0.00009132787,0.00015962459,0.00011353175,0.006069489],"genre_scores_gemma":[0.43788803,0.0008793057,0.5473255,0.00016534576,0.00013095776,0.00051348814,0.0008360385,0.00021683595,0.012044433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990219,0.00042672938,0.00003223121,0.00016920772,0.00020634872,0.00014347248],"domain_scores_gemma":[0.9993923,0.00038767862,0.00007898652,0.00003241897,0.00006738161,0.000041193955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014497718,0.0017048231,0.001281734,0.0009830265,0.0006670328,0.0015058466,0.0012963272,0.0014323012,0.0061322334],"category_scores_gemma":[0.0023439173,0.0009805794,0.0016835677,0.0015028893,0.00084823876,0.0014754048,0.0010267254,0.002170494,0.0005804686],"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.00002592978,0.000028120536,0.00015190183,0.000036521404,0.000014579521,0.000029931956,0.000019988902,0.97342515,0.0003649096,0.018527053,0.00070907344,0.006666871],"study_design_scores_gemma":[0.0000064856968,0.000010626144,0.000041559655,0.0000047484505,0.000004884794,0.000007886031,0.000008738735,0.9915692,0.00013184878,0.007650905,0.0005596219,0.0000034305685],"about_ca_topic_score_codex":0.00951767,"about_ca_topic_score_gemma":0.010621949,"teacher_disagreement_score":0.00951767,"about_ca_system_score_codex":0.00230527,"about_ca_system_score_gemma":0.0022872232,"threshold_uncertainty_score":0.020514429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008754515,0.0004249459,0.98535615,0.00029360005,0.00010859982,0.00023885684,0.0002174553,0.0008347612,0.0037711277],"genre_scores_gemma":[0.08151469,0.00036518156,0.9131383,0.00017765333,0.00007353817,0.00040464706,0.0008086951,0.00031466284,0.0032025839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898237,0.0002894855,0.000047900976,0.00023992738,0.00027895518,0.00016141363],"domain_scores_gemma":[0.9982351,0.0011827971,0.0001244897,0.00012033745,0.00022044673,0.00011677273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013933989,0.0018222003,0.0021209056,0.0012050844,0.00093679945,0.0018088553,0.0022667442,0.0022327185,0.010535914],"category_scores_gemma":[0.0037216982,0.0010198457,0.0013046066,0.002142822,0.0006065883,0.0023128442,0.0012947725,0.0034584568,0.00163152],"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.0001501632,0.00019816101,0.0003840565,0.00018022317,0.000056128585,0.00008198015,0.000048269496,0.82575256,0.0011568317,0.013872347,0.0058337376,0.15228559],"study_design_scores_gemma":[0.000030965213,0.000028394283,0.00004776933,0.000007923984,0.000007778105,0.000019748495,0.000009923539,0.9930951,0.0002529896,0.0054390286,0.0010548821,0.0000055022365],"about_ca_topic_score_codex":0.010224282,"about_ca_topic_score_gemma":0.008984868,"teacher_disagreement_score":0.010535914,"about_ca_system_score_codex":0.001947516,"about_ca_system_score_gemma":0.0034862643,"threshold_uncertainty_score":0.035246193},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047703748,0.000076008924,0.9986405,0.00003566988,0.000009695389,0.000023045894,0.000025540881,0.000054587745,0.0006579552],"genre_scores_gemma":[0.04641907,0.00075863523,0.95010334,0.00008840374,0.000052439664,0.00033089737,0.00021139513,0.00015220937,0.0018836602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992101,0.0003562115,0.00004061765,0.000108822635,0.00022668454,0.00005751386],"domain_scores_gemma":[0.9990159,0.00053874124,0.00011244775,0.0001241126,0.00015620582,0.000052479507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026134131,0.0017731182,0.0010736382,0.0012497326,0.0005117235,0.0010993639,0.0009701484,0.0009995159,0.004839054],"category_scores_gemma":[0.0031978153,0.00090907677,0.002051539,0.0016536084,0.0009107301,0.0010425578,0.0013719617,0.0021864646,0.0008827493],"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.000028474638,0.000035823025,0.00027632658,0.00014620986,0.000053089567,0.00005045804,0.000059170372,0.852577,0.002795701,0.08662682,0.0016000725,0.055750888],"study_design_scores_gemma":[0.000012423062,0.00003055937,0.000058194888,0.00003191214,0.000009445588,0.000043885764,0.000011247967,0.9391889,0.0008380223,0.05541819,0.004348156,0.000009034265],"about_ca_topic_score_codex":0.0020105804,"about_ca_topic_score_gemma":0.002155139,"teacher_disagreement_score":0.004839054,"about_ca_system_score_codex":0.00083304854,"about_ca_system_score_gemma":0.001831464,"threshold_uncertainty_score":0.016188264},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3988248,0.0004985122,0.59655714,0.00034847777,0.00012634846,0.00004157314,0.0007535713,0.0009151413,0.0019345137],"genre_scores_gemma":[0.9404886,0.00018631475,0.057143994,0.000038878483,0.00003623652,0.000028846884,0.000994154,0.000051780044,0.0010312255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998338,0.000035541805,0.000009245057,0.000050551425,0.000049649472,0.000021021044],"domain_scores_gemma":[0.99960464,0.00015196516,0.00005604877,0.00004326585,0.000120684366,0.000023414883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046898323,0.0005880447,0.0005073879,0.0004583055,0.00018090852,0.00049639755,0.00062489865,0.0004357778,0.0005563911],"category_scores_gemma":[0.0017145346,0.00032405998,0.0005392056,0.0005923135,0.00016256659,0.0007491897,0.0003594999,0.0010021391,0.00021474271],"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.000086705324,0.0000791778,0.010285125,0.000047025067,0.00006609089,0.00008718941,0.00006656608,0.9229666,0.00546797,0.0016452039,0.0017053325,0.057497036],"study_design_scores_gemma":[0.0000010788654,0.0000026581738,0.0007132385,9.945619e-7,0.0000012065458,0.0000023181954,0.0000034190923,0.9988758,0.00016853864,0.0001425419,0.00008609055,0.0000021146377],"about_ca_topic_score_codex":0.01879636,"about_ca_topic_score_gemma":0.01524293,"teacher_disagreement_score":0.01879636,"about_ca_system_score_codex":0.00033462295,"about_ca_system_score_gemma":0.00042130955,"threshold_uncertainty_score":0.0373739},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15584227,0.0011987905,0.8274251,0.0016059851,0.00017533333,0.00016557568,0.00047676676,0.00017849827,0.012931605],"genre_scores_gemma":[0.96550226,0.0006170318,0.022867344,0.00020127762,0.00007327885,0.00020105968,0.00019981166,0.000041636522,0.010296303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867415,0.0006553025,0.000042011292,0.00019966974,0.00019392173,0.00023489787],"domain_scores_gemma":[0.9982734,0.0011627751,0.0002137377,0.000038949293,0.00017260642,0.00013864621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017899812,0.001264434,0.0017304677,0.0011826848,0.00072175637,0.0018553688,0.0021264157,0.0018815077,0.0028900292],"category_scores_gemma":[0.003428276,0.0006435804,0.0015168944,0.0009905876,0.0019765922,0.0019950487,0.0013063188,0.0017558828,0.00023129796],"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.000041724397,0.000045063014,0.00067614217,0.00003131057,0.000035841094,0.00011453443,0.000074446645,0.87217104,0.0004011102,0.123853065,0.0007302973,0.0018254945],"study_design_scores_gemma":[0.000013318631,0.000011699757,0.00012777347,0.0000043075083,0.0000060937195,0.000010079984,0.000017598324,0.98001444,0.00003392062,0.019491302,0.00026093368,0.000008533814],"about_ca_topic_score_codex":0.019253468,"about_ca_topic_score_gemma":0.0097776465,"teacher_disagreement_score":0.019253468,"about_ca_system_score_codex":0.002987325,"about_ca_system_score_gemma":0.0014131333,"threshold_uncertainty_score":0.03828281},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01827887,0.00033082237,0.9777945,0.00024808518,0.000041996213,0.00012052404,0.00035090322,0.00031273815,0.0025215144],"genre_scores_gemma":[0.5488907,0.0009283028,0.44090536,0.00014780102,0.0001256996,0.00057013874,0.0011685597,0.00033188128,0.006931548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816704,0.0006418,0.0000998881,0.0005489452,0.00028430193,0.00025807132],"domain_scores_gemma":[0.9983144,0.0009549234,0.0003323068,0.00012677714,0.00017090507,0.00010074153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022445067,0.00188472,0.0016727861,0.000803291,0.00048397662,0.0015260195,0.0017905324,0.0018198886,0.004157912],"category_scores_gemma":[0.0050680656,0.0009821076,0.0013122489,0.0012428002,0.00074406544,0.0025656216,0.0014170955,0.0018923429,0.00061351014],"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.00009551155,0.00003412478,0.00016016849,0.00009024269,0.000032926106,0.00006773041,0.000033464683,0.968151,0.0011306504,0.011993499,0.00089703716,0.017313672],"study_design_scores_gemma":[0.000022813436,0.00005723801,0.000110765825,0.000009283458,0.000013831139,0.000037679634,0.000018340643,0.98660755,0.00068229844,0.011456694,0.00097332965,0.0000102803015],"about_ca_topic_score_codex":0.0046949508,"about_ca_topic_score_gemma":0.0022906174,"teacher_disagreement_score":0.0046949508,"about_ca_system_score_codex":0.0012699522,"about_ca_system_score_gemma":0.0017858513,"threshold_uncertainty_score":0.013909578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63922304,0.0012841081,0.26450646,0.003002545,0.00018282815,0.00065740664,0.0037420464,0.00044162298,0.08695989],"genre_scores_gemma":[0.94140977,0.00052320864,0.038604084,0.00009990117,0.000035619127,0.00012796199,0.0012586782,0.00005807804,0.017882654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944526,0.00012731647,0.000013949738,0.00013430661,0.000080092126,0.00019911132],"domain_scores_gemma":[0.9996518,0.00016029064,0.00003418107,0.000020285846,0.000056321747,0.00007704836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009403,0.0011098001,0.0009889628,0.00069928117,0.001486764,0.0019479536,0.0016191948,0.0017318446,0.008326387],"category_scores_gemma":[0.0013804566,0.00055859756,0.00083023286,0.002067854,0.000844638,0.0009852119,0.0006675483,0.0010407993,0.00028597316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00007644837,0.00006626322,0.0008357693,0.0000570972,0.000019424064,0.00019403524,0.000049081693,0.9750251,0.00048616395,0.011064993,0.0032585247,0.008867106],"study_design_scores_gemma":[0.00007159324,0.000047157522,0.0013503792,0.000016868064,0.00002572568,0.000060673476,0.0002021977,0.9871487,0.00040981875,0.005849677,0.0047978694,0.000019372907],"about_ca_topic_score_codex":0.56773,"about_ca_topic_score_gemma":0.57136244,"teacher_disagreement_score":0.43227,"about_ca_system_score_codex":0.00787027,"about_ca_system_score_gemma":0.007907415,"threshold_uncertainty_score":0.8696314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044806305,0.0005083045,0.9326169,0.0009860325,0.00010049928,0.0001180468,0.0004505135,0.00018350175,0.020230025],"genre_scores_gemma":[0.91052157,0.00090763654,0.067589946,0.00025428936,0.000103278566,0.00034773443,0.00038441227,0.000078041914,0.019813053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990683,0.0004016484,0.000032037737,0.00015678401,0.00014833156,0.00019299643],"domain_scores_gemma":[0.9987857,0.00074812246,0.00015526559,0.000048144237,0.00015561853,0.000107213535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013087316,0.001028039,0.001206626,0.0009934983,0.0008518671,0.0021101988,0.00243656,0.001914981,0.008000481],"category_scores_gemma":[0.003190857,0.0006942496,0.0011372891,0.0017406067,0.0014193747,0.0021875645,0.0012452613,0.0018210696,0.00079205143],"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.00003317009,0.00003288137,0.00019540188,0.00003863053,0.000014959074,0.0000878927,0.000066716,0.7358385,0.00036909874,0.25973964,0.0009058976,0.0026772204],"study_design_scores_gemma":[0.000009237723,0.000010919924,0.00002683629,0.0000044315093,0.000004062341,0.000014662378,0.000017743374,0.9545148,0.000054109816,0.044606138,0.0007305586,0.0000065451627],"about_ca_topic_score_codex":0.015790096,"about_ca_topic_score_gemma":0.013090613,"teacher_disagreement_score":0.015790096,"about_ca_system_score_codex":0.0030927071,"about_ca_system_score_gemma":0.0024282327,"threshold_uncertainty_score":0.03139639},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029457032,0.000032611995,0.9966252,0.000044449236,0.000009410392,0.000018391842,0.000037013273,0.00013988659,0.00014727857],"genre_scores_gemma":[0.18296638,0.00016171586,0.8137171,0.00014878398,0.000058719153,0.00023066188,0.000738657,0.0001550837,0.0018228107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989349,0.00039404552,0.00006174764,0.0002197209,0.00033966676,0.000049833994],"domain_scores_gemma":[0.9948584,0.0034605744,0.00034409377,0.0005691068,0.00064764294,0.000120286495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002853728,0.0006321706,0.0008359999,0.0010750726,0.00046623521,0.00078441284,0.0019422034,0.00092784414,0.0017819453],"category_scores_gemma":[0.01498748,0.000647892,0.0009246036,0.0009103696,0.0008877635,0.001493746,0.0016702764,0.0019799033,0.00054354477],"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.00019823271,0.00012647509,0.0048251655,0.00019076382,0.0001214484,0.0002097752,0.000290069,0.7472936,0.006501809,0.03349939,0.0016303682,0.2051129],"study_design_scores_gemma":[0.000010210421,0.00001764598,0.0003474496,0.000009829001,0.0000050353856,0.000052126834,0.000015408721,0.99129397,0.0013461162,0.005876471,0.0010095914,0.000016114816],"about_ca_topic_score_codex":0.004932047,"about_ca_topic_score_gemma":0.0050080647,"teacher_disagreement_score":0.004932047,"about_ca_system_score_codex":0.00074889883,"about_ca_system_score_gemma":0.0013235083,"threshold_uncertainty_score":0.015092075},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005655269,0.00020580752,0.9914765,0.00014691478,0.000011186824,0.000051712454,0.000059571885,0.00003104711,0.002362094],"genre_scores_gemma":[0.54876953,0.0015236554,0.4416194,0.0001184578,0.00008750814,0.000730717,0.00031896276,0.000086934524,0.006744832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940264,0.00026210616,0.000026583906,0.00011872522,0.00011273249,0.00007725641],"domain_scores_gemma":[0.999213,0.00048690522,0.00010476214,0.000042571926,0.000093945884,0.000058762766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014072586,0.001102041,0.00080191315,0.0007900056,0.00044909384,0.0013384892,0.0010170266,0.0013435532,0.0034905758],"category_scores_gemma":[0.0018991631,0.0006549103,0.0016408392,0.0008428471,0.0008820649,0.0011478438,0.0011959511,0.001537961,0.00036572004],"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.00001778297,0.000036761317,0.00031626786,0.00009775813,0.000017128485,0.000060094382,0.000072884446,0.95840824,0.0008629445,0.030834194,0.000474045,0.008801795],"study_design_scores_gemma":[0.0000041125368,0.000015736872,0.000067891386,0.000012372964,0.0000072756816,0.000012283294,0.00002150545,0.9913872,0.00013242775,0.0076469984,0.00068818714,0.0000040258296],"about_ca_topic_score_codex":0.0063954736,"about_ca_topic_score_gemma":0.005905871,"teacher_disagreement_score":0.0063954736,"about_ca_system_score_codex":0.0013926997,"about_ca_system_score_gemma":0.0016187716,"threshold_uncertainty_score":0.012716472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26938257,0.0002903576,0.71753675,0.00031976044,0.000057238656,0.0002854131,0.0003764985,0.0002748838,0.011476531],"genre_scores_gemma":[0.8736556,0.00023068783,0.11872824,0.00003675283,0.000025701129,0.00019516108,0.00020922837,0.000047621605,0.0068709245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953127,0.00017822611,0.000011519324,0.00007648513,0.000073262956,0.00012915257],"domain_scores_gemma":[0.9996456,0.00018975347,0.00006444293,0.000023139024,0.000030331785,0.00004663418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064276846,0.00057261396,0.0008021168,0.0006109279,0.0006761183,0.00075402076,0.0013425818,0.0011321742,0.005172661],"category_scores_gemma":[0.0015355787,0.0005783516,0.0006834932,0.0011077878,0.0003993678,0.0007388266,0.00070539315,0.0006808706,0.00057039043],"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.00012781222,0.00010168508,0.0006344391,0.000077584315,0.000017582453,0.000118335,0.00005494059,0.97056836,0.0019815213,0.004878655,0.000661164,0.02077783],"study_design_scores_gemma":[0.00005342995,0.00012263758,0.00064784207,0.000011154236,0.0000124577455,0.00004231093,0.00006255405,0.9899997,0.0010289586,0.0065046395,0.0015023622,0.0000120228],"about_ca_topic_score_codex":0.01404073,"about_ca_topic_score_gemma":0.0118524395,"teacher_disagreement_score":0.01404073,"about_ca_system_score_codex":0.0013957674,"about_ca_system_score_gemma":0.0016500887,"threshold_uncertainty_score":0.02791804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029009284,0.00030947942,0.96461797,0.00022500791,0.00009603615,0.00012225968,0.00013299963,0.0017071993,0.0037796795],"genre_scores_gemma":[0.30567113,0.00017080778,0.68803614,0.00031046316,0.00007521489,0.00029346865,0.00069541216,0.00032889287,0.004418446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995586,0.000090111076,0.000020938958,0.00011297095,0.0001171937,0.00010000256],"domain_scores_gemma":[0.9990539,0.00053697155,0.00009313785,0.00010060744,0.00015715492,0.000058184876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076420204,0.00096794084,0.0012756797,0.0008147427,0.00059755886,0.0007069835,0.0016172857,0.0010207653,0.005515467],"category_scores_gemma":[0.0020827923,0.0005442052,0.0006920017,0.0010778229,0.000599385,0.001259297,0.0009856429,0.0014788511,0.0009466615],"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.000106831205,0.00012321176,0.00068505935,0.00006870775,0.000024549885,0.00007837457,0.000048792324,0.7770655,0.0019724339,0.007481476,0.005028368,0.20731667],"study_design_scores_gemma":[0.000012381831,0.000015278616,0.000037013117,0.0000027757535,0.0000029857692,0.000010337182,0.0000036448648,0.9976718,0.0003500681,0.0015112805,0.0003796302,0.0000027211493],"about_ca_topic_score_codex":0.007826508,"about_ca_topic_score_gemma":0.008290673,"teacher_disagreement_score":0.007826508,"about_ca_system_score_codex":0.0009935333,"about_ca_system_score_gemma":0.0021560828,"threshold_uncertainty_score":0.018451035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13101551,0.000719114,0.8537216,0.0009387046,0.00015089521,0.00035386242,0.0015120989,0.0006393618,0.010948868],"genre_scores_gemma":[0.66269183,0.00090541434,0.3226311,0.00020268852,0.00011224813,0.00051581743,0.0016876854,0.00035918097,0.010894014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991968,0.00025004812,0.00003073775,0.00020260813,0.0001322301,0.00018759287],"domain_scores_gemma":[0.9979735,0.00139799,0.0002584757,0.00010412572,0.00011299507,0.00015278872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010371573,0.001520567,0.001144499,0.0006869815,0.0006686986,0.0014103121,0.001854651,0.0017333076,0.007352766],"category_scores_gemma":[0.0032809956,0.0007591889,0.0010470724,0.0014426832,0.00085303513,0.0023812347,0.001057295,0.0015845341,0.00055673247],"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.00008459324,0.000038915052,0.00027251666,0.0000825866,0.000027320015,0.000120282835,0.000031837237,0.96979517,0.0009084531,0.015662726,0.0013687633,0.011606882],"study_design_scores_gemma":[0.000033827622,0.000057167825,0.0001549778,0.00001101021,0.000015304806,0.00006565603,0.000036830574,0.9807411,0.00067392807,0.016205113,0.0019942743,0.000010838531],"about_ca_topic_score_codex":0.008015473,"about_ca_topic_score_gemma":0.007092418,"teacher_disagreement_score":0.008015473,"about_ca_system_score_codex":0.0013111032,"about_ca_system_score_gemma":0.0017787055,"threshold_uncertainty_score":0.024597466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04863736,0.0020244557,0.9344935,0.0009737485,0.00016181465,0.00026919323,0.00026304642,0.0004884015,0.012688606],"genre_scores_gemma":[0.4368705,0.0019818372,0.5516025,0.00028824396,0.00014731001,0.0007468235,0.00050276995,0.00031049334,0.007549627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993587,0.00023619075,0.000028973198,0.00013550493,0.00018034366,0.00006031224],"domain_scores_gemma":[0.9981779,0.0012998085,0.00018138606,0.00009455307,0.00016250844,0.00008390962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010652005,0.00072824926,0.0009900725,0.000693204,0.00065393647,0.0010166605,0.0013416716,0.00094246643,0.004205885],"category_scores_gemma":[0.004824208,0.00042916817,0.000989781,0.00083466986,0.0006256137,0.0015251427,0.0012502909,0.0017271874,0.0006005687],"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.00022017748,0.00019139258,0.0010629237,0.00035351384,0.000040409355,0.00021139174,0.00011793425,0.8184664,0.0021879137,0.087441474,0.007932125,0.08177435],"study_design_scores_gemma":[0.000035128094,0.00008635146,0.0001923225,0.000034933928,0.000020801119,0.00010076358,0.000037015012,0.96100533,0.0008070506,0.031643666,0.006022133,0.00001441228],"about_ca_topic_score_codex":0.0023021619,"about_ca_topic_score_gemma":0.0022092222,"teacher_disagreement_score":0.004205885,"about_ca_system_score_codex":0.0011291148,"about_ca_system_score_gemma":0.0014906306,"threshold_uncertainty_score":0.014070094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018214803,0.00009280396,0.97819394,0.00010108246,0.000018701765,0.00005213283,0.00003937948,0.00053259684,0.0027544557],"genre_scores_gemma":[0.6560076,0.00019430002,0.34050617,0.00008722263,0.000028203824,0.0003234952,0.0002699982,0.00027038524,0.0023125908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966514,0.00014451062,0.00001134074,0.00003914214,0.00009769333,0.000042228483],"domain_scores_gemma":[0.9992342,0.0004585579,0.00007125733,0.00008956068,0.000107128064,0.000039357594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007323749,0.0008377215,0.0009926396,0.0005763606,0.0004906464,0.0006558935,0.0010725663,0.0008887266,0.0020797916],"category_scores_gemma":[0.002132905,0.0006039004,0.0008260927,0.0005102404,0.0006275471,0.0007618258,0.0010584797,0.0011335382,0.00030353543],"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.000008524127,0.000008733397,0.0000927299,0.000008665203,0.0000062485055,0.0000064702726,0.000006888095,0.99545324,0.00035508108,0.0014018558,0.000084774925,0.0025667315],"study_design_scores_gemma":[0.0000018789376,0.0000020874763,0.000012110752,8.84588e-7,6.366298e-7,0.0000010990518,0.000001491619,0.99932027,0.00007625502,0.0004954391,0.000087108485,6.368739e-7],"about_ca_topic_score_codex":0.0069386316,"about_ca_topic_score_gemma":0.0056581805,"teacher_disagreement_score":0.0069386316,"about_ca_system_score_codex":0.0009793274,"about_ca_system_score_gemma":0.0012960952,"threshold_uncertainty_score":0.013796508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006184309,0.0002585603,0.9898061,0.00020543062,0.00002880906,0.00003573037,0.00015948193,0.00014256523,0.003179019],"genre_scores_gemma":[0.85856813,0.0014480144,0.12781385,0.0002102879,0.0001442671,0.0004186791,0.00077677116,0.00024463527,0.010375322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806815,0.00078612985,0.000077807475,0.00032740962,0.00044915886,0.00029141977],"domain_scores_gemma":[0.99744993,0.0015452922,0.00047298727,0.000117325384,0.00030107592,0.00011331099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022989584,0.002088823,0.0020215125,0.0010355316,0.0004842777,0.0020435543,0.0020901442,0.0017702795,0.0038806258],"category_scores_gemma":[0.005312147,0.0011283713,0.0019042795,0.0014769222,0.0012363819,0.0016456853,0.001488303,0.0023720271,0.0005132302],"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.000009073864,0.0000070510273,0.000051878265,0.000018734867,0.000009769125,0.000020876607,0.000009142154,0.9836105,0.00012076134,0.014771515,0.00019841526,0.0011723991],"study_design_scores_gemma":[0.0000021964645,0.0000055616274,0.000015945161,0.0000028286988,0.0000024363615,0.000003848406,0.0000035843595,0.993576,0.00004793954,0.006163231,0.00017383238,0.000002567479],"about_ca_topic_score_codex":0.006734628,"about_ca_topic_score_gemma":0.0049340553,"teacher_disagreement_score":0.006734628,"about_ca_system_score_codex":0.002300141,"about_ca_system_score_gemma":0.0018704667,"threshold_uncertainty_score":0.016688764},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10443209,0.0010929983,0.8826139,0.0012621831,0.00007706572,0.00018308614,0.0011814433,0.0002773571,0.008879928],"genre_scores_gemma":[0.87487733,0.0013342289,0.11602432,0.0001805128,0.00012172441,0.00041894542,0.0010522763,0.00012304868,0.0058676684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972447,0.0016280237,0.00010393146,0.00035803768,0.000320757,0.00034460545],"domain_scores_gemma":[0.99538463,0.0034397072,0.00052087853,0.0001834074,0.00023727845,0.00023395965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00256124,0.0010039901,0.0023527415,0.00094451505,0.00088205317,0.0021726359,0.0021351124,0.002144867,0.003981606],"category_scores_gemma":[0.0075167757,0.0013209846,0.0011877867,0.0025648873,0.0013726352,0.0026269935,0.0016598499,0.0011742549,0.00038056783],"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.00008131048,0.000020672303,0.00052959943,0.00009886538,0.000054030268,0.0001650596,0.000073882395,0.9694309,0.00036462487,0.022735048,0.0011191596,0.005326906],"study_design_scores_gemma":[0.000024345778,0.00003649833,0.00029054214,0.000015875463,0.000018046441,0.00011432896,0.000051065574,0.96891505,0.00022548578,0.029001305,0.001291656,0.000015792697],"about_ca_topic_score_codex":0.0043309466,"about_ca_topic_score_gemma":0.003309573,"teacher_disagreement_score":0.0043309466,"about_ca_system_score_codex":0.0021136547,"about_ca_system_score_gemma":0.0009538907,"threshold_uncertainty_score":0.015335739},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09798361,0.0005541314,0.8941694,0.00050500646,0.0001157875,0.000109681445,0.0005591114,0.00036506203,0.0056383014],"genre_scores_gemma":[0.9440556,0.0004368812,0.04635884,0.000100432284,0.000062914405,0.00011954904,0.00042055987,0.00008213806,0.00836309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990013,0.00028344724,0.000030525807,0.00021242564,0.00017173443,0.00030065892],"domain_scores_gemma":[0.99907136,0.0004020846,0.00020319238,0.00005842098,0.00011213679,0.00015274357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013309853,0.0015952907,0.0016640637,0.00071399263,0.00068967865,0.0016973151,0.0021510036,0.0014032237,0.0031420398],"category_scores_gemma":[0.001779543,0.001406067,0.0015468223,0.0010670053,0.0009924939,0.001325704,0.0013904632,0.0012731774,0.00040806938],"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.000020893533,0.000010072742,0.00017600086,0.000010397938,0.00000838045,0.000041583462,0.000008003968,0.9961287,0.00016077259,0.0022253557,0.00016352833,0.0010463971],"study_design_scores_gemma":[0.000005262033,0.000017973056,0.00009652812,0.0000025292336,0.0000053726326,0.000012113813,0.0000102880285,0.9982487,0.00009778834,0.001293389,0.0002055035,0.000004548875],"about_ca_topic_score_codex":0.024806825,"about_ca_topic_score_gemma":0.016259748,"teacher_disagreement_score":0.024806825,"about_ca_system_score_codex":0.0024277742,"about_ca_system_score_gemma":0.0021115558,"threshold_uncertainty_score":0.04932487},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006119549,0.0006241181,0.98105156,0.0007422755,0.00006923365,0.000038477887,0.00033584144,0.000049930466,0.01096908],"genre_scores_gemma":[0.7399938,0.0026726637,0.2126384,0.00040197605,0.00033209505,0.0005286376,0.0009336344,0.00012585508,0.04237287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996008,0.000142208,0.000017589096,0.000096846554,0.00009723589,0.00004528293],"domain_scores_gemma":[0.99945027,0.00031584484,0.00006992393,0.000038148457,0.000085422944,0.00004039676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007512337,0.0006871651,0.00063142844,0.000506263,0.00036213442,0.0012450988,0.0016090951,0.0012449659,0.0070439535],"category_scores_gemma":[0.0021628386,0.00048390438,0.00094840303,0.0008084648,0.00057955453,0.0014103827,0.0010429398,0.0013833428,0.0005828128],"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.000010602516,0.000026764304,0.00042268645,0.00005359325,0.000022288852,0.000093649505,0.00006237271,0.67734665,0.00045309076,0.31128925,0.0016449133,0.0085740825],"study_design_scores_gemma":[0.000003725799,0.000011022241,0.00009014827,0.000009006358,0.0000063118673,0.000019799396,0.00001465191,0.94451714,0.00007328618,0.051634844,0.0036136303,0.0000064039073],"about_ca_topic_score_codex":0.01041827,"about_ca_topic_score_gemma":0.006835324,"teacher_disagreement_score":0.01041827,"about_ca_system_score_codex":0.0011322988,"about_ca_system_score_gemma":0.0011928617,"threshold_uncertainty_score":0.023564398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2753992,0.00071923574,0.71375436,0.00066473236,0.00015365762,0.00025551187,0.0009523878,0.00059066026,0.0075102947],"genre_scores_gemma":[0.9374904,0.00033055595,0.054364216,0.000087850945,0.00006101581,0.00017411418,0.00039733993,0.000086971166,0.007007517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986935,0.00041999007,0.000055240253,0.0002746023,0.00018941244,0.00036721115],"domain_scores_gemma":[0.99798167,0.001151573,0.00035620338,0.000107278844,0.00016241685,0.00024086186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015106171,0.0014328401,0.001848228,0.0008420227,0.0008474139,0.0019944042,0.0017929033,0.0016427853,0.0035505753],"category_scores_gemma":[0.0029848532,0.0014896181,0.0013452517,0.0014478893,0.0012324026,0.001588749,0.001263611,0.0012047534,0.00039331525],"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.0000348828,0.000009706281,0.00013394139,0.000010176685,0.000010038766,0.000035651356,0.000009061505,0.9961468,0.00014889381,0.0024179853,0.00013197036,0.000910801],"study_design_scores_gemma":[0.000009149591,0.000013899919,0.00005428862,0.0000014912927,0.0000037248112,0.000009017315,0.000008483152,0.99720937,0.000079419726,0.0024585447,0.0001488119,0.0000038507465],"about_ca_topic_score_codex":0.012726817,"about_ca_topic_score_gemma":0.009041779,"teacher_disagreement_score":0.012726817,"about_ca_system_score_codex":0.0023103498,"about_ca_system_score_gemma":0.0016453454,"threshold_uncertainty_score":0.02530545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014802605,0.00057694473,0.9744342,0.00041047196,0.00013779358,0.00037927026,0.00029360916,0.00078271877,0.008182224],"genre_scores_gemma":[0.121270925,0.00059927726,0.87200046,0.00019580567,0.00009652163,0.00071188476,0.001051288,0.00027177585,0.0038021158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921155,0.0002152773,0.000035991954,0.00018125019,0.00022366304,0.00013227681],"domain_scores_gemma":[0.9988788,0.0006921759,0.000091870446,0.00009263666,0.00016583079,0.00007864926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010635396,0.0015505922,0.0019415552,0.0013773226,0.0010979223,0.0016215066,0.0015856405,0.0020255926,0.00792685],"category_scores_gemma":[0.0032783898,0.0008090945,0.0010878169,0.0029017269,0.0005686317,0.0017245321,0.0012629649,0.0028124228,0.0011154982],"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.00013885608,0.00032380086,0.00053779286,0.00025193213,0.000059769744,0.00012550992,0.00007387796,0.71857625,0.001791249,0.020612393,0.011631746,0.24587686],"study_design_scores_gemma":[0.000047809313,0.000061706916,0.00009747939,0.000011812167,0.000011603025,0.00005048129,0.000019402081,0.98990786,0.00043540946,0.0076141655,0.0017327992,0.000009398136],"about_ca_topic_score_codex":0.007493631,"about_ca_topic_score_gemma":0.006625161,"teacher_disagreement_score":0.00792685,"about_ca_system_score_codex":0.0014561747,"about_ca_system_score_gemma":0.0038271481,"threshold_uncertainty_score":0.026517987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94307894,0.00029843344,0.0493678,0.0011628073,0.000043312688,0.00007212928,0.00025898323,0.0003831532,0.005334517],"genre_scores_gemma":[0.9962792,0.000052615644,0.0032608446,0.000051752417,0.0000098029495,0.000007767116,0.000043728654,0.000009111066,0.000285176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869186,0.00047317776,0.00004779516,0.00020427589,0.0003039612,0.00027900282],"domain_scores_gemma":[0.9885233,0.006541991,0.0023983116,0.0012442111,0.00074704253,0.0005451862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032244774,0.00054206303,0.00060653366,0.00045043966,0.00057707797,0.0015462008,0.0012822206,0.0007084504,0.0017127915],"category_scores_gemma":[0.014897292,0.0003361412,0.00027848568,0.000925982,0.00084245246,0.0035740766,0.0010756211,0.000974533,0.0002052784],"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.0017252703,0.0012553316,0.058597162,0.00024880844,0.00019127439,0.00066084135,0.0007547336,0.734261,0.009024029,0.011444316,0.0035974993,0.17823976],"study_design_scores_gemma":[0.00011870444,0.00093103794,0.019802386,0.00003784532,0.00013529375,0.00012322009,0.0008610504,0.9625319,0.0045719403,0.009028914,0.0017763664,0.00008142751],"about_ca_topic_score_codex":0.021736827,"about_ca_topic_score_gemma":0.024568131,"teacher_disagreement_score":0.021736827,"about_ca_system_score_codex":0.0017641457,"about_ca_system_score_gemma":0.0025371257,"threshold_uncertainty_score":0.04322064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24764892,0.00039128718,0.7423143,0.0006575783,0.00008640452,0.000094924864,0.0005096411,0.00043672518,0.007860218],"genre_scores_gemma":[0.9298592,0.00018963986,0.06699079,0.000075497286,0.00003489746,0.000073612086,0.00032562818,0.000090278656,0.0023603998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991037,0.0003263421,0.000028958735,0.00013897131,0.00017865656,0.0002233665],"domain_scores_gemma":[0.9986216,0.00080802024,0.00017785975,0.000115507406,0.00014883516,0.00012819398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012771101,0.00088455115,0.0011281617,0.00050931325,0.00041781674,0.0011255082,0.0010431261,0.0008229449,0.0024450123],"category_scores_gemma":[0.003595809,0.00061739184,0.0009974687,0.0009077443,0.00086155924,0.001258501,0.00089157687,0.0012878451,0.00022015144],"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.000027978705,0.000012848123,0.00018351815,0.000010862668,0.000008622186,0.000024991703,0.000008689347,0.9931184,0.00021880722,0.0041679586,0.00018971002,0.0020276872],"study_design_scores_gemma":[0.000004324601,0.000012354409,0.000050084484,0.0000012127423,0.0000020187722,0.000005420816,0.000005578907,0.99576133,0.000121822995,0.0039072367,0.00012616937,0.0000023189814],"about_ca_topic_score_codex":0.00885634,"about_ca_topic_score_gemma":0.006425341,"teacher_disagreement_score":0.00885634,"about_ca_system_score_codex":0.0012247914,"about_ca_system_score_gemma":0.0012703944,"threshold_uncertainty_score":0.017609537},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062797527,0.052966747,0.0020100381,0.025982074,0.7601492,0.00013488048,0.0011379982,0.0002862454,0.15670486],"genre_scores_gemma":[0.0066422774,0.064993486,0.0013498582,0.011399716,0.5486728,0.00018681995,0.0027304136,0.00064884615,0.36337575],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869555,0.0001265764,0.00009571451,0.00020530942,0.0007086921,0.0001681634],"domain_scores_gemma":[0.99711204,0.0005267585,0.00023985714,0.00024472017,0.0014780037,0.00039859052],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012870934,0.0026144611,0.0023604152,0.0057683247,0.0017295866,0.0055779493,0.0018260176,0.0034003109,0.08081523],"category_scores_gemma":[0.0030107913,0.0005255207,0.0015436794,0.005344333,0.0014517108,0.003287836,0.001673605,0.0032480068,0.042333115],"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.000019038018,0.000015642696,0.00007349557,0.00021991269,0.00000745241,0.000020814748,0.0000074173618,0.00007092795,0.00024467564,0.0015811343,0.9846161,0.013123487],"study_design_scores_gemma":[0.000004977255,0.00003845308,0.0011495219,0.00021691386,0.000015430458,0.0000886896,0.000028175593,0.00019397434,0.00027005665,0.0018401588,0.9961434,0.000010372658],"about_ca_topic_score_codex":0.004989049,"about_ca_topic_score_gemma":0.011614647,"teacher_disagreement_score":0.91918474,"about_ca_system_score_codex":0.0028506373,"about_ca_system_score_gemma":0.0032351622,"threshold_uncertainty_score":0.27035385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01044683,0.00093144074,0.98565763,0.000551792,0.000039742663,0.000071105496,0.00006468983,0.00017393632,0.0020626946],"genre_scores_gemma":[0.39784777,0.0026118052,0.58883893,0.0004171956,0.00019549947,0.0009716698,0.0004987448,0.00040188132,0.008216526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968911,0.0020667478,0.000111637324,0.00037764944,0.00036259013,0.0001903802],"domain_scores_gemma":[0.94757396,0.047260933,0.0015466092,0.0010869692,0.0020097948,0.0005217452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010082407,0.0014728766,0.0022773782,0.0016370822,0.0010546182,0.0021352374,0.0032832357,0.0026573604,0.0044675525],"category_scores_gemma":[0.046321865,0.0010559069,0.0018614331,0.001711393,0.0031229327,0.004033018,0.0032662335,0.0044465344,0.0008229853],"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.00010852716,0.00014436647,0.0026321507,0.0001872104,0.0000964298,0.0001065682,0.00032461385,0.6509603,0.00041137164,0.29749846,0.0022612305,0.045268767],"study_design_scores_gemma":[0.000009256164,0.000013513481,0.000073654875,0.00001996723,0.0000074822856,0.000016933916,0.000016401493,0.935357,0.00010526362,0.06392738,0.00044208902,0.000011059631],"about_ca_topic_score_codex":0.011024633,"about_ca_topic_score_gemma":0.0077283457,"teacher_disagreement_score":0.011024633,"about_ca_system_score_codex":0.0026847431,"about_ca_system_score_gemma":0.0029426978,"threshold_uncertainty_score":0.05332154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061101466,0.00036937915,0.9270434,0.0005775699,0.000060482318,0.00011536908,0.0006681557,0.00025966536,0.009804539],"genre_scores_gemma":[0.8726149,0.00032624975,0.114623144,0.00018201288,0.00006540733,0.00022029674,0.00062191056,0.00011962589,0.011226383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850696,0.0005486777,0.00004836436,0.00032206875,0.00021684253,0.00035700863],"domain_scores_gemma":[0.99742424,0.0015840408,0.00030658842,0.0001959856,0.0002357938,0.00025348857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012354966,0.0015774402,0.0018422025,0.0008223617,0.0006074136,0.0036499107,0.003169499,0.002211685,0.0072558974],"category_scores_gemma":[0.004027058,0.0009948997,0.0012843405,0.0022049127,0.0014520226,0.0023819902,0.0018561798,0.0022556002,0.0007848974],"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.00005868501,0.000051781142,0.00041490822,0.00006511754,0.0000187383,0.00010010075,0.000023475986,0.9751262,0.00036545697,0.019538013,0.0006238774,0.0036136108],"study_design_scores_gemma":[0.000012087886,0.00001638668,0.000085605294,0.000004126832,0.0000035840458,0.000021670496,0.000013468048,0.9941923,0.00016056783,0.0050624944,0.00042138557,0.0000064209667],"about_ca_topic_score_codex":0.007606035,"about_ca_topic_score_gemma":0.0055545904,"teacher_disagreement_score":0.007606035,"about_ca_system_score_codex":0.0036785945,"about_ca_system_score_gemma":0.001450809,"threshold_uncertainty_score":0.026690185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5993973,0.0029791929,0.26777002,0.00943143,0.0012058507,0.0005298929,0.0059226486,0.0025951138,0.1101685],"genre_scores_gemma":[0.7694151,0.0011644001,0.20071214,0.0003887042,0.00017661903,0.00025018476,0.0037903006,0.00045843175,0.023644052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951744,0.00017335734,0.000015518228,0.00013092702,0.00008713123,0.0000756722],"domain_scores_gemma":[0.99916494,0.00052662706,0.000040384224,0.0000878938,0.0000846131,0.00009556536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011679122,0.00072874426,0.00068013417,0.00065923814,0.0007930845,0.0013210236,0.0013575442,0.0011833102,0.011448235],"category_scores_gemma":[0.003148729,0.00031377794,0.0007363721,0.0010916882,0.0005469773,0.0012376587,0.00082475325,0.0014537015,0.0009238964],"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.00021768858,0.0002029251,0.0020357145,0.00017891997,0.000053010237,0.00038265594,0.000071723116,0.89712167,0.00088313327,0.028479042,0.028866515,0.041507035],"study_design_scores_gemma":[0.000099865436,0.00009951178,0.001182237,0.00003697101,0.000014260392,0.00013463775,0.00012214258,0.9658333,0.0016370857,0.014971669,0.01584227,0.000025962043],"about_ca_topic_score_codex":0.027527405,"about_ca_topic_score_gemma":0.031912986,"teacher_disagreement_score":0.027527405,"about_ca_system_score_codex":0.001972073,"about_ca_system_score_gemma":0.0019038245,"threshold_uncertainty_score":0.05473435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005892464,0.0005661361,0.98812056,0.00029812285,0.000058437316,0.000049596616,0.00013551678,0.00057549635,0.0043037557],"genre_scores_gemma":[0.32504758,0.0005513263,0.6608996,0.00046100502,0.00010227234,0.00063484296,0.000863581,0.0005812968,0.010858598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992453,0.0003263242,0.000029738761,0.00014849385,0.0001710305,0.0000791373],"domain_scores_gemma":[0.9973628,0.0019278232,0.00015673786,0.00014878897,0.00030103844,0.00010280571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013273648,0.00087705115,0.0015010737,0.0010442656,0.0006416209,0.0009812013,0.0019442469,0.0016635703,0.0073406408],"category_scores_gemma":[0.006418751,0.00067054824,0.0007469001,0.0014164688,0.00092988677,0.0013664138,0.0015168859,0.0017764745,0.001515655],"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.000037668236,0.000026509333,0.00020029512,0.000080896294,0.00002539228,0.00004531375,0.000031975353,0.96731055,0.00030665804,0.011279739,0.003312141,0.017342864],"study_design_scores_gemma":[0.000008000516,0.0000066281013,0.0000236144,0.000006278377,0.000002506356,0.0000071813747,0.0000052021087,0.99383956,0.00007014252,0.0054622423,0.0005654806,0.0000032250612],"about_ca_topic_score_codex":0.005580576,"about_ca_topic_score_gemma":0.006613867,"teacher_disagreement_score":0.0073406408,"about_ca_system_score_codex":0.0011845079,"about_ca_system_score_gemma":0.001332621,"threshold_uncertainty_score":0.024556875},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000124867,0.013268214,0.00022523911,0.21721502,0.76542103,0.000013126101,0.0003617341,0.000057760193,0.0033129752],"genre_scores_gemma":[0.007812759,0.0139474,0.0004734621,0.13984317,0.6811899,0.000084801315,0.00052101945,0.00019613428,0.15593135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977241,0.0004695731,0.00024741708,0.0006156394,0.00072847126,0.00021479659],"domain_scores_gemma":[0.99193585,0.0021203563,0.00070504757,0.000323583,0.0037520668,0.0011632608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033725328,0.0019156374,0.0018999784,0.0016503265,0.0032593403,0.005224131,0.0016446868,0.0060552945,0.025376953],"category_scores_gemma":[0.02642941,0.00043589724,0.0010343076,0.00096740475,0.0021158564,0.0035025948,0.0037332666,0.010526429,0.017182902],"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.00003159082,0.0000035395444,0.00006284808,0.00003537876,0.000005925988,0.000051055038,0.00003099392,0.000028210923,0.000029099108,0.000618962,0.9957426,0.003359899],"study_design_scores_gemma":[0.0000106734515,0.000008138974,0.00027261372,0.00010187841,0.000009541925,0.0000818513,0.00007498808,0.00006475477,0.000072891686,0.0008713391,0.9984211,0.000010380405],"about_ca_topic_score_codex":0.008659044,"about_ca_topic_score_gemma":0.010849267,"teacher_disagreement_score":0.025376953,"about_ca_system_score_codex":0.0048326286,"about_ca_system_score_gemma":0.0029997304,"threshold_uncertainty_score":0.08489436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053750023,0.000319176,0.9372464,0.00042514494,0.00007654017,0.00018676733,0.00067888066,0.0010024655,0.0063145985],"genre_scores_gemma":[0.5493032,0.0003113976,0.44215667,0.00018689925,0.00005615866,0.00024980228,0.0016133025,0.00029195435,0.005830574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997422,0.00007921963,0.00000902523,0.000056351397,0.000051368064,0.00006174959],"domain_scores_gemma":[0.99934906,0.0003323823,0.00008135216,0.000085192776,0.000083829524,0.00006814395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052756415,0.000870183,0.00076816115,0.00054043304,0.00047190522,0.00090297137,0.0012120728,0.00065973843,0.0045565725],"category_scores_gemma":[0.001198359,0.00051087915,0.00066887034,0.001016548,0.0004268389,0.00093849725,0.0009300621,0.001020421,0.0006361658],"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.00006239719,0.000047445563,0.00030195058,0.000041690942,0.000017429495,0.000052420975,0.00003263048,0.9532493,0.0012915651,0.005398047,0.0026144881,0.036890637],"study_design_scores_gemma":[0.0000098875435,0.000014675171,0.000048333597,0.0000028497207,0.0000027221104,0.000008362761,0.00001195696,0.99503714,0.00028609563,0.0039859917,0.0005891223,0.0000028297832],"about_ca_topic_score_codex":0.009145241,"about_ca_topic_score_gemma":0.012479799,"teacher_disagreement_score":0.009145241,"about_ca_system_score_codex":0.0010000793,"about_ca_system_score_gemma":0.0012916027,"threshold_uncertainty_score":0.018184006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23300748,0.00032623793,0.7575172,0.00030026212,0.000058294052,0.0001232361,0.00025026628,0.00033819137,0.008078722],"genre_scores_gemma":[0.9616099,0.000117851705,0.035781994,0.000022464736,0.000013508974,0.000035621764,0.0001257445,0.000042184856,0.0022507207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995443,0.00012444427,0.000016893902,0.00009835803,0.00009768739,0.0001182631],"domain_scores_gemma":[0.9993592,0.0003332331,0.0001323885,0.00003448814,0.00008914766,0.000051653093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009329092,0.000794969,0.0009878883,0.00070041703,0.00041291106,0.0013813785,0.0009474118,0.0006694507,0.0023052501],"category_scores_gemma":[0.0024208538,0.0007532143,0.00063602935,0.0009834943,0.0007232467,0.0010745242,0.00064766983,0.0006709446,0.00018579107],"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.000021129717,0.00000661717,0.00023770593,0.000010667839,0.0000059287313,0.000015044811,0.000009859686,0.9947226,0.0003369028,0.001111305,0.000082606595,0.0034396066],"study_design_scores_gemma":[0.00000577069,0.000014857329,0.00011109573,0.0000019944682,0.00000371916,0.000005917744,0.000014475644,0.99786854,0.00021038843,0.0016213716,0.00013893154,0.0000028282843],"about_ca_topic_score_codex":0.010576635,"about_ca_topic_score_gemma":0.009018911,"teacher_disagreement_score":0.010576635,"about_ca_system_score_codex":0.0015000292,"about_ca_system_score_gemma":0.0016084098,"threshold_uncertainty_score":0.021030128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055007912,0.00059185206,0.9226395,0.0012572755,0.0001611518,0.0003923171,0.0017049883,0.0003403495,0.01790456],"genre_scores_gemma":[0.7425953,0.0008483328,0.23882794,0.0003091327,0.0001521357,0.0005275675,0.0015628292,0.0002551986,0.014921355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984036,0.00066417333,0.000049186343,0.00037031737,0.00021527396,0.000297448],"domain_scores_gemma":[0.9981135,0.0011277008,0.00017763299,0.00011505834,0.0002443903,0.00022165895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019477385,0.0015500496,0.001593834,0.0009266315,0.0008962214,0.0019437021,0.0017187619,0.001974259,0.009239362],"category_scores_gemma":[0.0030968192,0.0008548187,0.0011216518,0.0015714855,0.00090264186,0.0019405215,0.0012888083,0.0018583075,0.0005360219],"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.0001254121,0.00008678796,0.0008238787,0.0002036121,0.00005922823,0.00027498737,0.000061907434,0.92221236,0.0012712675,0.049644616,0.0055152737,0.019720653],"study_design_scores_gemma":[0.000038058184,0.000056898294,0.00028885034,0.000019407064,0.00002721211,0.000093219576,0.00007157952,0.9623816,0.0006904417,0.033154503,0.003160076,0.000018124409],"about_ca_topic_score_codex":0.007467263,"about_ca_topic_score_gemma":0.008569376,"teacher_disagreement_score":0.009239362,"about_ca_system_score_codex":0.002254729,"about_ca_system_score_gemma":0.002792768,"threshold_uncertainty_score":0.030908763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0769609,0.0010806586,0.9117255,0.0004972345,0.00011363693,0.00020464307,0.00020283298,0.0007812495,0.00843332],"genre_scores_gemma":[0.596753,0.00043312903,0.3954208,0.00037656442,0.00007344638,0.00061447604,0.0005015566,0.00022164723,0.00560536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949825,0.0001985017,0.000022506074,0.000087917164,0.00010421898,0.00008854184],"domain_scores_gemma":[0.99878997,0.00084623584,0.00013190765,0.000034335102,0.00010921647,0.00008839559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010772753,0.0010731207,0.0014022165,0.00097407255,0.00041025013,0.00087955553,0.0018057361,0.0015483726,0.002459944],"category_scores_gemma":[0.0020591884,0.00054667733,0.0010341017,0.0010413374,0.000662335,0.00068184984,0.00083851145,0.0013303801,0.00033291327],"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.00004945,0.00006425626,0.00023409873,0.00004842635,0.000032983204,0.000048972845,0.00002880841,0.98399746,0.00039339776,0.0030028587,0.0006357767,0.011463441],"study_design_scores_gemma":[0.000017006561,0.000033699725,0.00003371509,0.0000058028418,0.0000066976168,0.0000065012673,0.000007053358,0.99865866,0.000082938364,0.0009122694,0.00023296692,0.0000025918796],"about_ca_topic_score_codex":0.007829026,"about_ca_topic_score_gemma":0.0067425785,"teacher_disagreement_score":0.007829026,"about_ca_system_score_codex":0.0012831319,"about_ca_system_score_gemma":0.0016825318,"threshold_uncertainty_score":0.015566945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047714408,0.00021568443,0.9934016,0.00015303362,0.00002899229,0.000026900467,0.000024298746,0.0003970166,0.0009811288],"genre_scores_gemma":[0.28686526,0.0006011696,0.7073334,0.00027441332,0.00007985151,0.0004220332,0.0002595942,0.0002704051,0.0038938948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995759,0.00014081257,0.000034623896,0.00006535833,0.00012557687,0.000057669662],"domain_scores_gemma":[0.99887544,0.00070509146,0.00007337362,0.000047496305,0.00027282024,0.000025765483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012104466,0.0015306153,0.0011986153,0.0007143285,0.00049801625,0.0008392292,0.0011744938,0.0012707938,0.0020328069],"category_scores_gemma":[0.003936523,0.00065712864,0.00075428816,0.0008436591,0.00072714797,0.0011530119,0.0010314097,0.0021955736,0.0004594333],"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.000035962486,0.000037019763,0.00046347687,0.0000929872,0.000049134364,0.00006563622,0.000068738416,0.90992534,0.0016206967,0.00846309,0.0015020332,0.07767593],"study_design_scores_gemma":[0.00000435802,0.0000059595536,0.000027626744,0.0000037251207,0.0000024696517,0.000004944848,0.0000036192985,0.99800867,0.00023753694,0.0014295839,0.0002694597,0.0000020191321],"about_ca_topic_score_codex":0.0135282865,"about_ca_topic_score_gemma":0.011538451,"teacher_disagreement_score":0.0135282865,"about_ca_system_score_codex":0.00092852593,"about_ca_system_score_gemma":0.0020984744,"threshold_uncertainty_score":0.0268991},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010857877,0.00030963233,0.98012435,0.00031165633,0.00006503543,0.0002266918,0.00018314658,0.0008659928,0.0070557],"genre_scores_gemma":[0.06853582,0.00021262695,0.92664593,0.0001562821,0.000051659383,0.00039273823,0.00052685133,0.00018951677,0.0032884842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991658,0.00018417981,0.00003799971,0.00016643226,0.00031497868,0.00013066993],"domain_scores_gemma":[0.9991009,0.00046675318,0.000083735846,0.00008195977,0.00019132881,0.00007542241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012588535,0.0017643657,0.0015901315,0.0014581153,0.001138431,0.001578997,0.0022043912,0.002202348,0.006175032],"category_scores_gemma":[0.0027216943,0.00094763614,0.001380911,0.0022398492,0.0005985549,0.0018390346,0.0014487237,0.0023669659,0.0013183213],"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.00015367607,0.00021672397,0.0004124033,0.0001223273,0.00004765132,0.000087887835,0.000049664017,0.7725138,0.0017146493,0.009344431,0.006164184,0.20917253],"study_design_scores_gemma":[0.0000479162,0.00003488183,0.000054966175,0.000006644387,0.000007684592,0.00002635993,0.000008810848,0.99375546,0.0004452757,0.004414555,0.0011912617,0.0000061300693],"about_ca_topic_score_codex":0.009073329,"about_ca_topic_score_gemma":0.0077394117,"teacher_disagreement_score":0.009073329,"about_ca_system_score_codex":0.0014755833,"about_ca_system_score_gemma":0.0029476578,"threshold_uncertainty_score":0.020657599},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14872667,0.00097610464,0.84379786,0.000669967,0.000098485434,0.00010044666,0.0014570107,0.001323528,0.0028499283],"genre_scores_gemma":[0.9016206,0.00071970874,0.090508245,0.00014877647,0.00012641278,0.0001585635,0.0030371968,0.00012085444,0.0035595226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921286,0.00025871326,0.000039688854,0.00020627305,0.0001696568,0.00011286339],"domain_scores_gemma":[0.99843425,0.00096406636,0.0001732866,0.00010541644,0.00026206928,0.000060855546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018017071,0.0010583835,0.0015874268,0.0014344977,0.0005541634,0.0011026752,0.0022188956,0.0014626754,0.0018778301],"category_scores_gemma":[0.005131401,0.0010863557,0.0016165059,0.0020489683,0.0006358039,0.0018099182,0.00079615845,0.002224935,0.0006598375],"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.00007139497,0.000033357832,0.0024878713,0.00002226211,0.00004374951,0.000030071493,0.000040175913,0.9777309,0.00030989797,0.005676291,0.00082707976,0.0127269365],"study_design_scores_gemma":[0.0000045893703,0.0000040566533,0.00032099523,0.0000021016958,0.0000050711647,0.0000033391116,0.0000028326242,0.99831665,0.00003657313,0.0011963649,0.00010131647,0.000006103724],"about_ca_topic_score_codex":0.07408648,"about_ca_topic_score_gemma":0.051913146,"teacher_disagreement_score":0.07408648,"about_ca_system_score_codex":0.00127864,"about_ca_system_score_gemma":0.0012415402,"threshold_uncertainty_score":0.1473105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21613926,0.0010144307,0.7582618,0.0012185002,0.00023410024,0.00017705325,0.0004168455,0.000919793,0.021618191],"genre_scores_gemma":[0.9357972,0.00029183298,0.05643167,0.00013179044,0.000030971758,0.00007536851,0.00017457732,0.00012089354,0.0069455775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990374,0.00033501346,0.000026724441,0.00018116107,0.00018213097,0.00023763647],"domain_scores_gemma":[0.9987863,0.0006791787,0.00015014918,0.0000936374,0.00014507021,0.00014575849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014363115,0.0006118331,0.0006333735,0.0007043771,0.0012833813,0.0015287589,0.0012778961,0.0009781156,0.0059237615],"category_scores_gemma":[0.0031193008,0.0005534714,0.0005865596,0.0009572086,0.0009377903,0.0016113971,0.0015559366,0.001042382,0.00054600916],"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.00017797266,0.00007728536,0.0022042505,0.000107083666,0.000030709783,0.00027339402,0.00023795509,0.9326708,0.0023370306,0.021523818,0.0031463648,0.037213404],"study_design_scores_gemma":[0.000016652593,0.000101884376,0.0009464449,0.000025721005,0.00001886662,0.00011515477,0.00036135688,0.97451484,0.0017358185,0.01659447,0.0055419416,0.000026945949],"about_ca_topic_score_codex":0.012411844,"about_ca_topic_score_gemma":0.0097127,"teacher_disagreement_score":0.012411844,"about_ca_system_score_codex":0.0016326071,"about_ca_system_score_gemma":0.001454137,"threshold_uncertainty_score":0.024679184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03797285,0.00060126884,0.9496596,0.0005741124,0.00012797235,0.00014181982,0.0002868286,0.00018467076,0.010450932],"genre_scores_gemma":[0.66404235,0.0013009899,0.31862956,0.00019905323,0.00016400553,0.000605958,0.000733198,0.00015800862,0.014166859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996308,0.00014374474,0.000014690934,0.00009051966,0.00005690332,0.00006334073],"domain_scores_gemma":[0.99947196,0.0003579048,0.000060755414,0.000018887355,0.00006239986,0.000028109676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000763452,0.0013566705,0.00093983463,0.00054083293,0.00049509166,0.0013481074,0.0012756353,0.0015353222,0.0046756538],"category_scores_gemma":[0.0015833065,0.0007489427,0.001155155,0.0007853957,0.0006021644,0.0010984291,0.0007809991,0.0014210809,0.00040057348],"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.000011206821,0.000020577067,0.00021030927,0.00004457071,0.000011065774,0.00004501561,0.00001531293,0.98882574,0.00018603994,0.006052515,0.0004922706,0.0040855417],"study_design_scores_gemma":[0.0000052609566,0.000011901062,0.000040515562,0.0000035769813,0.000004704751,0.000007824059,0.000012840473,0.99674714,0.000068464724,0.0026086408,0.0004866207,0.0000025013303],"about_ca_topic_score_codex":0.017964207,"about_ca_topic_score_gemma":0.016333554,"teacher_disagreement_score":0.017964207,"about_ca_system_score_codex":0.0011491452,"about_ca_system_score_gemma":0.0025584276,"threshold_uncertainty_score":0.035719275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22088529,0.0008938927,0.7605375,0.002826557,0.00022341778,0.00025688118,0.0020471332,0.00047867533,0.011850606],"genre_scores_gemma":[0.93239015,0.00042554137,0.060343828,0.00017243919,0.000092039074,0.00018601769,0.00065532106,0.000092273294,0.005642426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983804,0.0005922616,0.0000590344,0.00037769208,0.00022683959,0.0003637297],"domain_scores_gemma":[0.99710697,0.0019649838,0.00040103888,0.00011143619,0.00015422696,0.00026129367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018519722,0.0008442244,0.0015390011,0.0005891925,0.0007419933,0.001633802,0.0019722907,0.0018643946,0.004787409],"category_scores_gemma":[0.0053207683,0.0009201922,0.0011189859,0.0012208306,0.00080165913,0.0015639657,0.0011095855,0.001631962,0.00033420086],"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.00007725064,0.000033318818,0.000609352,0.000042451986,0.000021780463,0.00011549313,0.000028263456,0.9848157,0.00026934952,0.008582074,0.00092449196,0.00448049],"study_design_scores_gemma":[0.0000143542775,0.000019903016,0.0002804834,0.0000051260745,0.000007904705,0.000032007916,0.000025764157,0.9921651,0.00010579181,0.00690905,0.0004269774,0.0000075515454],"about_ca_topic_score_codex":0.019668711,"about_ca_topic_score_gemma":0.017707262,"teacher_disagreement_score":0.019668711,"about_ca_system_score_codex":0.0027420605,"about_ca_system_score_gemma":0.002495055,"threshold_uncertainty_score":0.039108455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071570193,0.00009851052,0.9918825,0.00011449882,0.000010506857,0.00004538198,0.000013127497,0.00009110039,0.0005873739],"genre_scores_gemma":[0.5184005,0.0003796677,0.47929257,0.00016080328,0.000047040285,0.0004435892,0.00015099489,0.00008746534,0.0010373625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880135,0.00071691273,0.000056741865,0.00011138267,0.00023959423,0.00007397027],"domain_scores_gemma":[0.99619246,0.002838991,0.00020747901,0.00023140747,0.00035987614,0.00016987385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033246912,0.000784571,0.00085497595,0.0007944271,0.0004988073,0.00080964284,0.0014032619,0.000904701,0.0011227845],"category_scores_gemma":[0.009340765,0.0005783684,0.0009191455,0.00071351003,0.001066611,0.0013638904,0.0015046849,0.00126058,0.00015890342],"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.000031988908,0.000029760691,0.00056475843,0.000040831725,0.000026570066,0.0000385623,0.00005493933,0.96677333,0.0010297765,0.017109081,0.0003086498,0.013991684],"study_design_scores_gemma":[0.0000043333844,0.000013836078,0.000030838873,0.0000037896357,0.0000021301707,0.0000054391867,0.0000048536976,0.9962758,0.00014739326,0.0033515468,0.00015799813,0.0000021413853],"about_ca_topic_score_codex":0.00430485,"about_ca_topic_score_gemma":0.0035394682,"teacher_disagreement_score":0.00430485,"about_ca_system_score_codex":0.0009192852,"about_ca_system_score_gemma":0.0011850749,"threshold_uncertainty_score":0.017582834},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006924346,0.004922495,0.0019711992,0.15436749,0.7267156,0.00022126835,0.0011601795,0.00057260116,0.10937672],"genre_scores_gemma":[0.006963192,0.0051718624,0.0013281617,0.10097927,0.5536996,0.00030195396,0.0016790162,0.0005242412,0.32935274],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952062,0.0006413805,0.00025766407,0.00060230325,0.0025474138,0.0007450081],"domain_scores_gemma":[0.9897642,0.0032317573,0.0009000588,0.00052204746,0.0038050967,0.0017767677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046106507,0.0018525753,0.0016133278,0.0025247124,0.0029271145,0.008270795,0.003172544,0.017977638,0.07664499],"category_scores_gemma":[0.009670098,0.0006258329,0.0014600634,0.0016125093,0.001434064,0.0039436608,0.0025285485,0.008530922,0.02912981],"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.000017679573,0.000017892738,0.000026762249,0.000027746133,0.0000021641738,0.000023260625,0.0000042047973,0.00004780232,0.00008750075,0.0011456076,0.99587196,0.0027275647],"study_design_scores_gemma":[0.000021259906,0.000032506116,0.0004975941,0.00011160151,0.000007594998,0.000029974526,0.000028361887,0.00038662192,0.00015862317,0.0020962015,0.9966131,0.000016577504],"about_ca_topic_score_codex":0.006686207,"about_ca_topic_score_gemma":0.018096903,"teacher_disagreement_score":0.07664499,"about_ca_system_score_codex":0.0031171576,"about_ca_system_score_gemma":0.0055066207,"threshold_uncertainty_score":0.25640303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014599229,0.0006426356,0.9787636,0.0003870719,0.00009081723,0.00022268086,0.00025568594,0.000517199,0.004521125],"genre_scores_gemma":[0.13905202,0.00052511226,0.85439116,0.00019301467,0.00009420771,0.00047201707,0.00096578785,0.0002614289,0.0040452713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895525,0.00034690308,0.000044343116,0.00023062051,0.0002193299,0.0002035914],"domain_scores_gemma":[0.998406,0.0010545966,0.00010524108,0.000118820564,0.00019232408,0.00012303308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018035107,0.0016865998,0.0023404441,0.0010478632,0.00084013207,0.0021148117,0.0025709034,0.00279792,0.008191031],"category_scores_gemma":[0.004000808,0.00091004,0.0012278991,0.0023133394,0.00061195676,0.0023170412,0.0016742838,0.0026481596,0.0013710747],"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.00024611916,0.00025426646,0.0005629733,0.00032028023,0.00006310352,0.0001339563,0.00009924398,0.80846083,0.0013447035,0.030242983,0.006975188,0.15129642],"study_design_scores_gemma":[0.000043577762,0.000040188697,0.00006390195,0.000013799749,0.000012341463,0.000025255846,0.000016883909,0.9868198,0.00025909385,0.011402908,0.0012965216,0.00000574376],"about_ca_topic_score_codex":0.005094344,"about_ca_topic_score_gemma":0.004925487,"teacher_disagreement_score":0.008191031,"about_ca_system_score_codex":0.0016836261,"about_ca_system_score_gemma":0.0028847381,"threshold_uncertainty_score":0.027401686},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015245289,0.00014239445,0.9803678,0.00023353279,0.00006865144,0.00017144368,0.00015392988,0.00057629816,0.0030406497],"genre_scores_gemma":[0.8286508,0.00018289477,0.16584633,0.00012618868,0.00004588147,0.0005503532,0.00024444613,0.00014284873,0.0042103967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985885,0.0005159714,0.0000643328,0.00036006255,0.00025712568,0.0002140551],"domain_scores_gemma":[0.9976387,0.001194415,0.00024429505,0.00023222085,0.00046001218,0.00023040183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021315455,0.0010856093,0.0010207858,0.0007840321,0.000768122,0.0014396529,0.0023813,0.0010880491,0.0060953],"category_scores_gemma":[0.0062517016,0.0008113683,0.0007979832,0.00078090234,0.0010353823,0.0018386617,0.0023800058,0.0014441796,0.00070261286],"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.00010685424,0.00004929935,0.00055766606,0.000062191735,0.000022755528,0.00006153058,0.00010335681,0.9582658,0.0014487163,0.013045549,0.001169846,0.025106477],"study_design_scores_gemma":[0.0000108875765,0.00004106323,0.00011765189,0.0000055713876,0.000005878646,0.000009851727,0.000029064895,0.9914534,0.00051178865,0.0067365505,0.001069326,0.000009006623],"about_ca_topic_score_codex":0.0074367346,"about_ca_topic_score_gemma":0.0048339013,"teacher_disagreement_score":0.0074367346,"about_ca_system_score_codex":0.0016542271,"about_ca_system_score_gemma":0.0020092328,"threshold_uncertainty_score":0.020390749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029979663,0.00027821923,0.9646247,0.00023505978,0.000035745474,0.000095529846,0.00025296805,0.00017814046,0.0043198373],"genre_scores_gemma":[0.7335157,0.00068927783,0.25694573,0.00018778713,0.00005895037,0.00032661762,0.0005972828,0.000194721,0.007484017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874747,0.0004390726,0.000038060025,0.0002513318,0.00025842513,0.00026555095],"domain_scores_gemma":[0.9984863,0.00082904246,0.00022563439,0.0001003718,0.00023350788,0.00012511811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021714328,0.0013107593,0.0013857471,0.00086351036,0.0005549187,0.0015643239,0.0020543651,0.00158628,0.0050766785],"category_scores_gemma":[0.0033910095,0.0009137013,0.0011497556,0.0018016376,0.00076874555,0.0017988511,0.001042453,0.0015428176,0.00047267956],"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.00003418456,0.000025138079,0.00031196408,0.000049922386,0.00002256296,0.00005254778,0.000021954005,0.9741165,0.0007152528,0.015437541,0.0006422298,0.008570246],"study_design_scores_gemma":[0.000008409717,0.000024520197,0.00011638244,0.00000578416,0.000009303809,0.000020587771,0.000016283006,0.99005365,0.00028553608,0.00871432,0.0007395387,0.00000565746],"about_ca_topic_score_codex":0.0070103877,"about_ca_topic_score_gemma":0.007162799,"teacher_disagreement_score":0.0070103877,"about_ca_system_score_codex":0.002486098,"about_ca_system_score_gemma":0.0022566982,"threshold_uncertainty_score":0.018037975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012759372,0.00053601107,0.98396814,0.00038043145,0.00008202595,0.000016804754,0.00030793913,0.001004444,0.0009449115],"genre_scores_gemma":[0.78366536,0.0011838042,0.20325539,0.00035202721,0.00027680147,0.00020949019,0.0022270298,0.00042867108,0.008401473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953663,0.00012190411,0.000026270776,0.00014406726,0.00009347559,0.00007777452],"domain_scores_gemma":[0.99898046,0.00055531197,0.00012080067,0.00010106132,0.00017749473,0.00006498096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013146619,0.0010892386,0.0014981427,0.00090537703,0.00046715036,0.001161992,0.0023076697,0.0013370164,0.0024751625],"category_scores_gemma":[0.0039672754,0.0010406768,0.00147336,0.0013298589,0.000729922,0.0020674693,0.0014538898,0.003030064,0.0009311864],"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.00008162277,0.000029116152,0.0009890404,0.000033627486,0.000062383144,0.000040766474,0.000033124517,0.95140463,0.000594059,0.013059363,0.002105079,0.031567093],"study_design_scores_gemma":[0.0000017585558,0.0000017554257,0.000043318516,0.0000015660919,0.000002545861,0.000003096707,9.355041e-7,0.9970413,0.00005421149,0.0027049594,0.00014222326,0.0000023353066],"about_ca_topic_score_codex":0.026964432,"about_ca_topic_score_gemma":0.022801053,"teacher_disagreement_score":0.026964432,"about_ca_system_score_codex":0.0012592449,"about_ca_system_score_gemma":0.0015871298,"threshold_uncertainty_score":0.053614974},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010323963,0.0076755616,0.004133756,0.050447326,0.6815169,0.00044732337,0.0068470533,0.0024034881,0.24549614],"genre_scores_gemma":[0.003695151,0.005140423,0.0021068016,0.010335568,0.13095716,0.00035739894,0.011190409,0.0018299671,0.83438706],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970216,0.0004379717,0.0001932067,0.00032146636,0.001596601,0.00042910627],"domain_scores_gemma":[0.9909246,0.0009483693,0.0004229997,0.0006922407,0.0045887423,0.0024229842],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004493567,0.0021066742,0.0019473408,0.0047864844,0.002882476,0.012213792,0.002355064,0.004993333,0.4021943],"category_scores_gemma":[0.006587775,0.00058563845,0.0015404562,0.0031174968,0.0010378357,0.0057433043,0.004439125,0.004820343,0.25615388],"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.000025965508,0.000018002323,0.000034974048,0.00006693371,0.0000033959404,0.0000226269,0.0000049274786,0.000034354252,0.00009351019,0.0006258786,0.99117297,0.007896375],"study_design_scores_gemma":[0.0000117090285,0.000017414684,0.00017467052,0.00009588121,0.0000043909527,0.00002609663,0.000024402012,0.00016426377,0.00009217148,0.0011021098,0.99828005,0.000006837845],"about_ca_topic_score_codex":0.004986536,"about_ca_topic_score_gemma":0.014094591,"teacher_disagreement_score":0.4021943,"about_ca_system_score_codex":0.0034474996,"about_ca_system_score_gemma":0.0062495633,"threshold_uncertainty_score":0.85269725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01870477,0.00037917995,0.97789997,0.00037089395,0.00005699395,0.000012479462,0.00017204479,0.00057783944,0.0018258617],"genre_scores_gemma":[0.86663854,0.0007746107,0.12685034,0.00015928659,0.0002116755,0.00008378537,0.0007207235,0.00015153151,0.0044095702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995702,0.00012202696,0.000018735584,0.00015190282,0.00009216984,0.000044918666],"domain_scores_gemma":[0.99911445,0.00049210194,0.00012245723,0.000080098616,0.00016084607,0.000030122696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009272834,0.00067292916,0.0008139772,0.00071335846,0.00023660231,0.0008275589,0.0013659142,0.00083648,0.0013941826],"category_scores_gemma":[0.003640287,0.0005381182,0.0007095179,0.0009842855,0.00044236478,0.0014039028,0.00080806046,0.0014104458,0.00041221772],"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.0000135804385,0.0000081303515,0.00035944505,0.0000123062155,0.000014805927,0.000014774191,0.00001066846,0.9703362,0.00026468164,0.0069577885,0.00045840477,0.021549292],"study_design_scores_gemma":[9.937411e-7,0.0000022711997,0.00004459421,0.0000013525993,0.0000014243009,0.0000027163653,6.993996e-7,0.9976574,0.00004696528,0.0020752985,0.00016461329,0.000001614503],"about_ca_topic_score_codex":0.012209581,"about_ca_topic_score_gemma":0.007362981,"teacher_disagreement_score":0.012209581,"about_ca_system_score_codex":0.000719997,"about_ca_system_score_gemma":0.0007212637,"threshold_uncertainty_score":0.024277031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022010686,0.00096815504,0.9539706,0.00092100055,0.00016124718,0.0004567387,0.0011132492,0.00042640546,0.019971937],"genre_scores_gemma":[0.23704077,0.0012968077,0.744468,0.00026481974,0.00016331213,0.001125537,0.0028552471,0.0004062794,0.012379236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993438,0.00025679354,0.00002852217,0.00012147191,0.00014904198,0.0001003655],"domain_scores_gemma":[0.998723,0.00091666356,0.000093614944,0.000046030247,0.00014773643,0.000072927076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014086532,0.0016165276,0.0012872227,0.0009920715,0.00073568115,0.0017644631,0.0013350995,0.0017311771,0.015645111],"category_scores_gemma":[0.0037450453,0.00064077607,0.0011843612,0.0018508654,0.00054952555,0.001168365,0.0009562976,0.002417704,0.0014840106],"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.00010456817,0.00013735137,0.0007091836,0.00036206425,0.000041746513,0.0002369865,0.00006180169,0.8975902,0.00071697135,0.034063283,0.011053337,0.054922372],"study_design_scores_gemma":[0.00003835387,0.00004160388,0.00016606563,0.0000340695,0.000014167433,0.000058556623,0.00003322998,0.9739546,0.00031065647,0.022064434,0.0032758943,0.00000829225],"about_ca_topic_score_codex":0.0070564914,"about_ca_topic_score_gemma":0.009776658,"teacher_disagreement_score":0.015645111,"about_ca_system_score_codex":0.0015701678,"about_ca_system_score_gemma":0.002738365,"threshold_uncertainty_score":0.052338123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34710604,0.0004757282,0.6383596,0.0004970603,0.00010225832,0.0003745812,0.00040122363,0.0006329397,0.012050574],"genre_scores_gemma":[0.8691136,0.00022536381,0.124837525,0.00008844382,0.000021057313,0.00014783329,0.00027800226,0.00013230676,0.005155853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994698,0.00018370773,0.000016040267,0.00010662905,0.000089021414,0.0001347812],"domain_scores_gemma":[0.999172,0.0003967003,0.000114302864,0.000081411934,0.00009941058,0.0001361229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009291118,0.0016415422,0.001109177,0.00062924775,0.00053851045,0.0012705935,0.0022582533,0.0013523155,0.004948453],"category_scores_gemma":[0.001633904,0.00092028687,0.00095765933,0.000770102,0.000587291,0.0019384412,0.0010946576,0.0011336029,0.0004603022],"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.00009117243,0.0001071922,0.00057632837,0.00005226528,0.000030027339,0.000081062295,0.000025085048,0.98402274,0.0018213805,0.0020920064,0.00050681864,0.010593788],"study_design_scores_gemma":[0.000013686978,0.00005777571,0.000098594464,0.0000029343892,0.0000071260274,0.000019489216,0.000017829307,0.9985044,0.00039185552,0.0005633871,0.00031939062,0.0000036414522],"about_ca_topic_score_codex":0.0106943585,"about_ca_topic_score_gemma":0.009355558,"teacher_disagreement_score":0.0106943585,"about_ca_system_score_codex":0.0013691963,"about_ca_system_score_gemma":0.0014519715,"threshold_uncertainty_score":0.021264195},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010552331,0.06298648,0.0312508,0.021481276,0.8519471,0.0001456075,0.0010393558,0.0006030062,0.02949111],"genre_scores_gemma":[0.0055103935,0.0379921,0.008683012,0.0044986354,0.81754357,0.00017804976,0.0023499911,0.0009805082,0.12226371],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977946,0.00044587775,0.00021073851,0.0005653572,0.0008415082,0.00014187119],"domain_scores_gemma":[0.9891801,0.0048508383,0.00042909992,0.0011119924,0.0032807097,0.001147199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039810673,0.0023191408,0.0034897316,0.0048310645,0.0014201433,0.0056958986,0.002571993,0.0035926586,0.086950004],"category_scores_gemma":[0.010359784,0.00072527945,0.0021417008,0.0033527506,0.0012436564,0.0047553717,0.0024857798,0.004620178,0.030304264],"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.000045433117,0.000083266445,0.00026226937,0.0004862622,0.00007578286,0.00008859121,0.000016414097,0.00067137566,0.0002886557,0.004999006,0.9245739,0.06840898],"study_design_scores_gemma":[0.000030901738,0.00013308422,0.0014961478,0.00050721614,0.00008116529,0.000388826,0.000048259524,0.006834807,0.00034328765,0.02386643,0.9662318,0.00003811996],"about_ca_topic_score_codex":0.0014108407,"about_ca_topic_score_gemma":0.002855881,"teacher_disagreement_score":0.086950004,"about_ca_system_score_codex":0.0015967869,"about_ca_system_score_gemma":0.0021422347,"threshold_uncertainty_score":0.29087675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051117205,0.00010422803,0.99860257,0.000044623815,0.00001043301,0.000017367445,0.000014998426,0.000069873095,0.0006247253],"genre_scores_gemma":[0.12105936,0.0009395832,0.87291414,0.00020344944,0.00010210781,0.00068593374,0.00037751638,0.0002521225,0.003465802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911875,0.00039050242,0.000041134008,0.00014709654,0.0002393718,0.00006315975],"domain_scores_gemma":[0.9986222,0.00089529087,0.00012568734,0.000054727378,0.00024820794,0.00005385189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021460115,0.0014959566,0.001691543,0.0010158907,0.0005425453,0.0011438641,0.0018244574,0.0014886141,0.0031771315],"category_scores_gemma":[0.0039983615,0.00094051677,0.0016395538,0.0011692407,0.0008026968,0.0010158936,0.0016955594,0.0024150177,0.0007613821],"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.000025525938,0.000022835395,0.0002027093,0.00008787393,0.000043913944,0.000024845238,0.000026929825,0.9593162,0.0008475673,0.014510612,0.00064560183,0.024245422],"study_design_scores_gemma":[0.0000034796806,0.000007068386,0.000018947343,0.000006129617,0.000003840333,0.0000038932726,0.0000022513825,0.99718326,0.00010311798,0.0021890565,0.00047548156,0.0000034434602],"about_ca_topic_score_codex":0.009603237,"about_ca_topic_score_gemma":0.007500965,"teacher_disagreement_score":0.009603237,"about_ca_system_score_codex":0.0009530113,"about_ca_system_score_gemma":0.0029905732,"threshold_uncertainty_score":0.019094646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104099706,0.0005352005,0.8849678,0.0008292767,0.000090092755,0.00012303666,0.0009751895,0.00045592172,0.007923801],"genre_scores_gemma":[0.86735946,0.0004955725,0.12569392,0.00017289256,0.000084537336,0.0001728309,0.0007067622,0.0001455539,0.0051683867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800926,0.0006321553,0.00007035786,0.0005542745,0.0003021557,0.00043186356],"domain_scores_gemma":[0.9955107,0.0029529328,0.0006038247,0.00031772713,0.00035367432,0.00026124608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017756561,0.0013197165,0.0015952619,0.0007336844,0.0006901757,0.0020646388,0.002229691,0.0016981879,0.004779766],"category_scores_gemma":[0.005981518,0.000947077,0.0011263293,0.0019788428,0.0010417814,0.0031800566,0.001389258,0.0020832007,0.00040011073],"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.00006235196,0.000023159348,0.00039869326,0.000040940966,0.000019440402,0.000074912736,0.000024903478,0.9853371,0.00035303773,0.008253457,0.0006474226,0.00476464],"study_design_scores_gemma":[0.000012062447,0.000022573022,0.00020682855,0.0000052664273,0.000011822056,0.000043687058,0.00003802155,0.9881643,0.00022578202,0.010671206,0.0005908571,0.0000075300513],"about_ca_topic_score_codex":0.0165362,"about_ca_topic_score_gemma":0.014271942,"teacher_disagreement_score":0.0165362,"about_ca_system_score_codex":0.0033097633,"about_ca_system_score_gemma":0.0019458095,"threshold_uncertainty_score":0.03287989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02546759,0.00022996466,0.96966,0.0002474645,0.00008465495,0.00010458338,0.0001768871,0.0002362435,0.0037925919],"genre_scores_gemma":[0.8559749,0.00036320687,0.13738178,0.00013728856,0.00008962534,0.0001769777,0.00028477333,0.00010852448,0.0054829163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981799,0.0006317112,0.00006208534,0.0003060489,0.00042372965,0.00039646635],"domain_scores_gemma":[0.99778026,0.0014190237,0.00019962444,0.00020207041,0.00023596932,0.00016310549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023268291,0.0008928431,0.0012536448,0.0006431539,0.0007941418,0.0016148554,0.0017002902,0.001014727,0.0035984614],"category_scores_gemma":[0.005688841,0.00057489274,0.000950586,0.0009467401,0.001228422,0.0019076412,0.0012462379,0.0009822325,0.00034760305],"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.00005673452,0.000018702689,0.00019684894,0.000034203855,0.000015256205,0.000052988904,0.000021059004,0.95619667,0.0005612707,0.031660806,0.00069263804,0.010492775],"study_design_scores_gemma":[0.000011611799,0.000025669617,0.000060427737,0.0000044301014,0.0000060047632,0.00001958457,0.000011039364,0.969842,0.0003013341,0.028909646,0.0008029233,0.0000052965324],"about_ca_topic_score_codex":0.0064242026,"about_ca_topic_score_gemma":0.006522091,"teacher_disagreement_score":0.0064242026,"about_ca_system_score_codex":0.0022856342,"about_ca_system_score_gemma":0.0025211952,"threshold_uncertainty_score":0.016583502},"labels":[],"label_agreement":null}]}