{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"2fec6a3f013b","filters":{"venue":"EURO Journal on Transportation and Logistics"}},"results":[{"id":"W1974861471","doi":"10.1007/s13676-012-0005-x","title":"Districting for routing with stochastic customers","year":2012,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"National University of Defense Technology; National Natural Science Foundation of China","keywords":"Heuristic; Mathematical optimization; Routing (electronic design automation); Vehicle routing problem; Computer science; Compact space; Operations research; Mathematics","authors":[{"name":"Hongtao Lei","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Bo Guo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02845152547853514,"gpt":0.2688076632308992,"spread":0.2403561377523641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003314769,0.0001073781,0.0001104888,0.00006601057,0.0001452723,0.00003777313,0.0000362331,0.00003553847,0.000006897172],"category_scores_gemma":[0.0001053233,0.00009185658,0.00002602992,0.0001094939,0.00002203304,0.0001000785,4.071694e-7,0.0001975983,0.000001267176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002575476,"about_ca_system_score_gemma":0.000008843631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.756689e-7,"about_ca_topic_score_gemma":6.647396e-7,"domain_scores_codex":[0.9993563,0.00002150051,0.0002234166,0.00006474929,0.0001169951,0.0002170599],"domain_scores_gemma":[0.9994627,0.0002245447,0.00007802802,0.00004370102,0.00005911693,0.0001318613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002934852,0.00001498892,0.002721588,0.00003098034,0.00002229974,0.000003062866,0.0006393068,0.9887727,0.0001249232,0.002899148,0.00003431176,0.004707283],"study_design_scores_gemma":[0.003858308,0.0005957551,0.09877473,0.0002895084,0.0004651861,0.0001833705,0.001808648,0.8876566,0.0007453886,0.0001848687,0.004386216,0.001051477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04088952,0.0000667962,0.9582531,0.00002968888,0.0002895482,0.00008279174,0.00001608631,0.00008234808,0.0002901156],"genre_scores_gemma":[0.9508703,0.00002365803,0.0488149,0.00005368618,0.0001680348,0.00000266708,0.00001481326,0.00003105346,0.0000208817],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9099808,"threshold_uncertainty_score":0.3745802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2225208082","doi":"10.1007/s13676-016-0101-4","title":"The vehicle routing problem with hard time windows and stochastic service times","year":2016,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Probabilistic logic; Set (abstract data type); Stochastic dominance; Computer science; Service (business); Dimension (graph theory); Resource constraints; Routing (electronic design automation); Mathematics; Distributed computing; Artificial intelligence; Economics","authors":[{"name":"Fausto Errico","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Walter Rei","is_ca":true},{"name":"Louis Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01452917871732855,"gpt":0.2227213024743448,"spread":0.2081921237570163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003622695,0.000121765,0.0001111267,0.00003607678,0.0002340875,0.00009121632,0.00006311928,0.00003727379,0.00001916467],"category_scores_gemma":[0.0000516499,0.00006785132,0.00001435291,0.0001012646,0.00005343233,0.00009189975,0.000001456618,0.0001712485,0.000008961212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001609571,"about_ca_system_score_gemma":0.00001666417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.070453e-7,"about_ca_topic_score_gemma":0.000005694441,"domain_scores_codex":[0.9992791,0.00005430796,0.0002388859,0.000104356,0.0001539479,0.0001694297],"domain_scores_gemma":[0.9992958,0.0003530339,0.00008074224,0.00007352245,0.00009836323,0.00009851399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001731319,0.00002256541,0.002905737,0.00005588453,0.00009507776,0.00003911064,0.001113281,0.9481926,0.004591234,0.004100345,0.0002197291,0.03849132],"study_design_scores_gemma":[0.006140305,0.0008514554,0.1876835,0.0009721879,0.0003305136,0.0002902256,0.0004131911,0.7935244,0.001216961,0.00235722,0.005136701,0.001083271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07686471,0.0001332763,0.9205061,0.001584124,0.00009921256,0.0001553979,0.00001914674,0.0001415982,0.0004964981],"genre_scores_gemma":[0.9826524,0.0001518377,0.01661865,0.0001704927,0.00006901153,0.000002475373,0.000002950895,0.00003585128,0.0002962762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9057878,"threshold_uncertainty_score":0.2766896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116517820","doi":"10.1007/s13676-013-0020-6","title":"Vehicle routing: historical perspective and recent contributions","year":2013,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Perspective (graphical); Vehicle routing problem; Set (abstract data type); Routing (electronic design automation); Computer science; Operations research; Engineering; Management science; Artificial intelligence; Computer network","authors":[{"name":"Gilbert Laporte","is_ca":true},{"name":"Paolo Toth","is_ca":false},{"name":"Daniele Vigo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02371556260648799,"gpt":0.267855410196206,"spread":0.244139847589718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001884219,0.0001003127,0.0001252279,0.00006285424,0.0001449829,0.00006628008,0.00003534726,0.00005539531,0.00007155658],"category_scores_gemma":[0.0002179737,0.00009470661,0.0000227137,0.0001063583,0.00003253695,0.00008593837,9.725878e-7,0.0003068175,0.000006587493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001878473,"about_ca_system_score_gemma":0.000014276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001085762,"about_ca_topic_score_gemma":0.00000259534,"domain_scores_codex":[0.999337,0.00005475315,0.0002463022,0.0001001931,0.000118659,0.0001431312],"domain_scores_gemma":[0.9993789,0.0001184139,0.00005420782,0.00005137399,0.0002416571,0.0001554958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001362503,0.0003873129,0.02778352,0.0001134749,0.0003052289,0.0002044416,0.009599621,0.6318665,0.01065735,0.2294944,0.01471745,0.07473445],"study_design_scores_gemma":[0.004050702,0.0006775407,0.5646937,0.0001140919,0.0002378983,0.000159486,0.001928704,0.3652029,0.00120236,0.01183658,0.04886236,0.001033672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08632912,0.0008950102,0.9056253,0.003864248,0.0006753033,0.0002075697,0.00002977433,0.0002197192,0.002153925],"genre_scores_gemma":[0.9887335,0.001312367,0.009548638,0.0001840919,0.00009363273,0.000002694958,0.000006419398,0.00001842501,0.0001002074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9024044,"threshold_uncertainty_score":0.3862024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990106667","doi":"10.1007/s13676-012-0007-8","title":"A note on logit choices in strategy transit assignment","year":2012,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Logit; Transit (satellite); Computation; Mathematical optimization; Computer science; Representation (politics); Tree (set theory); Path (computing); Sensitivity (control systems); Centroid; Mixed logit; Operations research; Public transport; Logistic regression; Mathematics; Algorithm; Transport engineering; Engineering; Artificial intelligence; Machine learning; Combinatorics; Computer network","authors":[{"name":"Michaël Florian","is_ca":true},{"name":"Isabelle Constantin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05427746854326112,"gpt":0.3282431087095666,"spread":0.2739656401663055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005956559,0.0001154853,0.0001313019,0.0001418869,0.0002742156,0.00007257104,0.0000699586,0.00009278633,0.0001267315],"category_scores_gemma":[0.00005315078,0.000105052,0.00003932038,0.0001750565,0.00008451926,0.0002202879,1.814962e-7,0.0003056345,0.00001194318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000462427,"about_ca_system_score_gemma":0.00006398342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007031016,"about_ca_topic_score_gemma":0.0005630067,"domain_scores_codex":[0.9987731,0.000132906,0.0003252935,0.0001219116,0.000375123,0.0002716526],"domain_scores_gemma":[0.9993936,0.000166847,0.0001341006,0.00004729554,0.00005275062,0.0002054024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0006528164,0.001045736,0.1999494,0.00005212982,0.000040713,0.0002140951,0.05550444,0.4811347,0.000173643,0.2335344,0.0005386217,0.02715941],"study_design_scores_gemma":[0.001179008,0.0003392883,0.9617232,0.00009453612,0.00004555143,0.000002720004,0.002217326,0.0002515544,0.00006292648,0.0007241757,0.03309257,0.0002671548],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6044732,0.0007546813,0.3226752,0.006163017,0.002726557,0.0008274249,0.0001867092,0.0002558145,0.06193737],"genre_scores_gemma":[0.9977473,0.0006149734,0.0005624662,0.0005467841,0.0001865011,0.000002521985,0.00003814065,0.00001016994,0.0002911333],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7617738,"threshold_uncertainty_score":0.4283898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2943778955","doi":"10.1016/j.ejtl.2020.100004","title":"A tutorial on recursive models for analyzing and predicting path choice behavior","year":2020,"lang":"en","type":"preprint","venue":"EURO Journal on Transportation and Logistics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intuition; Computer science; Path (computing); Discrete choice; Inverse; Theoretical computer science; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Cognitive science","authors":[{"name":"Maëlle Zimmermann","is_ca":true},{"name":"Emma Frejinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08301966753873334,"gpt":0.3385868799717806,"spread":0.2555672124330472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004567873,0.0002087205,0.0002770209,0.0001272433,0.0006534607,0.00023819,0.0001084752,0.00023952,0.00000886138],"category_scores_gemma":[0.000373749,0.0002124132,0.00009512868,0.00009885617,0.0001034404,0.0001224144,0.000001935915,0.0007131643,4.326259e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004656785,"about_ca_system_score_gemma":0.0001961525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009500352,"about_ca_topic_score_gemma":0.0001732653,"domain_scores_codex":[0.9984524,0.0001173854,0.0004791287,0.0003537881,0.000389729,0.0002075643],"domain_scores_gemma":[0.9985028,0.0004202925,0.0004769057,0.00006939529,0.0002748318,0.0002557992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.001159187,0.0003128553,0.04689284,0.0004167494,0.0002120979,0.0002271932,0.07790945,0.7120833,0.00003638958,0.1498168,0.001255776,0.009677338],"study_design_scores_gemma":[0.01554044,0.005130986,0.6741812,0.004941242,0.006800535,0.00001973996,0.01699162,0.09607141,0.00009028977,0.1140838,0.06149936,0.00464938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2012134,0.0004239975,0.7841471,0.003681464,0.005361611,0.001801007,0.001928108,0.0002614326,0.001181834],"genre_scores_gemma":[0.9896263,0.001375949,0.006766367,0.0003168631,0.001286916,0.00002790705,0.0004884389,0.00003083759,0.00008042766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7884129,"threshold_uncertainty_score":0.8661959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402827990","doi":"10.1016/j.ejtl.2024.100146","title":"Stability metrics for a maritime inventory routing problem under sailing time uncertainty","year":2024,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Routing (electronic design automation); Stability (learning theory); Vehicle routing problem; Operations research; Computer science; Marine engineering; Environmental science; Engineering; Computer network; Machine learning","authors":[{"name":"Homayoun Shaabani","is_ca":false},{"name":"Lars Magnus Hvattum","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Arild Hoff","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04209613403359662,"gpt":0.2817609257848414,"spread":0.2396647917512447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001092619,0.0001513634,0.000173223,0.0001628538,0.0001298768,0.0001600634,0.00006568155,0.00008186427,0.00006407544],"category_scores_gemma":[0.0001840722,0.0001458114,0.00007941029,0.0002962237,0.00003724312,0.0001082804,0.000001432584,0.0003722792,0.000005530768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001093154,"about_ca_system_score_gemma":0.00005017224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001731769,"about_ca_topic_score_gemma":0.000003910454,"domain_scores_codex":[0.9989055,0.00007101058,0.0004526176,0.0001723446,0.0001887277,0.0002098163],"domain_scores_gemma":[0.9991252,0.0005092412,0.00005495881,0.00007464937,0.0001179825,0.0001179467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002495524,0.00002188096,0.000452868,0.0002901811,0.00005727164,0.0000197554,0.0005014169,0.9796565,0.0006046669,0.007659999,0.0002123719,0.01049813],"study_design_scores_gemma":[0.0002926403,0.00009474937,0.001046492,0.0001252956,0.00008725281,0.00001238801,0.0001029125,0.9919904,0.0002290731,0.002877258,0.002942885,0.0001985979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01814574,0.0004197114,0.9798648,0.0001692957,0.0003834135,0.0001881994,0.00006946898,0.0002778501,0.0004815177],"genre_scores_gemma":[0.9172618,0.0001969964,0.08196922,0.0001363915,0.0001650437,0.000005872884,0.00006554129,0.00005911866,0.0001399718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8991161,"threshold_uncertainty_score":0.5946016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409885303","doi":"10.1016/j.ejtl.2025.100157","title":"50 years of Operations Research for the tactical planning of consolidation-based freight transportation","year":2025,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Université de Montréal","keywords":"Consolidation (business); Transport engineering; Operations research; Engineering; Business; Finance","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Walter Rei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09736906072891235,"gpt":0.3346004612744917,"spread":0.2372314005455794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004164801,0.00009892161,0.0001828495,0.0002122454,0.0001453568,0.00002523358,0.000111904,0.0000793064,0.00002641763],"category_scores_gemma":[0.0001097077,0.00008337796,0.00007073964,0.0002405931,0.0002276351,0.00004832801,2.867772e-7,0.0003337602,4.748609e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001719017,"about_ca_system_score_gemma":0.00009282358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001048343,"about_ca_topic_score_gemma":0.00004684777,"domain_scores_codex":[0.9989396,0.00003591073,0.0005334506,0.00009971086,0.0002410679,0.0001502501],"domain_scores_gemma":[0.9985038,0.0009871039,0.0000480182,0.0001101651,0.0002975545,0.00005337024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0002148567,0.0001045081,0.003783026,0.0002664215,0.0001165228,0.00001387279,0.0007415325,0.8618996,0.002355864,0.1282935,0.0008981368,0.00131215],"study_design_scores_gemma":[0.004473322,0.0008798442,0.7321339,0.0006491374,0.0007864097,0.00000416434,0.001196937,0.1952665,0.01340537,0.005386572,0.04533339,0.0004844434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04572737,0.0004906997,0.9520913,0.0003114556,0.0003503835,0.0002709107,0.0003627072,0.00002616563,0.0003690616],"genre_scores_gemma":[0.9952704,0.0002325599,0.004193579,0.00007060338,0.00005039303,0.000009802554,0.0001208742,0.00001477998,0.00003705551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.949543,"threshold_uncertainty_score":0.3400054,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3108778051","doi":"10.1016/j.ejtl.2020.100024","title":"Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling","year":2020,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Vehicle routing problem; Crew; Computer science; Crew scheduling; Scheduling (production processes); Routing (electronic design automation); Engineering; Embedded system; Aeronautics; Operations management","authors":[{"name":"Claudia Archetti","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Guy Desaulniers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02748217703064264,"gpt":0.2509191413029552,"spread":0.2234369642723125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006413602,0.0001244104,0.0001384374,0.0000613124,0.0002025576,0.00009700129,0.00004685753,0.00005249753,0.00002105674],"category_scores_gemma":[0.000224988,0.0001127597,0.00001210947,0.0002593802,0.00002399523,0.00007009848,0.0000026884,0.00045037,0.000002637724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002039729,"about_ca_system_score_gemma":0.000007308714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001857617,"about_ca_topic_score_gemma":0.000003440209,"domain_scores_codex":[0.9990852,0.000162948,0.0003069663,0.00017655,0.0001309459,0.0001373739],"domain_scores_gemma":[0.9995444,0.0001616275,0.00008993905,0.00005069852,0.00004260466,0.0001107589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007695948,0.000007803236,0.001489226,0.00001363618,0.000006679246,0.000003489039,0.001197773,0.9822689,0.00007875049,0.0006192403,0.0001494423,0.01408807],"study_design_scores_gemma":[0.0004586954,0.0002025704,0.006365479,0.00002392218,0.00001974172,0.000005354456,0.0001170784,0.9881327,0.00007968205,0.00004011996,0.004440232,0.0001144317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008918674,0.00009657975,0.9866961,0.003777806,0.0001800314,0.0001962069,0.00000182967,0.00006242222,0.00007039889],"genre_scores_gemma":[0.8436503,0.0007466649,0.1514213,0.0007550906,0.003342286,0.000004954793,0.00002546718,0.00004004524,0.00001386926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8352748,"threshold_uncertainty_score":0.4598209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404633920","doi":"10.1016/j.ejtl.2024.100147","title":"Dynamic rebalancing for Bike-sharing systems under inventory interval and target predictions","year":2024,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; Transport Canada","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Bike sharing; Interval (graph theory); Environmental science; Computer science; Engineering; Mathematics; Transport engineering","authors":[{"name":"Jiaqi Liang","is_ca":true},{"name":"Maria Clara Martins Silva","is_ca":true},{"name":"Daniel Aloise","is_ca":true},{"name":"Sanjay Dominik Jena","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02521225553554611,"gpt":0.2616514860036814,"spread":0.2364392304681353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001834991,0.0001163168,0.0001186782,0.0001809156,0.000122267,0.0001344494,0.00003969394,0.00005625237,0.00001222857],"category_scores_gemma":[0.00001380285,0.0001125416,0.00004214264,0.000127935,0.00003843468,0.0001320447,5.465944e-7,0.0002593231,0.000001575082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004325117,"about_ca_system_score_gemma":0.00002144066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003166465,"about_ca_topic_score_gemma":0.00003801481,"domain_scores_codex":[0.9992498,0.000008190816,0.0003712431,0.0001384142,0.0001038234,0.0001285145],"domain_scores_gemma":[0.9996928,0.00006329344,0.00003220231,0.00005813328,0.00006545024,0.00008811321],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004478468,0.00005238104,0.006418562,0.001290251,0.0002573892,0.00005624503,0.002091248,0.7742853,0.001309679,0.2118049,0.001048448,0.001340883],"study_design_scores_gemma":[0.0007711101,0.0002076499,0.1391666,0.0005318,0.0001939233,0.00006775282,0.001087912,0.8267025,0.00003167241,0.005049808,0.02585608,0.0003332105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1101236,0.001056172,0.8860991,0.0002310045,0.001624342,0.0001806241,0.0002681262,0.0002492529,0.0001677653],"genre_scores_gemma":[0.9981239,0.0003829555,0.0009822154,0.00008154898,0.00007489356,0.0000143462,0.0001498828,0.00002838926,0.000161844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8880003,"threshold_uncertainty_score":0.4589314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3009897573","doi":"10.1016/j.ejtl.2020.100020","title":"Machine learning in airline crew pairing to construct initial clusters for dynamic constraint aggregation","year":2020,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute; Université de Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Solver; Crew; Heuristics; Computer science; Pairing; Sequence (biology); Aggregate (composite); Reduction (mathematics); Constraint (computer-aided design); Baseline (sea); Mathematical optimization; Set (abstract data type); Mathematics; Engineering","authors":[{"name":"Yassine Yaakoubi","is_ca":true},{"name":"François Soumis","is_ca":true},{"name":"Simon Lacoste-Julien","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03298730818220549,"gpt":0.2884905000993498,"spread":0.2555031919171443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904507,0.0001225422,0.0001674763,0.0001140611,0.00007567692,0.00004483312,0.00004837981,0.00005014795,0.00001883225],"category_scores_gemma":[0.0003404967,0.0001311981,0.00003588016,0.0001564395,0.00003031511,0.0000602916,0.000001224415,0.0003534129,0.000001579136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003538495,"about_ca_system_score_gemma":0.0000220013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001258655,"about_ca_topic_score_gemma":0.0000149488,"domain_scores_codex":[0.9991476,0.00006074561,0.0004075256,0.0001225229,0.0001124533,0.0001491628],"domain_scores_gemma":[0.9994969,0.0001840468,0.00007584813,0.00003165006,0.00006044725,0.0001510454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007745767,0.000006116321,0.001771429,0.00006157907,0.00001055812,0.00002947174,0.0008234709,0.9637699,0.0003555848,0.00044319,0.00001006461,0.03264122],"study_design_scores_gemma":[0.001292556,0.000230125,0.00610374,0.00008380461,0.00002274194,0.00001806965,0.0002178669,0.9907435,0.0002155332,0.00009046792,0.0008160684,0.0001655496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05464844,0.00005594305,0.9437858,0.0009039933,0.0001810113,0.0001681228,0.00004245056,0.0001026643,0.0001115968],"genre_scores_gemma":[0.9206169,0.0001037561,0.07850718,0.0006256881,0.00005910744,0.000002651823,0.00005299399,0.00002670756,0.000004958045],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8659685,"threshold_uncertainty_score":0.5350103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402615264","doi":"10.1016/j.ejtl.2024.100143","title":"A metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network","year":2024,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Metaheuristic; Synchronization (alternating current); Computer science; Arrival time; Travel time; Time synchronization; Routing (electronic design automation); Fleet management; Real-time computing; Engineering; Transport engineering; Computer network; Artificial intelligence","authors":[{"name":"Fernando O. Guillen Reyes","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01312235701810524,"gpt":0.2496270787101207,"spread":0.2365047216920155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006404264,0.0002223182,0.0002369655,0.0001127811,0.0002114082,0.0002430259,0.00006180187,0.0000675971,0.00002938142],"category_scores_gemma":[0.00006452072,0.0001927291,0.00004167568,0.0002338089,0.00004019441,0.0001299414,0.00000207772,0.0003377049,0.00001353497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005733429,"about_ca_system_score_gemma":0.00003947698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000196446,"about_ca_topic_score_gemma":0.000004010296,"domain_scores_codex":[0.998736,0.00009106292,0.0004072752,0.0002481353,0.0002420234,0.0002754887],"domain_scores_gemma":[0.9992597,0.0003224796,0.00009015686,0.00008893336,0.00009893526,0.000139852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001284388,0.00002366387,0.0002981761,0.000127903,0.00009075161,0.00007050129,0.0003651512,0.9797353,0.000519114,0.001328788,0.0001439006,0.01716831],"study_design_scores_gemma":[0.001117575,0.0005276068,0.002474643,0.0003775401,0.0001975538,0.00004894432,0.00001895617,0.9938599,0.0001446706,0.000423111,0.0005600483,0.0002493947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0427496,0.0005651257,0.9548364,0.0002351205,0.0002161259,0.0004593701,0.00005413368,0.0003603947,0.0005237182],"genre_scores_gemma":[0.9667211,0.0001379303,0.03238757,0.0001291652,0.0002504434,0.00001241422,0.00004989477,0.00008879405,0.0002227533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9239714,"threshold_uncertainty_score":0.7859265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413332685","doi":"10.1016/j.ejtl.2025.100162","title":"Optimal departure time choices as quantiles and expectiles of the travel time distribution","year":2025,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Quantile; Travel time; Distribution (mathematics); Environmental science; Computer science; Statistics; Operations research; Econometrics; Engineering; Mathematics; Transport engineering","authors":[{"name":"Maria Osipenko","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0123767107567468,"gpt":0.279565462662296,"spread":0.2671887519055492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002475796,0.00008594976,0.000126523,0.00005123179,0.0004735137,0.00006284746,0.00008046256,0.00007741496,0.00005573815],"category_scores_gemma":[0.0001436307,0.00006553406,0.00004481967,0.0001827131,0.0002291258,0.00009342186,7.988141e-7,0.0001574543,0.000002225034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001253765,"about_ca_system_score_gemma":0.00009394086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004866038,"about_ca_topic_score_gemma":0.00008156207,"domain_scores_codex":[0.9991993,0.00009716922,0.0002627478,0.0001114965,0.0002218771,0.0001073688],"domain_scores_gemma":[0.9994227,0.0001705685,0.0001724636,0.00004951111,0.0001238604,0.00006084394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.001432885,0.0007719245,0.1709006,0.0002808012,0.0003686651,0.0000924231,0.05655504,0.1153263,0.005116635,0.6257712,0.009773524,0.01361002],"study_design_scores_gemma":[0.0007757914,0.0001401037,0.9763536,0.0002035606,0.0001772876,0.000004846665,0.002567297,0.001551164,0.0006017408,0.001213876,0.01623096,0.0001797128],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9680122,0.0004306927,0.02414079,0.002508733,0.0003483815,0.0002188749,0.0002436101,0.00004410294,0.004052682],"genre_scores_gemma":[0.9974045,0.0004848072,0.0003066272,0.0001486925,0.00004251584,0.000001177211,0.00007440675,0.000004570483,0.001532688],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8054531,"threshold_uncertainty_score":0.3641933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}